Disjunctive LP+integrity constraints= stable model semantics

1. K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Washington, D.C., 1988) pp. 89–148.

   Google Scholar 

2. C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian, Computation and implementation of non-monotonic deductive databases, Technical Report CS-TR-2801, University of Maryland (1991). Submitted for journal publication.

3. J. Cuadrado and S. Pimentel, A truth maintenance system based on stable models, in:Proc. 1989 North American Conf. on Logic Programming (1989) pp. 274–290.

4. J.A. Fernández and J. Minker, Bottom-up evaluation of disjunctive deductive databases, Technical Report, Computer Science Department, University of Maryland (1991), in preparation.

5. J.A. Fernández and J. Minker, Bottom-up evaluation of hierarchical disjunctive deductive databases, in:Proc. 8th Int. Conf. on Logic Programming, ed. K. Furukawa (MIT Press, 1991).

6. J.A. Fernández and J. Minker, Computing perfect models of disjunctive stratified databases, in:Proc. ILPS'91 Workshop on Disjunctive Logic Programs, San Diego, CA (October 1991), ed. D. Loveland et al., pp. 110–117. An extended version has been submitted to Annals of Mathematical Artificial Intelligence.

7. L.O. Fuentes, Applying uncertainty formalisms to well-defined problems, Master's Thesis, University of Texas at El Paso (1991).

   Google Scholar 

8. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in:Proc. 5th Int. Conf. and Symp. on Logic Programming, Seattle, Washington (August, 1988), ed. R.A. Kowalski and K.A. Bowen, pp. 1070–1080.

9. R.A. Kowalski, Logic for data description, in:Logic and Data Bases, ed. H. Gallaire and J. Minker (Plenum Press, New York, 1978) pp. 77–102.

   Google Scholar 

10. J. McCarthy, Circumscription — a form of non-monotonic reasoning, Artificial Intelligence 13(1980) 27–39.

    Google Scholar 

11. W. Marek and V.S. Subrahmanian, The relationship between stable, supported, default and autoepistemic semantics for general logic programs, Theor. Comp. Sci. 10(3)(1992)365–386.

    Google Scholar 

12. W. Marek and M. Truszczynski, Stable semantics for logic programs and default theories, in:Proc. 1989 North American Conf. on Logic Programming, ed. E. Lusk and R. Overbeek (MIT Press, 1989) pp. 243–256.

13. T.C. Przymusinski, On the semantics of stratified deductive databases, in:Proc. Workshop on Foundations of Deductive Databases and Logic Programming, ed. J. Minker, Washington, D.C. (1986) pp. 433–443.

14. T.C. Przymusinki, Extended stable semantics for normal and disjunctive programs, in:Proc. 7th Int. Conf. on Logic Programming, Jerusalem, 1990 (MIT Press), Extended Abstracts, pp. 459–477.

15. T.C. Przymusinski, Stable semantics for disjunctive programs, New Generation Comput. J. 9(1991) 401–424. Extended Abstract appeared in [14].

    Google Scholar 

16. R. Reiter, Towards a logical reconstruction of relational database theory, in:On Conceptual Modelling, ed. M.L. Brodie et al. (Springer, New York, 1984) pp. 163–189.

    Google Scholar 

17. R. Reiter, What should a database know? in:Proc. 7th Int. Conf. on Logic Programming, Jerusalem (1990), Abstract of Invited Talk, p. 765.

18. M.H. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23(1976)733–742.

    Google Scholar 

19. D.S. Warren, Using OLDT evaluation with meta-interpreters, in:Logic in Databases, Knowledge, Representation and Reasoning: A Symposium in Honor of Jack Minker's 65th Birthday for Contributions to Computer Science and Human Rights, College Park, Maryland (Nov. 1992).

20. A. Yahya and L.J. Henschen, Deduction in non-Horn databases, J. Aut. Reasoning 1(1985)141–160.

    Google Scholar 

Download references