@inproceedings{41473a56152f460982fc29ed2906aaba,
title = "Query processing in quantitative logic programming",
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.",
author = "Subrahmanian, {V. S.}",
note = "Funding Information: Professor Howard Blair and Aida Batarekh. This work was supported by U.S. Air Force Contract F30602-85-C-0008. Publisher Copyright: {\textcopyright} 1988, Springer-Verlag.; 9th International Conference on Automated Deduction, CADE 1988 ; Conference date: 23-05-1988 Through 26-05-1988",
year = "1988",
doi = "10.1007/BFb0012824",
language = "English (US)",
isbn = "9783540193432",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "81--100",
editor = "Ewing Lusk and Ross Overbeek",
booktitle = "9th International Conference on Automated Deduction, Proceedings",
}