Abstract
In [12] the notion of a quantitative logic program has been introduced, and its declarative semantics explored. The operational semantics given in [12] is extended significantly in this paper — in particular, the notion of correct answer substitution is introduced and soundness and completeness results obtained. In addition, the completeness results for the and-or tree searching technique given in [12] is strengthened to be applicable to quantitative logic programs that are not well covered, thus removing one restriction in the completeness theorem obtained in [12]. In addition, the soundness and completeness results for SLDq-resolution in [12] are strengthened to apply to any nice QLP. Moreover, all these soundness and completeness results are applicable to existential queries unlike the results of [12,13] and [14] which are applicable to ground queries only. It was shown in [12] that the greatest supported model of a class of QLPs is semi-computable. In this paper, we give an explicit procedure to compute (partially) the greatest supported model, and obtain soundness and completeness results. This has applications in reasoning about beliefs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Apt,K.,Blair,H., Walker,A. “Towards a Theory of Declarative Knowledge”, to appear, 1988.
Blair, H.A., Brown, A.L., Subrahmanian, V.S. “A Logic Programming Semantics Scheme, Part I”, Logic Programming Research Group Tech. Report LPRG-TR-88-8, Syracuse University.
Blair,H.A., Subrahmanian,V.S. “Paraconsistent Logic Programming”, Proc. 7th Intl. Conf. on Foundations of Software Tech. & Theoretical Computer Science, Lecture Notes in Computer Science Vol. 287, pps 340–360, Springer Verlag, Dec. 1987.
Blair,H.A., Subrahmanian,V.S. “Foundations of Generally Horn Logic Programming”,in preparation.
da Costa, N.C.A. “On the Theory of Inconsistent Formal Systems”, Notre Dame J. of Formal Logic, 15, pps 497–510, 1974.
da Costa, N.C.A. “A Semantical Analysis of the Calculi C n ”, Notre Dame J. of Formal Logic, 18, pps 621–630, 1977.
da Costa, N.C.A., Alves, E.H. “Relations between Paraconsistent Logic and Many Valued Logic”, Bull. of the Section of Logic, 10,pps 185–191, 1981.
Fitting, M. “A Kripke-Kleene semantics for logic programs”, J. of Logic Programming, 2,4, pps 295–312, 1985.
Fitting, M. “Notes on the Mathematical Aspects of Kripke's Theory of Truth”, Notre Dame J. of Formal Logic, 27, 1, pps 75–88, 1986.
Lloyd,J.W. “Foundations of Logic Programming”, Springer.
Lassez, J.-L.,Maher, M. “Optimal Fixed-points of Logic Programs”, Theoret. Comput. Sci., 39, pps 115–125, 1985.
Subrahmanian,V.S. “On the Semantics of Quantitative Logic Programs”, Proc. 4th IEEE Symp. on Logic Prog., pps 173–182, San Francisco, Sep. 1987.
Subrahmanian,V.S. “Towards a Theory of Evidential Reasoning in Logic Programming”, Logic Colloquium '87, Granada, Spain, July 1987.
Van Emden, M.H. “Quantitative Deduction and its Fixpoint Theory”, J. of Logic Prog., 4,1, pps 37–53, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Subrahmanian, V.S. (1988). Query processing in quantitative logic programming. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012824
Download citation
DOI: https://doi.org/10.1007/BFb0012824
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19343-2
Online ISBN: 978-3-540-39216-3
eBook Packages: Springer Book Archive