Reasoning about action I: a possible worlds approach
Artificial Intelligence
A knowledge level analysis of belief revision
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Propositional knowledge base revision and minimal change
Artificial Intelligence
Dealing with multi-source information in possibilistic logic
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
On the equivalence of logical databases
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Making inconsistency respectable: a logical framework for inconsistency in reasoning
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Intelligent Access to Data and Knowledge Bases via User's Topics of Interest
Proceedings of the IFIP 12th World Computer Congress on Personal Computers and Intelligent Systems - Information Processing '92 - Volume 3 - Volume 3
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Data Merging: Theory of Evidence vs. Knowledge-Bases Merging Operators
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Disjunctive merging: Quota and Gmin merging operators
Artificial Intelligence
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Hi-index | 0.02 |
This paper describes a logic for reasoning in a multi-source environment and a theorem prover for this logic. We assume the existence of several sources of information (data/knowledge bases), each of them providing information. The main problem dealt with here is the problem of the consistency of the information : even if each separate source is consistent, the global set of information may be inconsistent. In our approach, we assume that the different sources are totally ordered, according to their reliability. This order is then used in order to avoid inconsistency. The logic we define for reasoning in this case is based on a classical logic augmented with pseudo-modalities. Its semantic is first detailed. Then a sound and complete axiomatic is given. Finally, a theorem prover is specified at the meta-level. We prove that it is correct with regard to the logic. We then implement it in a PROLOG-like language.