A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report

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

Volumn 2401 LNCS, Issue , 2002, Pages 405-420

  Pearce, David ^a   Sarsakov, Vladimir ^b   Schaub, Torsten ^b   Tompits, Hans ^c   Woltran, Stefan ^c  

^a EUROPEAN COMMISSION   (Belgium)

^b UNIVERSITY OF POTSDAM   (Germany)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; POLYNOMIALS; PROGRAM TRANSLATORS; SEMANTICS; COMPUTER CIRCUITS; COMPUTER PROGRAMMING; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

ANSWER SET; COMPLEXITY RESULTS; DISJUNCTIVE LOGIC PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMS; LOGIC PROGRAMS; NEGATION AS FAILURES; NESTED EXPRESSIONS; POLYNOMIAL TRANSLATION; FORWARD TRANSFORMATIONS;

COMPUTER CIRCUITS; LOGIC PROGRAMMING;

EID: 77149157409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45619-8_28     Document Type: Conference Paper

References (36)

1. M. Baaz, U. Egly, and A. Leitsch. Normal Form Transformations. In Hand book of Automated Reasoning, volume I, chapter 5, pages 273-333. Elsevier Science B. V., 2001.
2. M. Baaz and C. G. Fermuller. Resolution-based Th eorem Proving for Many-valued Logics. Journal of Symbolic Computation, 19(4):353-391, 1995.
3. C. Baral and C. Uyan. Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming. In Proc. LPNMR-01, pages 186-199, 2001.
4. M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI-98, pages 262-267, 1998.
5. D. de Jongh and L. Hendriks. Characterization of Strongly Equivalent Logic Programs in Intermediate Logics. Technical report, 2001. Preprint at http://turing.wins.uva.nl/lhendrik/.
6. U. Egly. On Different Structure-Preserving Translations to Normal Form. Journal of Symbolic Computation, 22(2):121-142, 1996.
7. U. Egly. On Definitional Transformations to Normal Form for Intuitionistic Logic. Fundamenta Informaticae, 29(1, 2):165-201, 1997.
8. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A Deductive System for Non-monotonic Reasoning. In Proc. LPNMR-97, pages 363-374, 1997.
9. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The KR System dlv: Progress Report, Comparisons and Ben chmarks. In Proc. KR-98, pages 406-417, 1998.
10. R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In Proc. AAAI-00, pages 285-290, 2000.
11. M. Gelfond, M. Balduccini, and J. Galloway. Diagnosing Physical Systems in A-Prolog. In Proc. LPNMR-01, pages 213-225, 2001.
12. M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
13. E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In Proc. IJCAR-01, pages 364-369, 2001.
14. K. Godel. Zum intuitionistischen Aussagenkalkul. Anzeiger der Akademie der Wissenschaften in Wien, pages 65-66, 1932.
15. R. Hahnle. Short Conjunctive Normal Forms in Finitely ValuedLo gics. Journal of Logic and Computation, 4(6):905-927, 1994.
16. K. Heljanko and I. Niemela. Bounded LTL Model Checking with Stable Models. In Proc. LPNMR-01, pages 200-212, 2001.
17. K. Inoue and C. Sakama. Negation as Failure in the Head. Journal of Logic Programming, 35(1):39-78, 1998.
18. T. Janhunen. On the Intertranslatability of Autoepistemic, Default and Priorit y Logics, and P arallel Circumscription. In Proc. JELIA-98, pages 216-232, 1998.
19. T. Janhunen. On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. In Proc. LPNMR-01, pages 93-106, 2001.
20. H. Kleine-Buning, M. Karpinski, and A. Flogel. Resolution for QuantifiedBo olean Formulas. Information and Computation, 117(1):12-18, 1995.
21. R. Letz. Advances in Decision Procedures for Quantified Boolean Formulas. In Proc. IJCAR-01 Workshop on Theory and Applications of Quantified Boolean Formulas, pages 55-64, 2001.
22. V. Lifschitz. Answer Set Planning. In Proc. ICLP-99, pages 23-37, 1999.
23. V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001.
24. V. Lifschitz, L. Tang, and H. Turner. Nested Expressions in Logic Programs. Annals of Mathematics and Artificial Intelligence, 25(3-4):369-389, 1999.
25. F. Lin. Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In Proc. KR-02, pages 170-176, 2002.
26. G. Mints. Resolution Strategies for the Intuitionistic Logic. In Constraint Programming: NATO ASI Series, pages 282-304. Springer, 1994.
27. I. Niemela and P. Simons. Smodels: An Implementation of the Stable Model and Well-Founded Semantics for Normal Logic Programs. In Proc. LPNMR-97, pages 420-429, 1997.
28. D. Pearce. A New Logical Characterisation of Stable Models and Answer Sets. In Non-Monotonic Extensions of Logic Programming, pages 57-70. Springer, 1997.
29. D. Pearce. From Here to There: Stable Negation in Logic Programming. In What is Negation? Kluwer, 1999.
30. D. Pearce, I. de Guzman, and A. Valverde. A Tableau Calculus for Equilibrium Entailment. In Proc. TABLEAUX-00, pages 352-367, 2000.
31. D. Pearce, I. de Guzman, and A. Valverde. Computing Equilibrium Models Using SignedF ormulas. In Proc. CL-00, pages 688-702, 2000.
32. D. Pearce, H. Tompits, and S. Woltran. Encodings for Equilibrium Logic and Logic Programs with NestedEx pressions. In Proc. EPIA-01, pages 306-320. Springer, 2001.
33. D. A. Plaisted and S. Greenbaum. A Structure Preserving Clause Form Translation. Journal of Symbolic Computation, 2(3):293-304, 1986.
34. J. Rintanen. Improvements to the Evaluation of QuantifiedBo olean Formulae. In Proc. IJCAI-99, pages 1192-1197, 1999.
35. J. Siekmann and G. Wrightson, editors. Automation of Reasoning: Classical Papers in Computational Logic 1967-1970, volume 2. Springer-Verlag, 1983.
36. G. Tseitin. On the Complexity of Proofs in Propositional Logics. Seminars in Mathematics, 8, 1970. Reprintedin.