On anytime coherence-based reasoning

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2143, Issue , 2001, Pages 556-567

  Koriche, Frédéric ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BASED REASONINGS; COMPUTATIONAL COSTS; CONSISTENT SUBSET; KNOWLEDGE BASE; KNOWLEDGE BASIS; LOGICAL FRAMEWORKS; STEPWISE PROCEDURE;

KNOWLEDGE BASED SYSTEMS;

EID: 84937432833     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44652-4_49     Document Type: Conference Paper

References (20)

1. C. Baral, S. Kraus, and J. Minker. Combining multiple knowledge bases. IEEE Transactions on Knowledge and Data Engineering, 3(2):208-220, 1991.
2. 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.
3. S. Benferhat, D. Dubois, and H. Prade. How to infer form inconsistent beliefs without revising ? In Proc. IJCAI'95, pages 1449-1455, 1995.
4. 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.
5. G. Brewka. Preferred subtheories: An extended logical framework for default reasoning. In Proc. IJCAI'89, pages 1043-1048. Morgan Kaufmann, 1989.
6. M. Cadoli and M. Schaerf. Approximate inference in default reasoning and cir- cumscription. In Proc. ECAI'92, pages 319-323, 1992.
7. C. Cayrol and M. C. Lagasquie-Schiex. Nonmonotonic reasoning: From complexity to algorithms. Annals of Mathematics and Artificial Intelligence, 22:207-236, 1998.
8. R. Dechter and I. Rish. Directional resolution: The Davis-Putnam procedure, revisited. In Proc. KR'94, pages 134-145, 1994.
9. F. Koriche. A logic for anytime deduction and anytime compilation. In Logics in Artificial Intelligence, volume 1489, pages 324-342. Springer Verlag, 1998.
10. F. Koriche. A logic for approximate first-order reasoning. In Proc. CSL'01, 2001. To appear.
11. H. J. Levesque. A logic of implicit and explicit belief. In Proc. AAAI'84, pages 198-202, 1984.
12. F. Massacci. Anytime approximate modal reasoning. In Proc. AAAI'98, pages 274-279, 1998.
13. B. Nebel. Belief revision and default reasoning: Syntax - based approaches. In Proc. KR'91, pages 417-428, 1991.
14. 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.
15. G. Pinkas and R. P. Loui. Reasoning from inconsistency: A taxonomy of principles for resolving conflict. In Proc. KR'92, pages 709-719, 1992.
16. N. Rescher and R. Manor. On inference from inconsistent premises. Theory and Decision, 1:179-217, 1970.
17. M. Schaerf and M. Cadoli. Tractable reasoning via approximation. Artificial Intelligence, 74:249-310, 1995.
18. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satis-a- bility problems. In Proc. AAAI'92, pages 440-446, 1992.
19. H. Zhang and M. E. Stickel. Implementing the Davis-Putnam method. Journal of Automated Reasoning, 24(1/2):277-296, 2000.
20. S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73-83, 1996.