Paraconsistent reasoning via quantified boolean formulas, I: Axiomatising signed systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2424, Issue , 2002, Pages 320-331

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

^a UNIVERSITY OF POTSDAM   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS;

AXIOMATIC SPECIFICATIONS; COMPLEXITY RESULTS; CONSEQUENCE RELATIONS; EXISTING SYSTEMS; INCONSISTENT INFORMATION; PARACONSISTENT REASONING; QUANTIFIED BOOLEAN FORMULAS; REASONING TASKS;

BOOLEAN ALGEBRA;

EID: 77952021969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. S. Benferhat, D. Dubois, and H. Prade. Argumentative Inference in Uncertain and Inconsistent Knowledge Bases. In Proc. UAI-93, pages 411-419, 1993.
2. P. Besnard and T. Schaub. Signed Systems for Paraconsistent Reasoning. Journal of Automated Reasoning, 20:191-213, 1998.
3. M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI-98, pages 262-267. AAAI Press, 1998.
4. C. Cayrol, M. Lagasquie-Schiex, and T. Schiex. Nonmonotonic Reasoning: From Complexity to Algorithms. Ann. of Mathematics and Artificial Intelligence, 22(3-4):207-236, 1998.
5. S. Coste-Marquis and P. Marquis. Complexity Results for Paraconsistent Inference Relations. In Proc. KR-02, pages 61-72, 2002.
6. J. Delgrande, T. Schaub, H. Tompits, and S. Woltran. On Computing Solutions to Belief Change Scenarios. In Proc. ECSQARU-01, pages 510-521. Springer Verlag, 2001.
7. U. Egly, T. Eiter, H. Tompits, and S. Woltran. Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In Proc. AAAI-00, pages 417-422. AAAI Press, 2000.
8. T. Eiter, V. Klotz, H. Tompits, and S. Woltran. Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. In Proc. TABLEAUX-02, 2002. To appear.
9. R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formula. In Proc. AAAI-00, pages 285-290. AAAI Press, 2000.
10. 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.
11. G. Gottlob. Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation, 2(3):397-425, 1992.
12. G. Gottlob and Z. Mingyi. Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity. Artificial Intelligence, 69(1-2):329-345, 1994.
13. D. Pearce, H. Tompits, and S.Woltran. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In Proc. EPIA-01, pages 306-320. Springer Verlag, 2001.
14. R. Reiter. A Logic for Default Reasoning. Artificial Intelligence, 13(1-2):81-132, 1980.
15. H. Tompits. Expressing Default Abduction Problems as Quantified Boolean Formulas. In AI Communications, 2002. To appear.
16. C. Wrathall. Complete Sets and the Polynomial-Time Hierarchy. Theoretical Computer Science, 3(1):23-33, 1976.