Marco Schaerf
ABSTRACT
Two main approaches have been followed in the literature to give a semantics to non-Horn databases. The first one is based on considering the set of rules composing the programs as inference rules and interpreting the negation in the body as failure to prove. The other approach is based on the so-called closed-world assumption and its objective is to define a stronger notion of consequence from a theory than the classical one, where, very roughly, negative information can be inferred whenever its positive counterpart cannot be deduced from the theory. In this work we generalize the semantics for negation in logic programs, putting together the constructive nature of the rule-based deductive databases with the syntax-independence of the closed-world reasoning rules. These generalized semantics are shown to be a well-motivated and well-founded alternative to closed-world assumptions since they enjoy nice semantic and computational properties.
- ABW88.K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundation of Deductive Databases and Logic Programming, pages 89- 142. Morgan Kaufmann, 1988. Google Scholar
Digital Library
- BED92.R. Ben-Eliyahu and R. Dechter. Propositional semantics for disjunctive logic programs. In Proceedings of the International Joint Conference and Symposium on Logic Programming (IJCSLP-9P), pages 379-385, 1992.Google Scholar
- BH86.N. Bidoit and R. Hull. Positivism versus minimalism in deductive databases. In Proceedings of the Fifth Conference on Principle Of Database Systems (PODS-86), pages 123- 132, 1986. Google ScholarDigital Library
- CL90.M. Cadoli and M. Lenzerini. The complexity of closed world reasoning and circumscription. In Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI- 90), pages 550-555. MIT press, July 1990. Extended version as Technical Report RAP. 17.91, Universit~ di Roma "La Sapienzg', Dipartimento di Informatica e Sistemistica, 1991. To appear in Journal of Computer and System Sciences. Google ScholarDigital Library
- CS92.M. Cadoli and M. Schaerf. A survey on complexity results for non-monotonic logics. Submitted for publication, June 1992.Google Scholar
- EG91.T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are II#-complete. Technical Report CD-TR 91/20, Technische Universit#it Wien, Vienna Austria, Christian Doppler Labor fiir Expertensysteme, May 1991. To appear in Theoretical Computer Science.Google Scholar
- EG92.T. Eiter and G. Gottlob. Complexity resuits for disjunctive logic programming and application to nonmonotoninc logics. Technical Report CD-TR 92/41, Technische Universit#it Wien, Vienna Austria, Christian Doppler Labor fiir Expertensysteme, 1992.Google Scholar
- EG93.T. Eiter and G. Gottlob. Complexity aspects of various semantics for disjunctive databases. In Proceedings of the Twelfth Conference on Principle Of Database Systems (PODS-93), 1993. in press. Google ScholarDigital Library
- GL88.M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of #he Fifth Logic Programming Symposium, pages 1070-1080. MIT Press, 1988.Google Scholar
- GL91.M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.Google ScholarDigital Library
- GPP89.M. Gelfond, H. Przymusinska, and T. Przymusinsky. On the relationship between circumscription and negation as failure. Artificial Intelligence Journal, 38:49-73, 1989. Google ScholarDigital Library
- KN88.R. Krishnamurthy and S. A. Naqvi. Nondeterministic choice in datalog. In Proceedings of the Third International Conference on Data and Knowledge Bases, pages 416-424. Morgan Kaufmann, 1988.Google ScholarCross Ref
- Min82.J. Minker. On indefinite databases and the closed world assumption. In Proceedings of the Sixth Conference on Automated Deduction (CADE-82), pages 292-308, 1982. Google ScholarDigital Library
- MT91a.W. Marek and M. Truszczyfiski. Autoepistemic logic. Journal of the A CM, 38(3):588- 619, 1991. Google ScholarDigital Library
- MT91b.W. Marek and M. Truszczyfiski. Computing intersection of autoepistemic expansions. In Proceedings of the First International Workshop on Logic Programming and Non Monotonic Reasoning, pages 37-50. The MIT press, 1991.Google Scholar
- Prz88.T. Przymusinski. On the declarative semantics of stratified deductive databases and logic programs. In J. Minker, editor, Foundation of Deductive Databases and Logic Programming, pages 193-216. Morgan Kaufmann, 1988. Google ScholarDigital Library
- Prz91a.T. Przymusinski. Semantics of disjunctive logic programs and deductive databases. In Proceedings of the Second International Conference on Deductive and Object-Oriented Databases (DOOD-91), pages 85-107, 1991.Google ScholarCross Ref
- Prz91b.T. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401-424, 1991.Google ScholarDigital Library
- PY92.C. It. Papadimitriou and M. Yannakakis. Tie-breaking semantics and structural totality. In Proceedings of the Eleventh Conference on Principle Of Database Systems (PODS-92), pages 16-22, 1992. Google ScholarDigital Library
- Rei78.R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 119-140. Plenum, 1978.Google ScholarCross Ref
- RLM89.A. Rajasekar, J. Lobo, and J. Minker. Weak generalized closed world assumption. Journal of Automated Reasoning, 5:293-307, 1989. Google ScholarDigital Library
- Sch92.M. Schaerf. Logic programming and autoepistemic logics" new relations and complexity results, submitted, 1992.Google Scholar
- Sto76.L.J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1-22, 1976.Google ScholarCross Ref
- SZ90.D. Sacch and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proceedings of the Ninth Conference on Principle Of Database Systems (PODS-90), pages 205-217, 1990. Google ScholarDigital Library
- vEK76.M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the A CM, 23(4):733-742, 1976. Google ScholarDigital Library
- vGRS91.A. van Gelder, K. A. Ross, and J. S. Sehlipf. The well-founded semantics for general logic programs. Journal of the A CM, 38:620-650, 1991. Google ScholarDigital Library
- YH85.A. Yahya and L. J. Henschen. Deduction in non-horn databases, journal of Automated Reasoning, 1:141-160, 1985.Google Scholar
Index Terms
- Negation and minimality in non-horn databases
Recommendations
Subminimal negation
Minimal logic, i.e., intuitionistic logic without the ex falso principle, is investigated in its original form with a negation symbol instead of a symbol denoting the contradiction. A Kripke semantics is developed for minimal logic and its sublogics ...
Guarded negation
ICALP'11: Proceedings of the 38th international conference on Automata, languages and programming - Volume Part IIWe consider restrictions of first-order logic and of fixpoint logic in which all occurrences of negation are required to be guarded by an atomic predicate. In terms of expressive power, the logics in question, called GNFO and GNFP, extend the guarded ...
Comments