Expressiveness of stable model semantics for disjunctive logic programs with functions

Journal of Logic Programming

Volumn 33, Issue 2, 1997, Pages 167-178

  Eiter, Thomas ^b   Gottlob, Georg ^a  

^a INSTITUTE FOR MICROELECTRONICS   (Austria)

^b JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; COMPUTER SOFTWARE;

DISJUNCTIVE LOGIC PROGRAMS; STABLE MODEL SEMANTICS;

LOGIC PROGRAMMING;

EID: 0031281312     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(97)00027-7     Document Type: Article

References (37)

1. Andreka, H. and Nemeti, I., The Generalised Completeness of Horn Predicate Logics as Programming Language, Acta Cybernetica 4(1):3-10 (1978).
2. Apt, K. and Blair, H., Arithmetic Classification of Perfect Models of Stratified Programs, in: Proc. 5th Joint Int. Conf, and Symp. on Logic Programming (JICSLP-88), R. Kowalski and K. Bouwen (eds.), MIT Press, 1988, pp. 766-779.
3. Baral, C. and Gelfond, M., Logic Programming and Knowledge Representation, J. Logic Programming 19/20:73-148 (1994).
4. Barwise, J., Admissible Sets and Structures, Springer, 1976.
5. Barwise, J. and Moschovakis, Y., Global Inductive Definability, J. Symbolic Logic 43: 521-534 (1978).
6. Ben-Eliyahu, R. and Dechter, R., Propositional Semantics for Disjunctive Logic Program, Annals of Math, and Artificial Intell. 12:53-87 (1994).
7. Blair, H., The Recursion-Theoretic Complexity of the Semantics of Predicate Logic as a Programming Language, Inform. Contr. 25-47 (July/Aug. 1982).
8. Blair, H. and Cholak, C., The Complexity of Local Stratification, Fundamenta Informaticae 21:333-344 (1994).
9. Cadoli, M. and Schaerf, M., A Survey and Complexity Results for Non-Monotonic Logics, J. Logic Programming 17:127-160 (1993).
10. Chen, W. and Warren, D. S., Tabled Evaluation with Delaying for General Logic Programs, J. ACM 43(1):20-74 (1996).
11. 2-Complete, Inform. Processing Lett. 34:289-291 (1990).
12. Eiter, T. and Gottlob, G., On the Computational Cost of Disjunctive Logic Programming: Propositional Case, Annals Math. and Artificial Intell. 15(3/4):289-323 (1995).
13. Eiter, T., Gottlob, G., and Gurevich, Y., Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems, Annals Pure and Appl. Logic 78:111-125 (1996).
14. Eiter, T., Gottlob, G., and Mannila, H., Adding Disjunction to Datalog, in: Proc. PODS'94, May 1994, pp. 267-278.
15. Eiter, T., Leone, N., and Saccà, D., Expressive Power of Partial Models for Disjunctive Deductive Databases, in: Proc. Int. Workshop on Logic in Databases (LID-'96), LNCS 1154, Springer, 1996, pp. 245-264.
16. Gelfond, M. and Lifschitz, V., The Stable Model Semantics for Logic Programming, in: Logic Programming: Proc. 5th Int. Conference and Symp., Cambridge, MA, MIT Press, 1988, pp. 1070-1080.
17. Gelfond, M. and Lifschitz, B., Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing 9:365-385 (1991).
18. Lobo, J., Minker, J., and Rajasekar, A., Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA, 1992.
19. Marek, W., Nerode, A., and Remmel, J., How Complicated Is the Set of Stable Models of a Recursive Logic Program?, Annals Pure and Appl. Logic 56:119-135 (1992).
20. Marek, W., Nerode, A., and Remmel, J., The Stable Models of Predicate Logic Program, J. Logic Programming 21(3):129-153 (1994).
21. Marek, W. and Truszczyński, M., Autoepistemic Logic, J. ACM 38(3):588-619 (1991).
22. Marek, W. and Truszczyński, M., Computing Intersection of Autoepistemic Expansions, in: Proc. 1st Int. Workshop on Logic Programming and Nonmonotonic Reasoning (LPNMR-91), A. Nerode, W. Marek, and V. Subrahmanian (eds.), Washington, DC, MIT Press, July 1991, pp. 37-50.
23. Marek, W., Truszczyński, M., and Rajasekar, A., Complexity of Extended Disjunctive Logic Programs, Annals Math. and Artificial Intell. 15(3/4) (1995).
24. Minker, J., On Indefinite Data Bases and the Closed World Assumption, in: Proc. 6th Conf. on Automated Deduction (CADE'82), D. Loveland (ed.), LNCS 138, New York, Springer, 1982, pp. 292-308.
25. Minker, J., Overview in Disjunctive Logic Programming, Annals Math. and Artificial Intell. 12:1-24 (1994).
26. Minker, J., Logic and Databases: A 20 Year Retrospective, in: Proc. Int. Workshop on Logic in Databases (LID'96), D. Pedreschi and C. Zaniolo (eds.), LNCS 1154, Springer, 1996, pp. 3-57.
27. Minker, J. and Ruiz, C., Semantics for Disjunctive Logic Programming with Explicit and Default Negation, Fundamenta Informaticae 20(3/4):145-192 (1994).
28. Moschovakis, Y., Elementary Induction on Abstract Structures, North Holland, 1974.
29. Przymusinski, T., Stable Semantics for Disjunctive Programs, New Generation Computing 9:401-424 (1991).
30. Rogers, Jr., H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
31. Ross, K., A Procedural Semantics for Well Founded Negation in Logic Programs, in: Proc. PODS'89, 1989, pp. 22-33.
32. Sakama, C. and Inoue, K., An Alternative Approach to the Semantics of Disjunctive Logic Programs and Deductive Databases, J. Automated Reasoning 13:145-172 (1994).
33. Schlipf, J., Complexity and Undecidability Results in Logic Programming, Annals Math. and Artificial Intell. 15(3/4):257-288 (1995).
34. Schlipf, J., The Expressive Powers of Logic Programming Semantics, J. Comput. and Syst. Sci. 51(1):64-86 (1995). Abstract in: Proc. PODS'90, pp. 196-204.
35. Smullyan, R., On Definability by Recursion, Bull. AMS 62:601 (Abst. 782t) (1956).
36. van Benthem, J. and Doets, K., Higher Order Logic, in: Handbook of Philosophical Logic, D. Gabbay and F. Guenthner (eds.), 1983, Vol. I, Chap. I.4, pp. 275-329.
37. van Gelder, A., Ross, K., and Schlipf, J., The Well-Founded Semantics for General Logic Programs, J. ACM 38(3):620-650 (1991).