Uniform equivalence for equilibrium logic and logic programs

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

Volumn 2923, Issue , 2004, Pages 194-206

  Pearce, David ^a   Valverde, Agustín ^b  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; KNOWLEDGE REPRESENTATION; PROBLEM SOLVING;

ANSWER SET SEMANTICS; EQUILIBRIUM LOGIC; LOGIC PROGRAMS; LOGICAL FORMS; NEW FORMS; PROOF SYSTEM; PROPOSITIONAL THEORIES;

LOGIC PROGRAMMING;

EQUILIBRIUM LOGIC; LOGIC PROGRAMS; MULTIPLE VALUED LOGIC;

EID: 9444288708     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. G. Aguilera Venegas, I. Perez de Guzman, M. Ojeda Aciego, and A. Valverde. Reducing signed propositional formulas. Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2(4):157-166, 1999.
2. I.P. de Guzmán, M. Ojeda-Aciego, and A. Valverde. Multiple-Valued Tableaux with Δ-reductions. In Proceedings of IC-AI'99, pages 177-183, 1999.
3. T. Eiter and M. Fink. Uniform equivalenceoflogic programs under the stable model semantics. In Int. Conf. in Logic Programming, ICLP'03, Mumbay, India. Springer, 2003.
4. P. Ferraras and V. Lifschitz Weight Constraints as Nested Expressions. Theory and Practice of Logic Programming, (to appear).
5. K. Gödel. Zum intuitionistischen aussagenkalkül. Anzeiger der Akademie der Wissenschaften Wien, mathematisch, naturwissenschaftliche Klasse, 69:65-66, 1932.
6. S. Greco, N. Leone and F. Scarcello, Disjunctive Datalog with Nested Rules, in J. Dix et al (eds), Logic Programming and Knowledge Representation. Proc. LPKR97, Spinger, LNCS 1471, 1998.
7. Y. Gurevich. Intuitionistic logic with strong negation. Studia Logica, 36(1-2):49-59, 1977.
8. R. Hähnle. Automated Deduction in Multiple-Valued Logics. Oxford University Press, 1993.
9. A. Heyting. Die formalen regeln der intuitionistischen logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, pages 42-56, 1930.
10. 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.
11. M. Kracht. On extensions of intermediate logics by strong negation. Journal of Philosophical Logic, 27(1):49-73, 1998.
12. V. Lifschitz, L. Tang and H Turner, Nested Expressions in Logic Programs, Annals of Mathematics and Artificial Intelligence, 25, 369-389, 1999.
13. V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001.
14. D. Pearce. A new logical characterisation of stable models and answer sets. In Non-Monotonic Extensions of Logic Programming, NMELP 96, LNCS 1216, pages 57-70. Springer, 1997.
15. 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.
16. H. Turner. Strong equivalence for logic programs and default theories (made easy). In Proc. of the Logic Programming and Nonmonotonic Reasoning, LPNMR'01, LNAI 2173, pages 81-92. Springer, 2001.
17. D. van Dalen. Intuitionistic logic. In Handbook of Philosophical Logic, Volume III: Alternatives in Classical Logic, Dordrecht, 1986. D. Reidel Publishing Co.
18. N. N. Vorob'ev. A constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85:465-468, 1952.
19. 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.