Abstract
Disjunctive Deductive Databases (DDDBs) — function-free disjunctive logic programs with negation in rule bodies allowed — have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research has been spent on issues like semantics and complexity of DDDBs, but the important area of implementing DDDBs has been less addressed so far. However, a thorough investigation thereof is a basic requirement for building systems which render previous foundational work on DDDBs useful for practice.
This paper presents the architecture of a DDDB system currently developed at TU Vienna in the FWF project P11580-MAT “A Query System for Disjunctive Deductive Databases”.
Work supported in part by FWF (Austrian Science Funds) under project P11580-MAT, and by the Istituto per la Sistemistica e l'Informatica, ISI-CNR.
Work done while visiting TU Vienna.
For up-to-date information and a download of our system, please visit the URL http://www.dbai.tuwien.ac.at/proj/dlv/.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Baral and M. Gelfond. Logic Programming and Knowledge Representation. J. Logic Programming, 19/20:73–148, 1994.
R. Ben-Eliyahu and R. Dechter. Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, 12:53–87, 1994.
R. Ben-Eliyahu and L. Palopoli. Reasoning with Minimal Models: Efficient Algorithms and Applications. In Proc. KR-94, pp. 39–50, 1994.
S. Brass and J. Dix. Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. In Proc. ICLP '95, pp. 199–213, Tokyo, June 1995.
F. Buccafurri, N. Leone, and P. Rullo. Strong and weak constraints in disjunctive datalog. In Proc. LPNMR '97, Dagstuhl, Germany, July 1997.
W. Chen, D.S. Warren. Computing of Stable Models and its Integration with Logical Query Processing. IEEE TKDE, 17:279–300, 1995.
P. Cholewiński, V.W. Marek, A. Mikitiuk, M. Truszczyński. Experimenting with Nonmonotonic Reasoning, In Proc. ICLP '95, pp.267–281, MIT Press, 1995.
L. Console, D. Theseider Dupré, and P. Torasso. On the Relationship Between Abduction and Deduction. J. Logic and Computation, 1(5):661–690, 1991.
J. Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In Logic, Action and Information, pp. 241–329. DeGruyter, 1995.
J. Dix and U. Furbach. The DFG Project DisLoP on Disjunctive Logic Programming. Computational Logic, 2:89–90, 1996.
T. Eiter and G. Gottlob. The Complexity of Logic-Based Abduction. JACM, 42(1):3–42, January 1995.
T. Eiter, G-Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, September 1997. To appear.
M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365–385, 1991.
S. Greco, N. Leone, and P. Rullo. COMPLEX: An Object-Oriented Logic Programming System. IEEE TKDE, 4(4), August 1992.
N. Leone, P. Rullo, and F. Scarcello. Disjunctive stable models: Unfounded sets, fixpoint semantics and computation. Information and Computation, 135(2):69–112, June 1997.
V. Lifschitz and H. Turner. Splitting a Logic Program. In Proc. ICLP '94, pp.23–38, 1994.
J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.
J. Minker. On Indefinite Data Bases and the Closed World Assumption. In Proc. CADE '82, LNCS 138, pp. 292–308, 1982.
J. Minker. Overview of Disjunctive Logic Programming. Annals of Mathematics and Artificial Intelligence, 12:1–24, 1994.
I., Niemelä, P., Simons. Efficient Implementation of the Well-founded and Stable Model Semantics. In Proc. of JICSLP '96, MIT Press, 1996.
G. Phipps, M. A. Derr, and K. Ross. Glue-NAIL!: A Deductive Database System. In Proc. ACM-SIGMOD, pp. 308–317, 1991.
T. Przymusinski. Static Semantics for Normal and Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, 14:323–357, 1995.
T. C. Przymusinski. Stable Semantics for Disjunctive Programs. New Generation Computing, 9:401–424, 1991.
R. Ramakrishnan, D. Srivastava, and S. Sudarshan. CORAL — Control, Relations and Logic. In Proc. VLDB '92, Vancouver (BC), Canada, 1992.
C. Sakama. Possible Model Semantics for Disjunctive Databases. In Proc. DOOD-89, pp. 337–351, 1989.
C. Sakama and K. Inoue. Embedding Circumscriptive Theories in General Disjunctive Programs. In Proc. LPNMR '95, pp. 344–357, 1995.
D. Seipel. Non-Monotonic Reasoning Based on Minimal Models and its Efficient Implementation. In [30], pp. 53–60.
V.S. Subrahmanian, D. Nau, C. Vago. WFS+Branch and Bound=Stable Models. IEEE TKDE, 7(3):362–377, 1995.
A. van Gelder, K. Ross, and J. Schlipf. The Well-Founded Semantics for General Logic Programs. JACM, 38(3):620–650, 1991.
B. Wolfinger, editor. GI Workshop: Disjunctive Logic Programming and Disjunctive Databases, Springer, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F. (1997). A deductive system for non-monotonic reasoning. In: Dix, J., Furbach, U., Nerode, A. (eds) Logic Programming And Nonmonotonic Reasoning. LPNMR 1997. Lecture Notes in Computer Science, vol 1265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63255-7_27
Download citation
DOI: https://doi.org/10.1007/3-540-63255-7_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63255-9
Online ISBN: 978-3-540-69249-2
eBook Packages: Springer Book Archive