Query processing in quantitative logic programming

V. S. Subrahmanian*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


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.

Original languageEnglish (US)
Title of host publication9th International Conference on Automated Deduction, Proceedings
EditorsEwing Lusk, Ross Overbeek
PublisherSpringer Verlag
Number of pages20
ISBN (Print)9783540193432
StatePublished - 1988
Externally publishedYes
Event9th International Conference on Automated Deduction, CADE 1988 - Argonne, United States
Duration: May 23 1988May 26 1988

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume310 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other9th International Conference on Automated Deduction, CADE 1988
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Query processing in quantitative logic programming'. Together they form a unique fingerprint.

Cite this