Navin Viswanath
ABSTRACT
Both relational databases and logic programs adopt some form of nonmonotonic reasoning in order to infer negative information. Relational databases adopt the Closed World Assumption (CWA) of Reiter. It can be easily seen that much greater expressivity is gained if negative information can be explicitly stated. This turns out to be especially true in the presence of uncertain or incomplete information in the database. The aim of this work is to investigate the handling of incomplete information in an open world setting. For logic programs, the class of extended logic programs has already been defined and studied. Of the programs declared contradictory by most of the semantics proposed so far, some programs may in fact have an appropriate meaning. In this paper, we present a new semantics for logic programs with explicit negation where the derivation of a literal is tied to the derivation of its complement.
- José Júlio Alferes, Phan Minh Dung, and Luís Moniz Pereira. Scenario semantics of extended logic programs. In LPNMR, pages 334--348, 1993. Google Scholar
Digital Library
- Rajiv Bagai and Rajshekhar Sunderraman. A paraconsistent relational data model. International Journal of Computer Mathematics, 55(3), 1995.Google Scholar
- Rajiv Bagai and Rajshekhar Sunderraman. Bottom-up computation of the fitting model for general deductive databases. Journal of Intelligent Information Systems, 6(1):59--75, January 1996.Google ScholarCross Ref
- Chitta Baral and Michael Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19/20:73--148, 1994.Google ScholarCross Ref
- E. F. Codd. A relational model for large shared data banks. Comm. of the ACM, 13(6):377--387, 1970. Google ScholarDigital Library
- Anish Das, Omar Benjelloun, Alon Halevy, and Jennifer Widom. Working models for uncertain data. In ICDE '06: Proceedings of the 22nd International Conference on Data Engineering (ICDE'06), page 7, Washington, DC, USA, 2006. IEEE Computer Society. Google ScholarDigital Library
- M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 4:295--312, 1985.Google ScholarCross Ref
- M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming, pages 1070--1080, Seattle, WA, August 1988.Google Scholar
- Michael Gelfond and Vladimir Lifschitz. Logic programs with classical negation. pages 579--597, 1990. Google ScholarDigital Library
- Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9(3/4):365--386, 1991.Google ScholarDigital Library
- Tomasz Imieliński and Jr. Witold Lipski. Incomplete information in relational databases. J. ACM, 31(4):761--791, 1984. Google ScholarDigital Library
- Ken-Chih Liu and Rajshekhar Sunderraman. Indefinite and maybe information in relational databases. ACM Trans. Database Syst., 15(1):1--39, 1990. Google ScholarDigital Library
- Ken-Chih Liu and Rajshekhar Sunderraman. A generalized relational model for indefinite and maybe information. IEEE Trans. Knowl. Data Eng., 3(1):65--77, 1991. Google ScholarDigital Library
- Jack Minker and Carolina Ruiz. Semantics for disjunctive logic programs with explicit and default negation. Fundamenta Informaticae, 20(1/2/3):145--192, 1994. Google ScholarDigital Library
- David Pearce and Gerd Wagner. Logic programming with strong negation. In Proceedings of the international workshop on Extensions of logic programming, pages 311--326, New York, NY, USA, 1991. Springer-Verlag New York, Inc. Google ScholarDigital Library
- Luís Moniz Pereira and José Júlio Alferes. Well founded semantics for logic programs with explicit negation. In ECAI '92: Proceedings of the 10th European conference on Artificial intelligence, pages 102--106, New York, NY, USA, 1992. John Wiley & Sons, Inc. Google ScholarDigital Library
- Halina Przymusinska and Teodor C. Przymusinski. Stationary default extensions. Fundamenta Informaticae, 21(1/2):67--87, 1994.Google ScholarDigital Library
- Teodor C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9(3/4):401--424, 1991.Google ScholarCross Ref
- R. Reiter. A logic for default reasoning. In Readings in nonmonotonic reasoning, pages 68--93. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1987. Google ScholarDigital Library
- R. Reiter. On closed world data bases. In Readings in nonmonotonic reasoning, pages 300--310. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1987. Google ScholarDigital Library
- Carolina Ruiz and Jack Minker. Logic knowledge bases with two default rules. Annals of Mathematics and Artificial Intelligence, 22(3--4):333--361, 1998. Google ScholarDigital Library
- Domenico Saccà and Carlo Zaniolo. Stable models and non-determinism in logic programs with negation. In PODS, pages 205--217, 1990. Google ScholarDigital Library
- Marek A. Suchenek. A syntactic characterization of minimal entailment. In NACLP, pages 81--91, 1989.Google Scholar
- A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):621--650, 1991. Google ScholarDigital Library
- Navin Viswanath and Rajshekhar Sunderraman. Defaults in open world relational databases. In Proceedings of IPMU, 2008. To appear.Google Scholar
- Navin Viswanath and Rajshekhar Sunderraman. Degrees of exclusivity in disjunctive databases. In Proceedings of ISMIS, 2008. Short paper. To appear. Google ScholarDigital Library
- Navin Viswanath and Rajshekhar Sunderraman. On the semantics of logic programs with explicit negation. 2008. Submitted, under review.Google Scholar
- Gerd Wagner. A database needs two kinds of negation. In MFDBS, pages 357--371, 1991. Google ScholarDigital Library
Index Terms
- Explicit and default negation in databases and logic programs
Recommendations
Semantics For Disjunctive Logic Programs With Explicit And Default Negation
The use of explicit negation enhances the expressive power of logic programs by providing a natural and unambiguous way to assert negated information about the domain being represented. We study the semantics of disjunctive programs that contain both ...
Classical negation in logic programs and disjunctive databases
AbstractAn important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this ...
Comments