Bottom-up computation of perfect models for disjunctive theories

This publication has 16 references indexed in Scilit:

• On indefinite databases and the closed world assumption
  Published by Springer Nature ,2005
• On representing indefinite and maybe information in relational databases: a generalization
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Foundations of disjunctive logic programming: Jorge Lobo, Jack Minker and Arcot Rajasekar, (MIT Press, London, 1992), Price £60.75
  Science of Computer Programming, 1995
• The alternating fixpoint of logic programs with negation
  Journal of Computer and System Sciences, 1993
• Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. Logic programming, Proceedings of the fifth international conference and symposium, Volume 2, edited by Robert A. Kowalski and Kenneth A. Bowen, Series in logic programming, The MIT Press, Cambridge, Mass., and London, 1988, pp. 1070–1080. - Kit Fine. The justification of negation as failure. Logic, methodology and philosophy of science VIII, Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, Moscow, 1987, edited by Jens Erik Fenstad, Ivan T. Frolov, and Risto Hilpinen, Studies in logic and the foundations of mathematics, vol. 126, North-Holland, Amsterdam etc. 1989, pp. 263–301.
  The Journal of Symbolic Logic, 1992
• Efficient bottom-up computation of queries on stratified databases
  The Journal of Logic Programming, 1991
• Query evaluation in recursive databases: bottom-up and top-down reconciled
  Data & Knowledge Engineering, 1990
• On the relationship between circumscription and negation as failure
  Artificial Intelligence, 1989
• Towards a Theory of Declarative Knowledge
  Published by Elsevier ,1988
• Circumscription—A form of non-monotonic reasoning
  Artificial Intelligence, 1980