Simplifying Logic Programs under Answer Set Semantics

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

Volumn 3132, Issue , 2004, Pages 210-224

  Pearce, David ^a  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; PROBLEM SOLVING; RECONFIGURABLE HARDWARE; SEMANTICS;

ANSWER SET PROGRAMMING; ANSWER SET SEMANTICS; DECLARATIVE PROBLEM SOLVING; DISJUNCTIVE LOGIC PROGRAMS; INFERENCE RULES; LOGIC PROGRAMS; NESTED EXPRESSIONS; TRANSFORMATION RULES;

COMPUTER CIRCUITS;

EID: 35048868340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27775-0_15     Document Type: Article

References (38)

1. A, Avellone, M. Ferrari and P. Miglioli. Duplication-Free Tableau Calculi and Related CutFree Sequent Calculi for the Interpolable Propositional Intermediate Logics. Logic Journal of the IGPL7(4): 447-480 (1999).
2. M. Balduccini, M. Gelfond, R. Watson and M. Noguiera. The USA-Advisor: A case study in answer set planning. In Logic Programming and Nonmonotonic Reasoning, LPNMR 2001, Springer LNAI 2173, 2001.
3. C. Baral Knowlewdge Representation, Reasoning and Declarative Problem Solving Cambridge University Press, 2003.
4. S. Brass and J. Dix. Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming, 40 (1): 1-46, 1999.
5. F. Calimeri, S. Galizia, M. Ruffolo, P. Rullo Enhancing Disjunctive Logic Programming for Ontology Specification. Proceedings AGP 2003
6. D. van Dalen. Intuitionistic logic. In Handbook of Philosophical Logic, Volume III: Alternatives in Classical Logic, Dordrecht, 1986. D. Reidel Publishing Co.
7. D. van Dantzig. On the Principles of Intuitionistic and Affirmative Mathematics. Indagationes Mathematicae 9,1947: 429-440; 506-517.
8. J. Dietrich lnferenzframes. Doctoral Dissertation, University of Leipzig, 1995.
9. M. Dummett Elements of Intuitionism. Clarendon Press, Oxford, 1977.
10. T. Eiter and M. Fink. Uniform equivalence of logic programs under the stable model semantics. In Int. Conf. in Logic Programming, ICLP'03, Mumbay, India. Springer, 2003.
11. T. Eiter, M. Fink, H. Tompits and S. Woltran. Simplifying Logic Programs under Uniform and Strong Equivalence V Lifschitz & I Niemela (eds.), Proceedings LPNMR 2004, Springer, LNAI 2923, 2004.
12. T. Eiter and G. Gottlob. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence, 15 (3-4), 1995, 289-323.
13. K. Gödel. Zum intuitionistischen aussagenkalkül. Anzeiger der Akademie der Wissenschaften Wien, mathematisch, naturwissenschaftliche Klasse, 69:65-66, 1932.
14. Y. Gurevich. Intuitionistic logic with strong negation. Studio Logica, 36(1-2):49-59, 1977.
15. A. Heyting. Die formalen regeln der intuitionistischen logik. Sitzungsberichte der Preitssischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, pages 42-56, 1930.
16. D. De Jongh and L. Hendriks. Characterization of strongly equivalent logic programs in intermediate logics. Theory and Practice of Logic Programming, 3(3):259-270, 2003.
17. T. Janhunen. On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. In T. Eiter et al (eds) Proceedings LPNMR 2001, Springer LNCS 2173, 2001: 93-106.
18. T. Janhumen, I. Niemela, D. Seipel, P. Simons, and J.-H. You. Unfolding partiality and disjunctions in stable model semantics. CoRR: cs.AI/0303009, March, 2003.
19. M. Kracht. On extensions of intermediate logics by strong negation. Journal of Philosophical Logic, 27(1):49-73, 1998.
20. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G, Gottlob, S. Perri and F. Scarcello. The DLV System for Knowledge Representation and Reasoning. CoRR: cs.AI/0211004, September, 2003.
21. V. Lifschitz. Foundations of Logic Programming, in G. Brewka (ed) Principles of Knowledge Representation, CSLI Publications, 1996, 69-128.
22. V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001.
23. V. Lifschitz, L. Tang and H. Turner. Nested Expressions in Logic Programs. Annals of Mathematics and Artificial Intelligence, 25(3-4): 369-389, 1999.
24. D. Mundici. Satisfiability in Many-Valued Sentential Logic is NP-complete. Theoretical Computer Science, 52(1-2): 145-153, 1987.
25. M. Osorio, J. Navarro and J. Arrazola. Equivalence in Answer Set Programming. In Proc. LOPSTR 2001, LNCS 2372, Springer, 2001, 57-75.
26. D. Pearce. Nonmonotonicity and Answer Set Inference. In Proc. LPNMR 1995, LNAI 928, pages 372-387, Springer, 1995.
27. D. Pearce. A new logical characterization of stable models and answer sets. In Non-Monotonic Extensions of Logic Programming, NMELP 96, LNCS 1216, pages 57-70. Springer, 1997.
28. D. Pearce, I.P. de Guzmán, and A. Valverde. A tableau calculus for equilibrium entailment. In Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2000, LNAI 1847, pages 352-367. Springer, 2000.
29. D. Pearce, I.P. de Guzmán, and A. Valverde. Computing Equilibrium Models Using Signed Formulas. In John W. Lloyd et al (eds) Computational Logic - CL 2000, First International Conference. Proceedings, LNAI 1861, pages 688-702, Springer, 2000.
30. D. Pearce, H. Tompits and S. Woltran. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In Proceedings EPIA '01, LNAI, pages 306-320. Springer, 2001.
31. D. Pearce, V. Sarsakov, T. Schaub, H. Tompits and S. Woltran. A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. In P. J. Stuckey (Ed.): Logic Programming, 18th International Conference, 1CLP 2002, Lecture Notes in Computer Science 2401, Springer 200, pages 405-420.
32. D. Pearce and A. Valverde. Uniform Equivalence for Equilibrium Logic and Logic Programs. In V. Lifschitz and I. Niemelaa (eds) Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, Springer LNAI 2923, 2004.
33. P. Simons, I. Niemela, and T. Soininen. Extending and implementing the stable model semantics. Artiflcial Intelligence, 138(1-2):181-234, 2002.
34. H. Turner. Strong equivalence for logic programs and default theories (made easy). In Proc. of the Logic Programming and Nonmonotonic Reasoning, LPNMR'Ol, LNAI 2173, pages 81-92. Springer, 2001.
35. D. Vakarelov Notes on N-Lattices and Constructive Logic with Strong Negation. Studio Logica, 36(1-2):109-125, 1977.
36. N. N. Vorob'ev. A constructive prepositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85:465-468, 1952.
37. N. N. Vorob'ev. The problem of deducibility in constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85:689-692, 1952.
38. K. Wang and L. Zhou. Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. ACM Transactions on Computational Logic, to appear.