A three-valued characterization for strong equivalence of logic programs

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 106-111

  Cabalar, Pedro ^a  

^a UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SET THEORY; SYNTACTICS;

CLASSICAL LOGIC;

LOGIC PROGRAMMING;

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

References (17)

1. Bull, R., and Segerberg, K. 1984. Basic modal logic. In Gabbay, D., and Guenthner, F., eds., Handbook of Philosophical Logic, volume 2. D. Reidel Publishing Company. 1-88.
2. Cabalar, P. 2002. Alternative characterizations for strong equivalence of logic programs. In In Proc. of the Ninth Int'l Workshop on Non-monotonic Reasoning (NMR'2002).
3. D.H.J. de Jongh, A. Hendriks. 2001. Characterization of strongly equivalent logic programs in intermediate logics. Unpublished draft. http://turing.wins.uva.nl/̃lhendrik/.
4. Fitting, M. 1985. A kripke-kleene semantics for logic programs. Journal of Logic Programming 2(4):295-312.
5. Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Kowalski, R. A., and Bowen, K. A., eds., Logic Programming: Proc. of the Fifth International Conference and Symposium (Volume 2). Cambridge, MA: MIT Press. 1070-1080.
6. Gelfond, M., and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 365-385.
7. Inoue, K., and Sakama, C. 1998. Negation as failure in the head. Journal of Logic Programming 35(1):39-78.
8. Kunen, K. 1987. Negation in logic programming. Journal of Logic Programming 4(4):289-308.
9. Lifschitz, V.; Pearce, D.; and Valverde, A. 2000. Strongly equivalent logic programs. ACM Transactions on Computational Logic. (to appear).
10. Lifschitz, V.; Tang, L. R.; and Turner, H. 1999. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25:369-389.
11. Lifschitz, V. 1993. Circumscription. In D.M. Gabbay, C. H., and Robinson, J., eds., Handbook of Logic in AI and Logic Programming, volume 3. Oxford University Press. 298-352.
12. Lifschitz, V. 1994. Minimal belief and negation as failure. Artificial Intelligence 70:53-72.
13. Lin, F., and Shoham, Y. 1992. A logic of knowledge and justified assumptions. Artificial Intelligence 57:271-289.
14. Lin, F. 1991. A Study of Nonmonotonic Reasoning. Ph.D. Dissertation, Stanford.
15. Pearce, D.; Tompits, H.; and Woltran, S. 2001. Encodings of equilibrium logic and logic programs with nested expressions. In Bradzil, P., and Jorge, A., eds., Lecture Notes in Artificial Intelligence, volume 2258. Springer Verlag. 306-320.
16. Pearce, D. 1997. A new logical characterisation of stable models and answer sets. In Non monotonic extensions of logic programming. Proc. NMELP'96. (LNAI 1216). Springer-Verlag.
17. Turner, H. 2001. Strong equivalence for logic programs and default theories (made easy). In In Proc. of the Sixth Int'l Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), 81-92.