Article

Free access

The valid model semantics for logic programs

Authors:

Raghu Ramakrishnan,

Divesh Srivastava,

S. SudarshanAuthors Info & Claims

PODS '92: Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 91 - 104

https://doi.org/10.1145/137097.137115

Published: 01 July 1992 Publication History

Abstract

We present the valid model semantics, a new approach to providing semantics for logic programs with negation, set-terms and grouping. The valid model semantics is a three-valued semantics, and is defined in terms of a ‘normal form’ computation. The valid model semantics also gives meaning to the generation and use of non-ground facts (i.e., facts with variables) in a computation.

The formulation of the semantics in terms of a normal form computation offers important insight not only into the valid model semantics, but also into other semantics proposed earlier. We show that the valid model semantics extends the well-founded semantics in a natural manner, and has several advantages over it. The well-founded semantics can also be undertood using a variant of the normal form computations that we use; the normal form computations used for valid semantics seem more natural than those used for well-founded semantics.

We also show that the valid model semantics has several other desirable properties: it is founded ([SZ90]), it is contained in every regular model ([YY90]), and it is contained in every two-valued stable model.

References

[1]

K. R. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89- 148. Morgan-Kaufmann, San Mateo, Calif., 1988.

Digital Library

[2]

Catriel Beeri, Shamim Naqvi, Oded Shmueli, and Shalom Tsur. Set constructors in a logic database language. The Journal of Logic Programming, pages 181-232, 1991.

Digital Library

[3]

C. Beeri, P#. Ramakrishnan, D. Srivastava, and S. Sudarshan. Valid computations and the Magic implementation of stratified programs. Manuscript, September 91.

[4]

Sumit Ganguly, Sergio Greco, and Carlo Zaniolo. Minimum and maximum predicates in logic programming. In Proceedzngs of the A CM Symposium on Principles of Database Systems, 1991.

Digital Library

[5]

M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. Fzflh International Conference and Symposzum on Logic Programming, 1988.

[6]

David Kemp and Peter Stuckey. Semantics of logic programs with aggregates. In Proceedzngs of the International Logic Programmzng Symposium, pages 387-401, Slan Diego, CA, U.S.A., October 1991.

[7]

H. Przymusinska and T.C. Przymusinski. Weakly perfect model semantics for logic programs. In Proceedings of the Fifth Inlernational Conference/Symposzum on Logic Programming, 1988.

[8]

T.C. Przymusinski. On the declarative semantics of stratified deductive databases. In J. Minker, editor, Foundations of Deduct,ve Databases and Logic Programming, pages 193- 216, 1988.

Digital Library

[9]

T.C. Przymusinski. Extended stable semantics for normal and disjunctive programs. In Seventh International Conference on Logic Programming, pages 459-477, 1990.

Digital Library

[10]

T. C. Przymusinski. Semantics of disjunctive logic programs and deductive databases. In C. Delobel, M. Kifer, and Y. Masunaga, editors, Proceedings of the Second International Conference on Deductive and Object-Oriented Databases DOOD'81, pages 85-107, Munich, Germany, 1991. Springer-Verlag.

[11]

Kenneth Ross. Modular Stratification and Magic Sets for DATALOG programs with negation. In Proceedings of the A CM Symposium on Principles of Database Systems, pages 161-17 t, 1990.

Digital Library

[12]

Kenneth Ross and Yehoshua Sagiv. Monotonic aggregation in deductive databases. In Proceedings of the post-ILPS'91 Workshop on Deductive Databases, 1991.

[13]

John S. Schlipf. Formalizing a logic for logic programming. Annals of Mathematzcs and Artzfic#al lntelhgence. To appear.

[14]

Domenico Sacca and Carlo Zaniolo. Stable models and non-determinism in logic programs with negation. In Proceedzngs of ihe A CM Symposium on Principles of Database Systems, pages 205-217, 1990.

Digital Library

[15]

A. Van Gelder. The alternating fixpoint of logic programs with negation. In Proceedings of the A CM Symposzum on Pmnciples of Database Systems, pages 1-10, 1989.

Digital Library

[16]

A. Van Gelder. The well-founded semantics of aggregation. In Proceedings of the A CM Symposzum on Principles of Database Systems, 1992. (To appear.).

Digital Library

[17]

A. Van Gelder, K. Ross, and J. S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.

Digital Library

[18]

Jia-Huai You and Li "fan Yuan. Threevalued formalization of logic programming: is it needed? In Proceedzngs of the A CM Symposium on Prznciples of Database Systems, pages 172-182, 1990.

