On a logical basis of normal logic programs

Fundamenta Informaticae

Volumn 28, Issue 3-4, 1996, Pages 223-245

  Bochman, Alexander ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; EQUIVALENCE CLASSES; FORMAL LOGIC; LOGIC PROGRAMMING;

DEFAULT CONSEQUENCE RELATIONS; NORMAL LOGIC PROGRAMS; SEMANTICS;

ARTIFICIAL INTELLIGENCE;

EID: 0030416058     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-283402     Document Type: Article

References (28)

1. A. Bochman (1994) On the relation between default and modal consequence relations Proc. Fourth International Conference on Principles of Knowledge Representation and Reasoning, KR'94, Morgan Kaufmann, San Mateo, CA., pp. 63-74.
2. A. Bochman (1995) Modal nonmonotonic logics demodalized. Annals of Mathematics and Artificial Intelligence, 15: 101-123.
3. A. Bochman (1995) Default consequence relations as a logical framework for logic programs. Proc. Third International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR'95, Lecture Notes in Artificial Intelligence, 928, pp. 245-258.
4. A. Bochman (1995) On bimodal nonmonotonic logics and their unimodal and nonmodal equivalents. Proc. IJCAI'95, pp. 1518-1524.
5. A. Bochman (1995) Biconsequence relations for nonmonotonic reasoning I: Logic and semantics for general logic programs. (In preparation)
6. S. Brass and J. Dix (1995) Characterizations of the stable semantics by partial evaluation. Proc. Third International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR'95, Lecture Notes in Artificial Intelligence, 928, pp. 85-98.
7. J. Chen and S. Kundu (1991) The strong semantics for logic programs. Methodologies for Intelligent Systems (LNAI 542), Z. W. Ras and M. Zamenkova (eds.), Springer Verlag, pp. 490-499.
8. J. Dix (1995) A classification theory of semantics of normal logic programs: I and II. Fundamenta Informaticae, 22: 227-288.
9. M. C. Fitting (1985) A Kripke-Kleene semantics for logic programs. JLP 2: 295-312.
10. M. C. Fitting (1993) The family of stable models. JLP 17: 197-225.
11. D. M. Gabbay (1976). Investigations in Modal and Tense Logics. Dordrecht: D. Reidel.
12. M. Gelfond and V. Lifschitz (1988) The stable model semantics for logic programming Proc. 5th International Conf./Symp. on Logic Programming, R. Kowalski and K. Bowen (eds.), MIT Press: Cambridge, MA, pp. 1070-1080.
13. S. Kraus, D. Lehmann and M. Magidor (1990) Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44: 167-207.
14. E. Laenens, D. Vermeir and C. Zaniolo (1992) Logic programming semantics made easy. Automata, Languages and Programming (LNCS 623), Springer, pp. 499-508.
15. W. Marek, A. Nerode and J. Remmel (1990) A theory of nonmonotonic rule systems I Annals of Mathematics and Artificial Intelligence, 1: 241-273.
16. W. Marek and V.S. Subrahmanian (1992) The relationship between stable, supported, default and autoepistemic semantics for general logic programs. Theoretical Computer Science, 103: 365-386.
17. W. Marek and M. Truszczyński (1989) Stable semantics for logic programs and default theories. Proc. 1989 North Amer. Conf. on Logic Programming, MIT Press: Cambridge, MA, pp. 243-256.
18. R. C. Moore (1985). Semantical considerations on non-monotonic logic. Artificial Intelligence 25:75-94.
19. H. Przymusinska and T. Przymusinski (1990) Semantic issues in deductive databases and logic programs, in R. Benerji (ed.) Formal Techniques in Artificial Intelligence, North-Holland: Amsterdam, pp. 321-367.
20. T.C. Przymusinski (1990) Well-founded semantics coincides with three-valued stable semantics. Fundamenta Informaticae, 13: 445-463.
21. T.C. Przymusinski (1991) Three-valued nonmonotonic formalisms and semantics of logic programs. Artificial Intelligence, 49: 309-343.
22. T.C. Przymusinski (1991) Stable semantics for disjunctive programs New Generation Computing, 9: 401-424.
23. T.C. Przymusinski (1994) Well-founded and stationary models of logic programs. Annals of Mathematics and Artificial Intelligence 12:141-187.
24. H. Rasiowa (1974) An Algebraic Approach to Non-classical Logics, PWN, Warszawa.
25. R. Reiter (1980). A logic for default reasoning. Artificial Intelligence 13:81-132.
26. J.S. Schlipf (1992). Formalizing a logic for logic programming. Annals of Mathematics and Artificial Intelligence 5:279-302.
27. H. Thiele On generation of cumulative inference operators by default deduction rules. LNAI 543, Springer Verlag, pp. 100-137.
28. A. Van Gelder, K.A. Ross and J.S. Schlipf (1991) The well-founded semantics for general logic programs. J. ACM 38: 620-650.