An approach to characterize the credibility of beliefs of an agent is proposed in this paper, which can define the uncertainty of beliefs, calculation rules and inference rules about credibility and a method for belie...An approach to characterize the credibility of beliefs of an agent is proposed in this paper, which can define the uncertainty of beliefs, calculation rules and inference rules about credibility and a method for belief revision based on abductive reasoning is also given. When an agent receives some new information, if the new information is consistent with the current belief set, then incorporate this new information with an appropriate credibility, otherwise the choice will be different depending on the characters of agents, and the deliberated agents will choose the belief with a better explanation under the current belief set. Removing one belief may cause the removal of those beliefs that, together with others, logically entail the formula to be removed. A method based on abduction is proposed to solve these problems.展开更多
Two operational approaches to belief revision are presented in this paper. The rules of Rcalculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce al...Two operational approaches to belief revision are presented in this paper. The rules of Rcalculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.展开更多
A deduction system, called RE-proof system, is constructed for generating the revisions of first order belief sets. When a belief set is rejected by a given fact, all maximal subsets of the belief set consistent with...A deduction system, called RE-proof system, is constructed for generating the revisions of first order belief sets. When a belief set is rejected by a given fact, all maximal subsets of the belief set consistent with the fact can be deduced from the proof system. The soundness and completeness of the RE-proof system are proved, which imply that there exists a resolution method to decide whether a revision retains a mtalmal subset of a belief set.展开更多
As an important variant of Relier's default logic, Poole (1988) developed a nonmonotonic reasoning framework in the classical first-order language. Brewka and Nebel extended Poole's approach in order to enabl...As an important variant of Relier's default logic, Poole (1988) developed a nonmonotonic reasoning framework in the classical first-order language. Brewka and Nebel extended Poole's approach in order to enable a representation of priorities between defaults. In this paper a general framework for default reasoning is presented, which can be viewed as a generalization of the three approaches above. It is proved that the syntax-independent default reasoning in this framework is identical to the general belief revision operation introduced by Zhang et al. (1997). This result provides a solution to the problem whether there is a correspondence between belief revision and default logic for the infinite case. As a by-product, an answer to the question, raised by Mankinson and Gardenfors (1991), is also given about whether there is a counterpart contraction in nonmonotonic logic.展开更多
The AGM postulates ([1]) are for the belief revision (revision by a single belief), and the DP postulates ([2]) are for the iterated revision (revision by a finite sequence of beliefs). Li [3] gave an R-calculus for R...The AGM postulates ([1]) are for the belief revision (revision by a single belief), and the DP postulates ([2]) are for the iterated revision (revision by a finite sequence of beliefs). Li [3] gave an R-calculus for R-configurations △|Γ, where Δ is a set of literals, and Γ is a finite set of formulas. We shall give two R-calculi such that for any consistent set Γ and finite consistent set △ of formulas in the propositional logic, in one calculus, there is a pseudo-revision Θ of Γ by Δ such that is provable and and in another calculus, there is a pre-revision Ξ of Γ by Δ such that is provable, and for some pseudo-revision Θ;and prove that the deduction systems for both the R-calculi are sound and complete with the pseudo-revision and the pre-revision, respectively.展开更多
This study aims to revise the Belief in a Just World Scale(BJWS)for Chinese college students and test its reliability and validity(construct validity,convergent and divergent validity).Two samples of 546 and 595 colle...This study aims to revise the Belief in a Just World Scale(BJWS)for Chinese college students and test its reliability and validity(construct validity,convergent and divergent validity).Two samples of 546 and 595 college students were selected,respectively,using stratified cluster random sampling.Item analysis,exploratory factor analysis(EFA),confirmatory factor analysis(CFA),reliability analysis and convergent and divergent validity tests were carried out.The results showed that the 13 items of the BJWS have good item discrimination.The corrected item–total correlation in the general belief in a just world subscale was found to range from 0.464 to 0.655,and that in the personal belief in a just world subscale was 0.553 to 0.715.The internal consistency coefficients of the revised version of the BJWS and its subscales are good.The EFA and CFA results show that the structure and items of the revised scale are the same as those of the original scale.Belief in a just world was found to have significant positive correlations with gratitude and empathy,and has a significant negative correlation with anxiety,thereby exhibiting good convergent and divergent validity.Therefore,the Chinese revised version of the BJWS has good reliability and validity.展开更多
Alternating-time Temporal Epistemic Logic (ATEL) which is an important kind of multi-agent cooperation logics only takes knowledge into account,but does not deal with belief of agents. By introducing three kinds of be...Alternating-time Temporal Epistemic Logic (ATEL) which is an important kind of multi-agent cooperation logics only takes knowledge into account,but does not deal with belief of agents. By introducing three kinds of belief operators into ATEL,a new multi-agent cooperation logic named ATBKL (Alternating-time Temporal Belief and Knowledge Logic) was developed. A model checking algorithm was proposed. It is proved that the model checking complexity of ATBKL is the same as that of ATEL,i.e.,the presented logic is better for further study of multi-agent systems.展开更多
The aim of this paper is to extend the system of belief revision developed by Alchourron, Gardenfors and Makinson (AGM) to a more general framework.This extension enables a treatment of revision not only by single sen...The aim of this paper is to extend the system of belief revision developed by Alchourron, Gardenfors and Makinson (AGM) to a more general framework.This extension enables a treatment of revision not only by single sentences but also by any sets of sentences, especially by infinite sets. The extended revision and contraction operators will be called general ones, respectively. A group of postulates for each operator is provided in such a way that it coincides with AGM's in the limit case. A notion of the nice-ordering partition is introduced to characterize the general contraction operation. A comp ut ation- orient ed ap-proach is provided for belief revision operations.展开更多
提出了一种意向驱动式面向agent程序设计语言——AOPLID(agent-oriented programming language with intention driver).该语言基于开放式情景演算OSC(open situation calculus),吸收了GOLOG的合理成分,加入对信念、意向、能力、策略等a...提出了一种意向驱动式面向agent程序设计语言——AOPLID(agent-oriented programming language with intention driver).该语言基于开放式情景演算OSC(open situation calculus),吸收了GOLOG的合理成分,加入对信念、意向、能力、策略等agent心智成分的处理,使用信念修正原语处理通信交互以及事件响应等外因行动,并采用了一种新颖的离线规划和在线执行相结合的运行方式,从而解决了GOLOG语言在应用于面向agent程序设计时不能有效地描述处理agent心智状态,无法处理外因行动等问题.给出了AOPLID语言语法结构,基于OSC的AOPLID程序语义以及AOPLID程序实例.展开更多
For any proposed software project,when the software requirements specification has been established,requirements changes may result in not only a modification of the requirements specification but also a series of mod...For any proposed software project,when the software requirements specification has been established,requirements changes may result in not only a modification of the requirements specification but also a series of modifications of all existing artifacts during the development.Then it is necessary to provide effective and flexible requirements changes management.In this paper,we present an approach to managing requirements changes based on Booth＇s negotiation-style framework for belief revision.Informally,we consider the current requirements specification as a belief set about the systemto-be.The request of requirements change is viewed as new information about the same system-to-be.Then the process of executing the requirements change is a process of revising beliefs about the system-to-be.We design a family of belief negotiation models appropriate for different processes of requirements revision,including the setting of the request of requirements change being fully accepted,the setting of the current requirements specification being fully preserved,and that of the current specification and the request of requirements change reaching a compromise.In particular,the prioritization of requirements plays an important role in reaching an agreement in each belief negotiation model designed in this paper.展开更多
文摘An approach to characterize the credibility of beliefs of an agent is proposed in this paper, which can define the uncertainty of beliefs, calculation rules and inference rules about credibility and a method for belief revision based on abductive reasoning is also given. When an agent receives some new information, if the new information is consistent with the current belief set, then incorporate this new information with an appropriate credibility, otherwise the choice will be different depending on the characters of agents, and the deliberated agents will choose the belief with a better explanation under the current belief set. Removing one belief may cause the removal of those beliefs that, together with others, logically entail the formula to be removed. A method based on abduction is proposed to solve these problems.
文摘Two operational approaches to belief revision are presented in this paper. The rules of Rcalculus are modified in order to deduce all the maximal consistent subsets. Another set of rules is given in order to deduce all the minimal inconsistent subsets. Then a procedure, which can generate all the maximal consistent subsets, is presented. They are complete approaches, since all the maximal consistent subsets can be deduced or generated. In this paper, only the case of propositional logic is considered.
文摘A deduction system, called RE-proof system, is constructed for generating the revisions of first order belief sets. When a belief set is rejected by a given fact, all maximal subsets of the belief set consistent with the fact can be deduced from the proof system. The soundness and completeness of the RE-proof system are proved, which imply that there exists a resolution method to decide whether a revision retains a mtalmal subset of a belief set.
基金This work was supported by the National Natural Science Foundation of China (No.69785004) and the Science and Technology Fundin
文摘As an important variant of Relier's default logic, Poole (1988) developed a nonmonotonic reasoning framework in the classical first-order language. Brewka and Nebel extended Poole's approach in order to enable a representation of priorities between defaults. In this paper a general framework for default reasoning is presented, which can be viewed as a generalization of the three approaches above. It is proved that the syntax-independent default reasoning in this framework is identical to the general belief revision operation introduced by Zhang et al. (1997). This result provides a solution to the problem whether there is a correspondence between belief revision and default logic for the infinite case. As a by-product, an answer to the question, raised by Mankinson and Gardenfors (1991), is also given about whether there is a counterpart contraction in nonmonotonic logic.
文摘The AGM postulates ([1]) are for the belief revision (revision by a single belief), and the DP postulates ([2]) are for the iterated revision (revision by a finite sequence of beliefs). Li [3] gave an R-calculus for R-configurations △|Γ, where Δ is a set of literals, and Γ is a finite set of formulas. We shall give two R-calculi such that for any consistent set Γ and finite consistent set △ of formulas in the propositional logic, in one calculus, there is a pseudo-revision Θ of Γ by Δ such that is provable and and in another calculus, there is a pre-revision Ξ of Γ by Δ such that is provable, and for some pseudo-revision Θ;and prove that the deduction systems for both the R-calculi are sound and complete with the pseudo-revision and the pre-revision, respectively.
基金Key Project of Party Building and Ideological and Political Education Research from University of Science and Technology Liaoning for the Year 2023(2023KDDJ-X01)awarded to Zhe Yu.
文摘This study aims to revise the Belief in a Just World Scale(BJWS)for Chinese college students and test its reliability and validity(construct validity,convergent and divergent validity).Two samples of 546 and 595 college students were selected,respectively,using stratified cluster random sampling.Item analysis,exploratory factor analysis(EFA),confirmatory factor analysis(CFA),reliability analysis and convergent and divergent validity tests were carried out.The results showed that the 13 items of the BJWS have good item discrimination.The corrected item–total correlation in the general belief in a just world subscale was found to range from 0.464 to 0.655,and that in the personal belief in a just world subscale was 0.553 to 0.715.The internal consistency coefficients of the revised version of the BJWS and its subscales are good.The EFA and CFA results show that the structure and items of the revised scale are the same as those of the original scale.Belief in a just world was found to have significant positive correlations with gratitude and empathy,and has a significant negative correlation with anxiety,thereby exhibiting good convergent and divergent validity.Therefore,the Chinese revised version of the BJWS has good reliability and validity.
基金Natural Science Foundation of Fujian Province of China ( No.2006J0316)College Scientific and Technological Projects of Office of Education of Fujian Province of China (No.JB09302)Scientific Research Foundation for Young Teachers of Fujian Agriculture and Forestry University,China (No.08B21)
文摘Alternating-time Temporal Epistemic Logic (ATEL) which is an important kind of multi-agent cooperation logics only takes knowledge into account,but does not deal with belief of agents. By introducing three kinds of belief operators into ATEL,a new multi-agent cooperation logic named ATBKL (Alternating-time Temporal Belief and Knowledge Logic) was developed. A model checking algorithm was proposed. It is proved that the model checking complexity of ATBKL is the same as that of ATEL,i.e.,the presented logic is better for further study of multi-agent systems.
文摘The aim of this paper is to extend the system of belief revision developed by Alchourron, Gardenfors and Makinson (AGM) to a more general framework.This extension enables a treatment of revision not only by single sentences but also by any sets of sentences, especially by infinite sets. The extended revision and contraction operators will be called general ones, respectively. A group of postulates for each operator is provided in such a way that it coincides with AGM's in the limit case. A notion of the nice-ordering partition is introduced to characterize the general contraction operation. A comp ut ation- orient ed ap-proach is provided for belief revision operations.
基金Supported by the National Natural Science Foundation of China under Grant No.60003010 (国家自然科学基金) the National Research Foundation for the Doctoral Program of Higher Education of China under Grant No.97028428 (国家教育部博士点基金)
文摘提出了一种意向驱动式面向agent程序设计语言——AOPLID(agent-oriented programming language with intention driver).该语言基于开放式情景演算OSC(open situation calculus),吸收了GOLOG的合理成分,加入对信念、意向、能力、策略等agent心智成分的处理,使用信念修正原语处理通信交互以及事件响应等外因行动,并采用了一种新颖的离线规划和在线执行相结合的运行方式,从而解决了GOLOG语言在应用于面向agent程序设计时不能有效地描述处理agent心智状态,无法处理外因行动等问题.给出了AOPLID语言语法结构,基于OSC的AOPLID程序语义以及AOPLID程序实例.
基金supported by the National Natural Science Foundation of China under Grant No.60703061the National Basic Research 973 Program of China under Grant No.2009CB320701+1 种基金the Key Project of National Natural Science Foundation of China under Grant No.90818026the NSFC & the British Royal Society China-UK Joint Project
文摘For any proposed software project,when the software requirements specification has been established,requirements changes may result in not only a modification of the requirements specification but also a series of modifications of all existing artifacts during the development.Then it is necessary to provide effective and flexible requirements changes management.In this paper,we present an approach to managing requirements changes based on Booth＇s negotiation-style framework for belief revision.Informally,we consider the current requirements specification as a belief set about the systemto-be.The request of requirements change is viewed as new information about the same system-to-be.Then the process of executing the requirements change is a process of revising beliefs about the system-to-be.We design a family of belief negotiation models appropriate for different processes of requirements revision,including the setting of the request of requirements change being fully accepted,the setting of the current requirements specification being fully preserved,and that of the current specification and the request of requirements change reaching a compromise.In particular,the prioritization of requirements plays an important role in reaching an agreement in each belief negotiation model designed in this paper.