Digital Library

Cited By

Liu YStoller S(2022)Recursive Rules with Aggregation: A Simple Unified SemanticsLogical Foundations of Computer Science10.1007/978-3-030-93100-1_11(156-179)Online publication date: 10-Jan-2022
https://dl.acm.org/doi/10.1007/978-3-030-93100-1_11
Kaminski MKostylev EGrau BMotik BHorrocks I(2021)The Complexity and Expressive Power of Limit DatalogJournal of the ACM10.1145/349500969:1(1-83)Online publication date: 22-Dec-2021
https://dl.acm.org/doi/10.1145/3495009
Gelder A(2005)Foundations of aggregation in deductive databasesDeductive and Object-Oriented Databases10.1007/3-540-57530-8_2(13-34)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-57530-8_2
Show More Cited By

Index Terms

The valid model semantics for logic programs
1. Information systems
  1. Data management systems
    1. Query languages
2. Theory of computation

Recommendations

Compositional model-theoretic semantics for logic programs
Abstract
We present a compositional model-theoretic semantics for logic programs, where the composition of programs is modelled by the composition of the admissible Herbrand models of the programs. An Herbrand model is admissible if it is supported by the ...
Semantics for disjunctive logic programs
Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness
JELIA '08: Proceedings of the 11th European conference on Logics in Artificial Intelligence

We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-resolution for annotation-free many valued logic programs as defined by Fitting, and prove a soundness and completeness result relating the two. We show that ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '92: Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

July 1992

392 pages

ISBN:0897915194

DOI:10.1145/137097

Chairmen:
Moshe Y. Vardi
IBM Almaden Research Center
,
Paris C. Kanellakis
Brown Univ., Providence, RI

Copyright © 1992 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS92

Sponsor:

SIGMOD/PODS92: SIGMOD/PODS '92

June 2 - 5, 1992

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
230
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)9

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Liu YStoller S(2022)Recursive Rules with Aggregation: A Simple Unified SemanticsLogical Foundations of Computer Science10.1007/978-3-030-93100-1_11(156-179)Online publication date: 10-Jan-2022
https://dl.acm.org/doi/10.1007/978-3-030-93100-1_11
Kaminski MKostylev EGrau BMotik BHorrocks I(2021)The Complexity and Expressive Power of Limit DatalogJournal of the ACM10.1145/349500969:1(1-83)Online publication date: 22-Dec-2021
https://dl.acm.org/doi/10.1145/3495009
Gelder A(2005)Foundations of aggregation in deductive databasesDeductive and Object-Oriented Databases10.1007/3-540-57530-8_2(13-34)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-57530-8_2
Luong V(1999)Between Well-Founded Semantics and Stable Model SemanticsProceedings of the 1999 International Symposium on Database Engineering & Applications10.5555/850953.853895Online publication date: 2-Aug-1999
https://dl.acm.org/doi/10.5555/850953.853895
Beeri CMilo T(1997)Comparison of Functional and Predicative Query ParadigmsJournal of Computer and System Sciences10.1006/jcss.1997.144954:1(3-33)Online publication date: 1-Feb-1997
https://dl.acm.org/doi/10.1006/jcss.1997.1449
Lefebvre A(1994)Towards an efficient evaluation of recursive aggregates in deductive databasesNew Generation Computing10.1007/BF0303733912:2(131-160)Online publication date: 1-Mar-1994
https://dl.acm.org/doi/10.1007/BF03037339
Beeri CMilo T(1993)On the power of algebras with recursionACM SIGMOD Record10.1145/170036.17009022:2(377-387)Online publication date: 1-Jun-1993
https://dl.acm.org/doi/10.1145/170036.170090
Beeri CMilo T(1993)On the power of algebras with recursionProceedings of the 1993 ACM SIGMOD international conference on Management of data10.1145/170035.170090(377-387)Online publication date: 1-Jun-1993
https://dl.acm.org/doi/10.1145/170035.170090
Univ. of Wisconsin C(1993)Database research at WisconsinACM SIGMOD Record10.1145/156883.15689422:1(74-81)Online publication date: 1-Mar-1993
https://dl.acm.org/doi/10.1145/156883.156894
Van Gelder AVardi MKanellakis P(1992)The well-founded semantics of aggregationProceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems10.1145/137097.137854(127-138)Online publication date: 1-Jul-1992
https://dl.acm.org/doi/10.1145/137097.137854
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents