Encodings for equilibrium logic and logic programs with nested expressions

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

Volumn 2258 LNAI, Issue , 2001, Pages 306-320

  Pearce, David ^a   Tompits, Hans ^b   Woltran, Stefan ^b  

^a EUROPEAN COMMISSION   (Belgium)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER PROGRAMMING LANGUAGES; INTELLIGENT AGENTS; LOGIC PROGRAMMING; MULTI AGENT SYSTEMS; SEMANTICS; ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; CASE BASED REASONING; RECONFIGURABLE HARDWARE;

ANSWER SET SEMANTICS; COMPLEXITY RESULTS; EQUILIBRIUM LOGIC; NESTED EXPRESSIONS; NON-MONOTONIC REASONING; POLYNOMIAL REDUCTION; QUANTIFIED BOOLEAN FORMULAS; REDUCTION TECHNIQUES;

COMPUTER CIRCUITS;

EID: 84860173301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45329-6_31     Document Type: Conference Paper

References (28)

1. R. Bayardo and R. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT Instances. In Proc. AAAI-97, pp. 203-208, 1997.
2. M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI-98, pp. 262-267, 1998.
3. J. Delgrande, T. Schaub, H. Tompits, and S. Woltran. On Computing Solutions to Belief Change Scenarios. In Proc. ECSQARU-01, pp. 510-521, 2001.
4. E. Eder. Relative Complexities of First-Order Calculi. Vieweg Verlag, 1992.
5. U. Egly, T. Eiter, R. Feldmann, V. Klotz, S. Schamberger, H. Tompits, and S. Woltran. On Mechanizing Modal Nonmonotonic Logics. In Proc. DGNMR-01, pp. 44-53, 2001.
6. U. Egly, T. Eiter, V. Klotz, H. Tompits, and S. Woltran. Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. In Proc. AAAI Spring Symposium-01, pp. 53-59, 2001.
7. U. Egly, T. Eiter, H. Tompits, and S. Woltran. Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In Proc. AAAI-00, pp. 417-422, 2000.
8. T. Eiter and G. Gottlob. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Ann. of Math. and Artificial Intelligence, 15(3-4):289-323, 1995.
9. R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In Proc. AAAI-00, pp. 285-290, 2000.
10. M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
11. E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In Proc. IJCAR-01, pp. 364-369, 2001.
12. K. Gödel. Zum intuitionistischen Aussagenkalkül. Anzeiger der Akademie der Wissenschaften in Wien, pp. 65-66, 1932.
13. A. Heyting. Die formalen Regeln der intuitionistischen Logik. Sitz. Berlin, pp. 42-56, 1930.
14. H. Kautz and B. Selman. Planning as Satisfiability. In Proc. ECAI-92, pp. 359-363, 1992.
15. H. Kleine-Büning, M. Karpinski, and A. Flögel. Resolution for Quantified Boolean Formulas. Information and Computation, 117(1):12-18, 1995.
16. R. Letz. Advances in Decision Procedures for Quantified Boolean Formulas. In Proc. IJCAR-01 Workshop on Theory and Applications of Quantified Boolean Formulas, pp. 55-64, 2001.
17. C. M. Li and Anbulagan. Heuristics Based on Unit Propagation for Satisfiability Problems. In Proc. IJCAI-97, pp. 366-371, 1997.
18. V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4), 2001. To appear.
19. V. Lifschitz, L. Tang, and H. Turner. Nested Expressions in Logic Programs. Ann. of Math. and Artificial Intelligence, 25(3-4):369-389, 1999.
20. J. Lloyd and R. Topor. Making Prolog More Expressive. J. of Logic Progr., 3:225-240, 1984.
21. J. Lukasiewicz. Die Logik und das Grundlagenproblem. Les Entretiens de Zürich sue les Fondements et la Méthode des Sciences Mathématiques, 6-9, 12 (1938), 1941.
22. D. Pearce. A New Logical Characterisation of Stable Models and Answer Sets. In Non Monotonic Extensions of Logic Programming, pp. 57-70. Springer, 1997.
23. D. Pearce. From Here to There: Stable Negation in Logic Programming. In What is Negation? Kluwer, 1999.
24. D. Pearce, I. de Guzmán, and A. Valverde. A Tableau Calculus for Equilibrium Entailment. In Proc. TABLEAUX 2000, pp. 352-367, 2000.
25. D. Pearce, I. de Guzmán, and A. Valverde. Computing Equilibrium Models Using Signed Formulas. In Proc. Computational Logic 2000, pp. 688-702, 2000.
26. D. A. Plaisted and S. Greenbaum. A Structure Preserving Clause Form Translation. J. of Symbolic Computation, 2(3):293-304, 1986.
27. J. Rintanen. Improvements to the Evaluation of Quantified Boolean Formulae. In Proc. IJCAI-99, pp. 1192-1197, 1999.
28. H. Zhang. SATO: An Efficient Propositional Prover. In Proc. CADE-97, pp. 272-275, 1997.