An argumentation-theoretic approach to logic program transformation

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

Volumn 1048, Issue , 1996, Pages 61-75

  Toni, Francesca ^a   Kowalski, Robert A ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; SEMANTICS;

HERBRAND MODEL; HORN CLAUSE; LOGIC PROGRAMS; PARTIAL STABLE MODELS; PROGRAM TRANSFORMATIONS; STABLE MODEL; WELL FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

EID: 84892758300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60939-3_5     Document Type: Conference Paper

References (18)

1. C. Aravindan, P.M. Dung, On the correctness of unfold/fold transformation of normal and extended logic programs. Journal of Logic Programming 24(3):201-217 (1995)
2. C. Aravindan, P.M. Dung. Belief dynamics, abduction and databases. Proc. 4th European Workshop on Logic in AI (1994)
3. A. Bondarenko, F. Toni, R. A. Kowalski, An assumption-based framework for non-monotonic reasoning. LPNMR’93 (A. Nerode and L. Pereira eds.) MIT Press, 171-189
4. A. Bondarenko, P. M. Dung, R. A. Kowalski, F. Toni, An abstract, argumentation-theoretic framework for default reasoning. Technical Report (1995)
5. P.M. Dung, Negation as hypothesis: an abductive foundation for logic programming. ICLP’91 (K. Furukawa ed.) MIT Press, 3-17
6. P.M. Dung, K. Kanchanasut, A fixpoint approach to declarative semantics of logic programs. NACLP’89 1:604-625
7. M.H. van Emden, R.A. Kowalski, The semantics of predicate logic as a programming language. ACM23(4):733-742 (1976)
8. K. Eshghi, R.A. Kowalski, Abduction compared with negation as failure. ICLP’89 (G. Levi and M. Martelli eds.) MIT Press, 234-255
9. M. Gelfond, V. Lifschitz, The stable model semantics for logic programs. ICLP’88 (K. Bowen and R.A. Kowalski eds.) MIT Press, 1070-1080
10. A.C. Kakas, P. Mancarella, Stable theories for logic programs. ILPS’91 (V. Saraswat and K. Ueda eds.) MIT Press, 85-100
11. A.C. Kakas, P. Mancarella, P.M. Dung, The Acceptability Semantics for Logic Programs. ICLP’94 (P. Van Hentenryck ed.) MIT Press, 504-519
12. R.A. Kowalski, F. Sadri, Knowledge representation without integrity constraints. Imperial College Technical Report (1988)
13. A. Pettorossi, M. Proietti, Transformation of logic programs. Journal of Logic Programming 19/20:261-320 (1994)
14. T.C. Przymusinski, Semantics of disjunctive logic programs and deductive databases. DOOD’91 (C. Delobel, M. Kifer, and Y. Masunaga eds.) 85-107
15. D. Sacca, C. Zaniolo, Stable models and non determinism for logic programs with negation. ACM Symposium on Principles of Database Systems, ACM Press, 205-217 (1990)
16. F. Toni, Abductive logic programming, PhD Thesis, Imperial College (1995)
17. F. Toni, R.A. Kowalski. Reduction of abductive logic programs to normal logic programs. ICLP’95 (L. Sterling ed.) MIT Press, 367-381
18. A. Van Gelder, K.A. Ross, J.S. Schlipf, The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650 (1991)