Paraconsistent reasoning via quantified boolean formulas, II: Circumscribing inconsistent theories

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

Volumn 2711, Issue , 2003, Pages 528-539

  Besnard, Philippe ^a   Schaub, Torsten ^b,d   Tompits, Hans ^c   Woltran, Stefan ^c  

^a CNRS   (France)

^b UNIVERSITY OF POTSDAM   (Germany)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^d SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; INFORMATION ANALYSIS; INTELLIGENT STRUCTURES; OPTIMIZATION; SET THEORY; BOOLEAN FUNCTIONS; MANY VALUED LOGICS; SEMANTICS;

INCONSISTENT THEORIES; LOGICAL MINIMIZATION; PARACONSISTENT REASONING; QUANTIFIED BOOLEAN FORMULAS (QBF); IMPLEMENTATION PLATFORMS; INCONSISTENT INFORMATION; MINIMAL MODEL SEMANTICS; PARACONSISTENT LOGIC; QBF SOLVERS; QUANTIFIED BOOLEAN FORMULAS; THREE-VALUED LOGIC;

SEMANTICS; BOOLEAN ALGEBRA;

EID: 8344264599     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45062-7_43     Document Type: Conference Paper

References (29)

1. O. Arieli and A. Avron. Logical bilattices and inconsistent data. In Proc. LICS, pages 468-476, 1994.
2. O. Arieli and A. Avron. Automatic diagnoses for properly stratified knowledge-bases. In Proc. ICTAI'96, pages 392-399. IEEE Computer Society Press, 1996.
3. O. Arieli and A. Avron. The value of four values. Artificial Intelligence, 102(1):97-141, 1998.
4. O. Arieli and M. Denecker. Modeling paraconsistent reasoning by classical logic. In Proc. FOIKS'02, number 2284 in LNCS, pages 1-14. Springer-Verlag, 2002.
5. A. Avron. Simple consequence relations. Information and Computation, 92:105-139, 1991.
6. A. Ayari and D. Basin. QUBOS: Deciding quantified Boolean logic using propositional satisfiability solvers. In Proc. FMCAD 2002, volume 2517 of LNCS, pages 187-201. Springer-Verlag, 2002.
7. N. Belnap. A useful four-valued logic. In J. Dunn and G. Epstein, editors, Modern Uses of Multiple-Valued Logic. Reidel, 1977.
8. S. Benferhat, C. Cayrol, D. Dubois, J. Lang, and H. Prade. Inconsistency management and prioritized syntax-based entailment. In Proc. IJCAI'93, pages 640-647, 1993.
9. P. Besnard and T. Schaub. Circumscribing inconsistency. In Proc. IJCAI'97, pages 150-155, 1997.
10. P. Besnard and T. Schaub. Signed systems for paraconsistent reasoning. Journal of Automated Reasoning, 20(1-2):191-213, 1998.
11. P. Besnard, T. Schaub, H. Tompits, and S. Woltran. Paraconsistent reasoning via quantified Boolean formulas, I: Axiomatising signed systems. In Proc. JELIA '02, volume 2424 of LNCS, pages 320-331. Springer-Verlag, 2002.
12. M. Cadoli, A. Giovanardi, and M. Schaerf. An algorithm to evaluate quantified Boolean formulae. In Proc. AAAI-98, pages 262-267. AAAI Press, 1998.
13. M. Cadoli and M. Schaerf. On the complexity of entailment in propositional multivalued logics. Annals of Mathematics and Artificial Intelligence, 18:29-50, 1996.
14. W. Carnielli, L. Fariñas del Cerro, and M. Lima Marques. Contextual negations and reasoning with contradictions. In Proc. IJCAI'91, pages 532-537, 1991.
15. S. Coste-Marquis and P. Marquis. Complexity results for paraconsistent inference relations. In Proc. KR'02, pages 61-72, 2002.
16. P. Doherty, W. Lukaszewicz, and A. Szalas. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning, 18:297-334, 1997.
17. I. D'Ottaviano and N. da Costa. Sur un problème de Jaśkowski. In Comptes Rendus de l'Académie des Sciences de Paris, volume 270, pages 1349-1353, 1970.
18. R. Feldmann, B. Monien, and S. Schamberger. A distributed algorithm to evaluate quantified Boolean formulas. In Proc. AAAI-00, pages 285-290. AAAI Press, 2000.
19. A. Frisch. Inference without chaining. In Proc. IJCAI'87, pages 515-519, 1987.
20. E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE: A system for deciding quantified Boolean formulas satisfiability. In Proc. IJCAR'01, pages 364-369. Springer-Verlag, 2001.
21. S. Konieczny and P. Marquis. Three-valued logics for inconsistency handling. In Proc. JELIA'02, volume 2424 of LNCS, pages 332-344. Springer-Verlag, 2002.
22. H. Levesque. A knowledge-level account of abduction. In Proc. IJCAI'89, pages 1061-1067, 1989.
23. F. Lin. Reasoning in the presence of inconsistency. In Proc. AAAI'87, pages 139-143, 1987.
24. R. Manor and N. Rescher. On inferences from inconsistent information. Theory and Decision, 1:179-219, 1970.
25. J. McCarthy. Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence, 28:89-116, 1986.
26. D. Mundici. Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science, 52(1-2):145-153, 1987.
27. G. Priest. Logic of paradox. Journal of Philosophical Logic, 8:219-241, 1979.
28. G. Priest. Reasoning about truth. Artificial Intelligence, 39:231-244, 1989.
29. E. Sandewall. A functional approach to non-monotonic logic. Computational Intelligence, 1:80-87, 1985.