Abstract
Given a logic program P and a goal G, we introduce a notion which states when an SLD-tree for P∪{G} instantiates a, set of variables V with respect to another one, W. We call this notion weak instantiation, as it is a generalization of the instantiation property introduced in [3]. A negation rule based on instantiation, the so-called Negation As Instantiation rule (NAI), allows for inferring existentially closed negative queries, that is formulas of the form ∃¬Q, from logic programs. We show that, by using the new notion, we can infer a larger class of negative queries, namely the class of the queries of the form ∨W∃V¬Q and of the form ∨W∃V∨Z¬Q, where Z is the set of the remaining variables of Q.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. R. Apt. Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, 1978.
A. Di Pierro, M. Martelli, and C. Palamidessi. Negation as Instantiation. Information and Computation, 120(2):263–278, 1995.
A. Di Pierro. Negation and Infinite Computations in Logic Programming. PhD thesis, Universitá di Pisa, 1994. Technical Report 3/94.
W. Drabent. What is failure? An approach to constructive negation. Acta Informatica, 32:27–59, 1995.
W. Drabent. Completeness of SLDNF-resolution for Non-Floundering Queries. Journal of Logic Programming, 27(2):89–106, May 1996.
M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science, 69(3):289–318, 1989.
M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation, 103(1):86–113, 1993.
K. Kunen. Negation in logic programming. Journal of Logic Programming, 4:289–308, 1987.
K. Kunen. Signed Data Dependencies in Logic Programs. Journal of Logic Programming, 7(3):231–245, 1989.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.
J. L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587–625. Morgan Kaufmann, Los Altos, Ca., 1988.
J. W. Lloyd and R. W. Topor. Making Prolog more Expressive. Journal of Logic Programming, 1(3):225–240, 1984.
C. Palamidessi. Algebraic properties of idempotent substitutions. In M. S. Paterson, editor, Proc. of the 17th International Colloquium on Automata, Languages and Programming, volume 443 of Lecture Notes in Computer Science, pages 386–399. Springer-Verlag, Berlin, 1990.
R. F. Stärk. Input/output dependencies of normal logic programs. Journal of Logic and Computation, 4:249–262, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Pierro, A., Drabent, W. (1996). On negation as instantiation. In: Hanus, M., Rodríguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1996. Lecture Notes in Computer Science, vol 1139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61735-3_2
Download citation
DOI: https://doi.org/10.1007/3-540-61735-3_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61735-8
Online ISBN: 978-3-540-70672-4
eBook Packages: Springer Book Archive