Query processing in quantitative logic programming

V. S. Subrahmanian

doi:10.1007/BFb0012824

Query processing in quantitative logic programming

V. S. Subrahmanian^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Scopus citations

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.

Original language	English (US)
Title of host publication	9th International Conference on Automated Deduction, Proceedings
Editors	Ewing Lusk, Ross Overbeek
Publisher	Springer Verlag
Pages	81-100
Number of pages	20
ISBN (Print)	9783540193432
DOIs	https://doi.org/10.1007/BFb0012824
State	Published - 1988
Externally published	Yes
Event	9th International Conference on Automated Deduction, CADE 1988 - Argonne, United States Duration: May 23 1988 → May 26 1988

Publication series

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

Other

Other	9th International Conference on Automated Deduction, CADE 1988
Country/Territory	United States
City	Argonne
Period	5/23/88 → 5/26/88

Funding

Professor Howard Blair and Aida Batarekh. This work was supported by U.S. Air Force Contract F30602-85-C-0008.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/BFb0012824

Cite this

Subrahmanian, V. S. (1988). Query processing in quantitative logic programming. In E. Lusk, & R. Overbeek (Eds.), 9th International Conference on Automated Deduction, Proceedings (pp. 81-100). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 310 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0012824

@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 = "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",

}

Subrahmanian, VS 1988, Query processing in quantitative logic programming. in E Lusk & R Overbeek (eds), 9th International Conference on Automated Deduction, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 310 LNCS, Springer Verlag, pp. 81-100, 9th International Conference on Automated Deduction, CADE 1988, Argonne, United States, 5/23/88. https://doi.org/10.1007/BFb0012824

Query processing in quantitative logic programming. / Subrahmanian, V. S.
9th International Conference on Automated Deduction, Proceedings. ed. / Ewing Lusk; Ross Overbeek. Springer Verlag, 1988. p. 81-100 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 310 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Query processing in quantitative logic programming

AU - Subrahmanian, V. S.

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84981430335&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84981430335&partnerID=8YFLogxK

U2 - 10.1007/BFb0012824

DO - 10.1007/BFb0012824

M3 - Conference contribution

AN - SCOPUS:84981430335

SN - 9783540193432

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 81

EP - 100

BT - 9th International Conference on Automated Deduction, Proceedings

A2 - Lusk, Ewing

A2 - Overbeek, Ross

PB - Springer Verlag

T2 - 9th International Conference on Automated Deduction, CADE 1988

Y2 - 23 May 1988 through 26 May 1988

ER -

Query processing in quantitative logic programming

Abstract

Publication series

Other

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this