Characterization of strongly equivalent logic programs in intermediate logics

Theory and Practice of Logic Programming

Volumn 3, Issue 3, 2003, Pages 259-270

  De Jongh, Dick H J ^a   Hendriks, Lex ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Answer set semantics; Prepositional intermediate logics; Strongly equivalent programs

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; LEARNING SYSTEMS; PROBLEM SOLVING; SEMANTICS; SET THEORY;

LEARNING LEMMAS; LOGIC MINIMIZATION PROBLEMS; PROPOSITIONAL LOGICS;

LOGIC PROGRAMMING;

EID: 0344531479     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S147106840200159X     Document Type: Article

References (13)

1. Avellone, A., Ferrari, M. and Miglioli, P. (1999) Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics. Logic J. IGPL, 7(4), 447-480.
2. Chagrov, A. and Zakharyaschev, A. M. (1997) Modal Logic. Clarendon Press.
3. Doets, K. (1994) From Logic to Logic Programming. MIT Press.
4. Gelfond, M. and Lifschitz, V. (1988) The stable model semantics for logic programs. In: R. A. Kowalski and K. A. Bowen (editors), Proceedings Fifth International Conference and Symposium on Logic Programming 2, pp. 1070-1080. MIT Press.
5. Gödel, K. (1932) Zum intuitionistischen Aussagenkalkül, Anzeiger der Akademie der Wissenschaften in Wien, 69, pp. 65-66.
6. Hendriks, A. (1996) Computations in propositional logic, PhD Thesis University of Amsterdam.
7. n of Gödel, Journal of the Faculty of Science of the University of Tokio, 13, 183-187.
8. Jankov, V. A. (1968) The calculus of the weak "law of excluded middle". Mathematics of the USSR, Izv., 2, 997-1004.
9. Kowalski, R. A. (1974) Predicate logic as a programming language. Proceedings IFIP'74, pp. 569-574. North-Holland.
10. Lifschitz, V., Pearce, D. and Valverde, A. (2001) Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4), 526-541.
11. Lifschitz, V., Tang, L. R. and Turner, H. (1999) Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25, 369-389.
12. Lukasiewicz, J. (1938) Die Logik und das Grundlagenproblem. Les Entretiens de Zürich sur les Fondaments et la Méthode des Sciences Mathématiques 6-9, 12, 82-100.
13. Pearce, D. (1997) A new logical characterization of stable models and answer sets. In: J. Dix, L. Pereira, T. Przymusinski (editors), Non-Monotonic Extensions of Logic Programming, Lecture Notes in Artificial Intelligence 1216, pp. 57-70. Springer-Verlag.