Abstract
A great deal of research has been devoted to nontrivial reasoning in inconsistent knowledge bases. Coherence-based approaches proceed by a consolidation operation which selects several consistent subsets of the knowledge base and an entailment operation which uses classical implication on these subsets in order to conclude. An important advantage of these formalisms is their flexibility: consolidation operations can take into account the priorities of declarations stored in the base, and different entailment operations can be distinguished according to the cautiousness of reasoning. However, one of the main drawbacks of these approaches is their high computational complexity. The purpose of our study is to define a logical framework which handles this difficulty by introducing the concepts of anytime consolidation and anytime entailment. The framework is semantically founded on the notion of resource which captures both the accuracy and the computational cost of anytime operations. Moreover, a stepwise procedure is included for improving approximations. Finally, both sound approximations and complete ones are covered. Based on these properties, we show that an anytime view of coherence-based reasoning is tenable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Baral, S. Kraus, and J. Minker. Combining multiple knowledge bases. IEEE Transactions on Knowledge and Data Engineering, 3(2):208–220, 1991.
C. Baral, S. Kraus, J. Minker, and V. S. Subrahmanian. Combining knowledge bases consisting of first order theories. Comp. Intelligence, 8(1):45–71, 1992.
S. Benferhat, D. Dubois, and H. Prade. How to infer form inconsistent beliefs without revising ? In Proc. IJCAI’95, pages 1449–1455, 1995.
S. Benferhat, D. Dubois, and H. Prade. Some syntactic approaches to the handling of inconsistent knowledge bases: a comparative study, part 1: the flat case. Studia Logica, 58:17–45, 1997.
G. Brewka. Preferred subtheories: An extended logical framework for default reasoning. In Proc. IJCAI’89, pages 1043–1048. Morgan Kaufmann, 1989.
M. Cadoli and M. Schaerf. Approximate inference in default reasoning and circumscription. In Proc. ECAI’92, pages 319–323, 1992.
C. Cayrol and M. C. Lagasquie-Schiex. Nonmonotonic reasoning: from complexity to algorithms. Annals of Mathematics and Artificial Intelligence, 22:207–236, 1998.
R. Dechter and I. Rish. Directional resolution: The Davis-Putnam procedure, revisited. In Proc. KR’94, pages 134–145, 1994.
F. Koriche. A logic for anytime deduction and anytime compilation. In Logics in Artificial Intelligence, volume 1489, pages 324–342. Springer Verlag, 1998.
F. Koriche. A logic for approximate first-order reasoning. In Proc. CSL’01, 2001. To appear.
H. J. Levesque. A logic of implicit and explicit belief. In Proc. AAAI’84, pages 198–202, 1984.
F. Massacci. Anytime approximate modal reasoning. In Proc. AAAI’98, pages 274–279, 1998.
B. Nebel. Belief revision and default reasoning: Syntax-based approaches. In Proc. KR’91, pages 417–428, 1991.
B. Nebel. Base revision operations and schemes: Semantics, representation, and complexity. In Mathematical and Statistical Methods in Artificial Intelligence, pages 157–170. Springer-Verlag, 1995.
G. Pinkas and R. P. Loui. Reasoning from inconsistency: A taxonomy of principles for resolving conflict. In Proc. KR’92, pages 709–719, 1992.
N. Rescher and R. Manor. On inference from inconsistent premises. Theory and Decision, 1:179–217, 1970.
M. Schaerf and M. Cadoli. Tractable reasoning via approximation. Artificial Intelligence, 74:249–310, 1995.
B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proc. AAAI’92, pages 440–446, 1992.
H. Zhang and M. E. Stickel. Implementing the Davis-Putnam method. Journal of Automated Reasoning, 24(1/2):277–296, 2000.
S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73–83, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koriche, F. (2001). On Anytime Coherence-Based Reasoning. In: Benferhat, S., Besnard, P. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2001. Lecture Notes in Computer Science(), vol 2143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44652-4_49
Download citation
DOI: https://doi.org/10.1007/3-540-44652-4_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42464-2
Online ISBN: 978-3-540-44652-1
eBook Packages: Springer Book Archive