Abstract
We study a generalization of the classical notion of implication, called weak implication. It extends unquantified predicate logic with a single level of existential quantification. We present a sound and complete set of deduction rules for weak implications.
The notion of weak implication was introduced for the sake of a formal specification of a symbolic constraint solving system. Other practical applications of can be found in the realm of relational database theory: query normalization and integrity constraints in the context of views.
Preview
Unable to display preview. Download preview PDF.
References
W.F. Clocksin & C.S. Mellish. Programming in Prolog. Springer-Verlag, 1981.
S. van Denneheuvel. Constraint solving on database systems. Design and implementation of the rule language RL/1. Thesis. University of Amsterdam, 1991.
S. v Denneheuvel & K.L. Kwast. Weak equivalence for constraint solving. In: Proceedings of IJCAI'91: Int. Joint Conference on A.I. Sydney. Morgan Kaufmann, 1991.
S. v Denneheuvel, G.R. Renardel de Lavalette, E. Spaan & K.L. Kwast. Query optimization using rewrite rules. In: R. Book (ed.), Proceedings of RTA'91: Int. Conference on Rewriting Techniques and Applications. Como, LNCS488, 1991.
J. Jaffar & S. Michaylov. Methodology and Implementation of a CLP System. In: J-L. Lassez (ed.), Proceedings of the 4th Int. Conference on Logic Programming, MIT Press, 1987.
K.L. Kwast. Unknown values in the relational database system. Thesis. University of Amsterdam, 1992.
J.H. Siekmann. Unification Theory. In: Journal of Symbolic Computation, Vol. 7, 1989.
J.D. Ullman. Principles of Data and Knowledge-Base Systems, Vol. I & II. Computer Science Press, 1989.
S. Wolfram. Mathematica, a System for Doing Math by Computer. Addison-Wesley, 1988.
H.Z. Yang & P.A. Larson. Query Transformation for PSJ-queries. In: Proceedings of the 13th VLDB: Int. Conference on Very Large Databases, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwast, K.L., van Denneheuvel, S. (1992). Weak implication: Theory and applications. In: Pearce, D., Wagner, G. (eds) Logics in AI. JELIA 1992. Lecture Notes in Computer Science, vol 633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023422
Download citation
DOI: https://doi.org/10.1007/BFb0023422
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55887-3
Online ISBN: 978-3-540-47304-6
eBook Packages: Springer Book Archive