Abstract
In this paper, we present an approach to general Datalog programs in which positive and negative facts are allowed. The semantics of such programs is computed in two steps. At the first step, we interpret rules as classical implication, and treat negation as classical negation. Since inconsistencies can appear at this first step, we consider that the information provided by facts in the database is more sure than the information provided by rules. Thus, a fact can be considered as an exception to a rule. Derivation of facts is based on the consistent part of the database, which can be localized. When no more facts can be derived, the second step of the computation consists in a modified version of well-founded semantics. In particular, an unfounded fact is assumed to be negative only if this assumption implies no inconsistency.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt, H. Blair, A. Walker, ”Towards a theory of declarative knowledge”, Proc. Workshop on the Foundations of Deductive Databases and Logic Programming, 1986; also in [16].
P. Atzeni, R. Torlone, ”Updating Intensional Predicates in Datalog”, Data & Knowledge Engineering, 8, 1992.
N. Bidoit, ”Negation in Rule-Based Database Languages: a Survey”, Theoretical Computer Sciences, 78, 1991.
N. Bidoit, C. Froidveaux, ”Negation by Default and Unstratifiable Logic Programs'”, Theoretical Computer Sciences, 78, 1991.
F. Bry, ”Intensional Updates: Abduction via Deduction”, Int. Symposium of Logic Programming, 1990.
A. Chandra, D. Harel, ”Horn clause queries and generalizations”, Logic Programming 2 (1), 1985.
K. L. Clark, ”Negation as Failure”, in Logic and Databases (H. Gallaire and J. Minker Editors) Plenum Press, New-York, 1978, pp. 293–322.
M. Davis, H. Putnam, ”A computing procedure for quantification theory”, ACM 7, 1960, pp. 201–215.
M. Gelfond, V. Lifschitz, ”The stable model semantics for logic programming”, in Kowalski and Bowen editors, Logic Programming: Proc. of the Fifth Int. Conf. and Symp., pp. 1070–1080, 1988.
M. Gelfond, V. Lifschitz, ”Logic Programs with Classical Negation”, in Warren and Szeredi, editors, 7th Int. Conf. on Logic Programming, pp. 579–597. MIT Press, 1990.
K. Inoue, ”Hypothetical Reasoning in Logic Programs”, J. Logic Programming, No. 18, 1994.
R. A. Kowalski, F. Sadri, ”Logic Programs with Exceptions”, Proceedings of the 7th Int. Conf. on Logic Programming, Jerusalem, Israel, in D. H. D. Warren and P. Szeredi (eds), pp. 598–613. MIT Press, Cambridge, MA, 1990.
J. W. Lloyd, ”Foundations of Logic Programming”, Springer Verlag, Berlin, second extended edition, 1987.
D. Laurent, V. Phan Luong, N. Spyratos, ”Updating Intensional Predicates in Deductive Database”, The 9th IEEE ICDE'93 (Int. Conf. on Data Engineering), Vienna (Austria), 1993.
D. Laurent, V. Phan Luong, N. Spyratos, ”Database Updating Revisited”, The 3rd Int. Conf. DOOD'93 Phoenix, Arizona USA, 1993. LNCS, Springer-Verlag, No 760, 1993.
J. Minker, ed., ”Foundations of Deductive Databases and Logic Programming”, Morgan Kaufmann, 1988.
S. A. Naqvi, ”A logic for negation in database systems”, Proc. Workshop on the Foundations of Deductive Databases and Logic Programming, 1986.
V. Phan Luong, ”A mixed Approach to Negation in General Datalog Programs”, Technical Report, L.I.M. (Laboratoire d'Informatique de Marseille), 1995.
D. Poole, ”A Logic Framework for Default Reasonning”, Artificial Intelligence, 36, 1988, pp. 27–47.
T. Przymusinska, ”On the semantics of stratified deductive databases”, Proc. Workshop on the Foundations of Deductive Databases and Logic Programming, 1986; also in [16].
R. Reiter, ”A logic for Default Reasoning”, Artificial Intelligence, 13, 1980.
A. Van Gelder, ”The Alternating Fixpoint of Logic Programs with Negation”, J. Comput. Syst. Sci. 1992, (Preliminary abstract appeared in Proceedings of the 8th Annual ACM Symposium on Principles of Database Systems. ACM, New York, 1989).
A. Van Gelder, K. A. Ross, J.S. Schlipf, ”The Well Founded Semantics for General Logic Programs”, Journal of the ACM, 38 (3), 1991.
J. D. Ullman, ”Principles of Databases and Knowledge Base Systems”, Vol. I, Computer Science Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luong, V.P. (1995). A mixed approach to negation in general Datalog programs. In: Ling, T.W., Mendelzon, A.O., Vieille, L. (eds) Deductive and Object-Oriented Databases. DOOD 1995. Lecture Notes in Computer Science, vol 1013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60608-4_51
Download citation
DOI: https://doi.org/10.1007/3-540-60608-4_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60608-6
Online ISBN: 978-3-540-48460-8
eBook Packages: Springer Book Archive