Epistemic entrenchment and possibilistic logic
Artificial Intelligence
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Knowledge-level analysis of belief base operations
Artificial Intelligence
Conditioning in possibility theory with strict order norms
Fuzzy Sets and Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
META-92 Proceedings of the 3rd International Workshop on Meta-Programming in Logic
Belief Revision Through the Belief-Function Formalism in a Multi-Agent Environment
ECAI '96 Proceedings of the Workshop on Intelligent Agents III, Agent Theories, Architectures, and Languages
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Reasoning with Levels of Modalities in BDI Logic
Agent Computing and Multi-Agent Systems
An integrated possibilistic framework for goal generation in cognitive agents
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A Syntactic Possibilistic Belief Change Operator for Cognitive Agents
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Graded BDI models for agent architectures
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
| Hi-index | 0.00 |
We propose a syntactic possibilistic belief-change operator, which operates on a belief base of necessity-valued formulas. Such a base may be regarded as a finite and compact encoding of a possibility distribution over a possibly infinite set of interpretations. The proposed operator is designed so that it behaves like a semantic possibilistic belief-change operator for BDI agents recently proposed in the literature. The equivalence of the semantic and syntactic operators is then proved. Experimental results are presented. The aim of these experiments is to demonstrate that the cost of belief revision expressed in terms of the number of entailment checks required as well as the size of the belief base do not explode as the number of new pieces of information formulas supplied increases.