Abstract
This paper investigates the novel concept of clausal deductive databases (cd-databases), which are special normal deductive databases – i.e., deductive databases which may contain default negation in rule bodies – over a typed meta-language L cd with a fixed set of predicate symbols, namely dis, con, and some built-in predicate symbols. The arguments of the literals in L cd are given by disjunctive and conjunctive clauses of a basic first-order language ℒ. Disjunctive deductive databases (dd-databases) generalize normal deductive databases by allowing for disjunctions of atoms or literals in rule heads. We present a transformation which maps a dd-database D into a cd-database D cd that talks about the clauses of D. cd-databases provide a flexible framework for declaratively specifying the semantics of dd-databases: we can fix a standard control strategy, e.g., stable model or well-founded semantics, and vary the logical description D cd for specifying different semantics. The transformed database D cd usually consists of a part D ⊗ which naturally expresses the rules of D, and two generic parts which are independent of D: D logic specifies logical inference rules like resolution and subsumption, and D cwa specifies non-monotonic inference rules like closed-world-assumptions. Another program transformation, which uses the idea of bringing sets of clauses to the argument level is given for hypothetical logic programs: a hypothetical logic program D is mapped to a classical normal logic program D ⊙, such that well-known semantics and inference methods for normal logic programs can be used for hypothetical reasoning as well.
Similar content being viewed by others
References
S. Brass and J. Dix, A disjunctive semantics based on unfolding and bottom-up evaluation, in: GIJahrestagung / IFIP World Computer Congress 1994, Fachgespräch “Disjunktive logische Programmierung und disjunktive Datenbanken” (Springer, 1994) pp. 83-91.
S. Ceri, G. Gottlob and L. Tanca, Logic Programming and Databases (Springer, Berlin, 1990).
P.M. Dung, Declarative semantics of hypothetical logic programming with negation as failure, in: Proc. of Workshop on Extensions of Logic Programming (ELP'92) (1992) pp. 45-58.
T. Eiter, N. Leone, C. Mateis, G. Pfeifer and F. Scarcello, A deductive system for non-monotonic reasoning, in: Proc. of the 4th Intl. Conf. on Logic Programming and Non-Monotonic Reasoning (LPNMR'97), Lecture Notes in Artificial Inteligence, Vol. 1265 (Springer, 1997) pp. 363-374.
T. Eiter, N. Leone and D. Sacca, On the partial semantics for disjunctive deductive databases, Ann. Math. Artificial Intelligence 17(1/2) (1997) 59-96.
J.A. Fernández, J. Lobo, J. Minker and V.S. Subrahmanian, Disjunctive LP + Integrity Constrains = Stable Model Semantics, Ann. Math. Artificial Intelligence 8(3/4) (1993) 449-474.
J.A. Fernández and J. Minker, Bottom-up computation of perfect models for disjunctive theories, J. Logic Programming 25(1) (1995) 33-51.
M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proc. of the 5th Intl. Conference and Symposium on Logic Programming (ICSLP'88) (MIT Press, Cambridge, MA, 1988) pp. 1070-1080.
L. Giordano and N. Olivetti, Combining negation-as-failure and embedded implications in logic programs, J. Logic Programming 36 (1998) 91-147.
G. Köstler, W. Kießling, H. Thöne and U. Güntzer, The differential fixpoint operator with subsumption, in: Proc. of Intl. Conference on Deductive and Object-Oriented Databases (DOOD'93), Lecture Notes in Computer Science, Vol. 760 (Springer, New York, 1993) pp. 35-48.
J.W. Lloyd, Foundations of Logic Programming, 2nd ed. (Springer, Berlin, 1987).
J. Lobo, J. Minker and A. Rajasekar, Foundations of Disjunctive Logic Programming (MIT Press, Cambridge, MA, 1992).
V.W. Marek and M. TruszciŇsky, Nonmonotonic Logic-Context-Dependent Reasoning (Springer, Berlin, 1993).
D. Miller, Logical analysis of modules in logic programming, J. Logic Programming (1989) 79-108.
J. Minker and A. Rajasekar, A fixpoint semantics for disjunctive logic programs, J. Logic Programming 9(1) (1990) 45-74.
J. Minker and C. Ruiz, On extended disjunctive logic programs, in: Proc. of Intl. Symposium on Methodologies for Intelligent Systems (ISMIS'93), Lecture Notes in Artificial Inteligence, Vol. 689 (Springer, Berlin, 1993) pp. 1-18.
I. Niemelä and P. Simons, Smodels-an implementation of the stable model and well-founded semantics for normal logic programs, in: Proc. of the 4th Intl. Conf. on Logic Programming and Non378 D. Seipel / Clausal deductive databases Monotonic Reasoning (LPNMR'97), Lecture Notes in Artificial Inteligence, Vol. 1265 (Springer, Berlin, 1997) pp. 420-429.
T.C. Przymusinski, Stable semantics for disjunctive programs, in: New Generation Computing, Vol. 9 (Ohmsha, 1991) pp. 401-424.
R. Ramakrishnan, Database Management Systems (McGraw-Hill, New York, 1998).
R. Reiter, A logic for default reasoning, J. Artificial Intelligence 13 (1980) 81-132.
K. Sagonas, T. Swift and D.Warren, XSB as an efficient deductive database engine, in: Proc. of ACM SIGMOD Intl. Conf. on the Management of Data (SIGMOD'94), pp. 442-453.
D. Seipel, Partial evidential stable models for disjunctive databases, in: Proc. of Workshop on Logic Programming and Knowledge Representation (LPKR'97) at the International Symposium on Logic Programming (ILPS'97), Lecture Notes in Artificial Inteligence, Vol. 1471 (Springer, Berlin, 1998) pp. 66-84.
D. Seipel, DISLOG-a disjunctive deductive database prototype, in: Proc. of the 12th Workshop on Logic Programming (WLP'97) (1997) pp. 136-143; DISLOG is available at http://wwwinfo1. informatik.uni-wuerzburg.de/databases/DisLog.
D. Seipel, Clausal deductive databases and a general framework for semantics in disjunctive deductive databases, in: Proc. of Intl. Symposium on Foundations of Information and Knowledge Systems (FoIKS'2000), Lecture Notes in Computer Science, Vol. 1762 (Springer, New York, 2000) pp. 241-259.
D. Seipel, J. Minker and C. Ruiz, Model generation and state generation for disjunctive logic programs, J. Logic Programming 32(1) (1997) 48-69.
D. Seipel, J. Minker and C. Ruiz, A characterization of partial stable models for disjunctive deductive databases, in: Proc. of Intl. Logic Programming Symposium (ILPS'97) (MIT Press, Cambridge, MA, 1997) pp. 245-259.
A. Van Gelder, K.A. Ross and J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in: Proc. of the 7th ACM Symposium on Principles of Database Systems (PODS'88) (1988) pp. 221-230.
C. Zaniolo, S. Ceri, C. Faloutsos, R.T. Snodgrass, V.S. Subrahmanian and R. Zicari, Advanced Database Systems (Morgan Kaufmann, 1997).
U. Zukowski, S. Brass and B. Freitag, Improving the alternating fixpoint: The transformation approach, in: Proc. of the 4th Intl. Conf. on Logic Programming and Non-Monotonic Reasoning (LPNMR'97), Lecture Notes in Artificial Inteligence, Vol. 1265 (Springer, Berlin, 1997) pp. 40-59.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Seipel, D. Using clausal deductive databases for defining semantics in disjunctive deductive databases. Annals of Mathematics and Artificial Intelligence 33, 347–378 (2001). https://doi.org/10.1023/A:1013180132511
Issue Date:
DOI: https://doi.org/10.1023/A:1013180132511