Logic programs with abstract constraint atoms: The role of computations

Lengning Liu; Enrico Pontelli; Tran Cao Son; Mirossław Truszczyńki

doi:10.1007/978-3-540-74610-2_20

Logic programs with abstract constraint atoms: The role of computations

Lengning Liu, Enrico Pontelli, Tran Cao Son, Mirossław Truszczyńki

Computer Science

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

18 Scopus citations

Abstract

We provide new perspectives on the semantics of logic programs with constraints. To this end we introduce several notions of computation and propose to use the results of computations as answer sets of programs with constraints. We discuss the rationale behind different classes of computations and study the relationships among them and among the corresponding concepts of answer sets. The proposed semantics generalize the answer set semantics for programs with monotone, convex and/or arbitrary constraints described in the literature.

Original language	English
Title of host publication	Logic Programming - 23rd International Conference, ICLP 2007, Proceedings
Pages	286-301
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-540-74610-2_20
State	Published - 2007
Event	23rd International Conference on Logic Programming, ICLP 2007 - Porto, Portugal Duration: Sep 8 2007 → Sep 13 2007

Publication series

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

Conference

Conference	23rd International Conference on Logic Programming, ICLP 2007
Country/Territory	Portugal
City	Porto
Period	9/8/07 → 9/13/07

Bibliographical note

Funding Information:
The authors wish to thank the anonymous reviewers for their insightful comments. This research has been partially supported by NSF grants 0812267 and 0420407.

Funding

The authors wish to thank the anonymous reviewers for their insightful comments. This research has been partially supported by NSF grants 0812267 and 0420407.

Funders	Funder number
National Science Foundation Arctic Social Science Program	0420407, 0812267

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-74610-2_20

Cite this

Liu, L., Pontelli, E., Son, T. C., & Truszczyńki, M. (2007). Logic programs with abstract constraint atoms: The role of computations. In Logic Programming - 23rd International Conference, ICLP 2007, Proceedings (pp. 286-301). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4670 LNCS). https://doi.org/10.1007/978-3-540-74610-2_20

@inproceedings{7ea28ef01dfb43d2ba7f0b5e0e9642b3,

title = "Logic programs with abstract constraint atoms: The role of computations",

abstract = "We provide new perspectives on the semantics of logic programs with constraints. To this end we introduce several notions of computation and propose to use the results of computations as answer sets of programs with constraints. We discuss the rationale behind different classes of computations and study the relationships among them and among the corresponding concepts of answer sets. The proposed semantics generalize the answer set semantics for programs with monotone, convex and/or arbitrary constraints described in the literature.",

author = "Lengning Liu and Enrico Pontelli and Son, {Tran Cao} and Miross{\l}aw Truszczy{\'n}ki",

note = "Funding Information: The authors wish to thank the anonymous reviewers for their insightful comments. This research has been partially supported by NSF grants 0812267 and 0420407.; 23rd International Conference on Logic Programming, ICLP 2007 ; Conference date: 08-09-2007 Through 13-09-2007",

year = "2007",

doi = "10.1007/978-3-540-74610-2_20",

language = "English",

isbn = "9783540746089",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "286--301",

booktitle = "Logic Programming - 23rd International Conference, ICLP 2007, Proceedings",

}

Liu, L, Pontelli, E, Son, TC & Truszczyńki, M 2007, Logic programs with abstract constraint atoms: The role of computations. in Logic Programming - 23rd International Conference, ICLP 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4670 LNCS, pp. 286-301, 23rd International Conference on Logic Programming, ICLP 2007, Porto, Portugal, 9/8/07. https://doi.org/10.1007/978-3-540-74610-2_20

Logic programs with abstract constraint atoms: The role of computations. / Liu, Lengning; Pontelli, Enrico; Son, Tran Cao et al.
Logic Programming - 23rd International Conference, ICLP 2007, Proceedings. 2007. p. 286-301 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4670 LNCS).

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

TY - GEN

T1 - Logic programs with abstract constraint atoms

T2 - 23rd International Conference on Logic Programming, ICLP 2007

AU - Liu, Lengning

AU - Pontelli, Enrico

AU - Son, Tran Cao

AU - Truszczyńki, Mirossław

N1 - Funding Information: The authors wish to thank the anonymous reviewers for their insightful comments. This research has been partially supported by NSF grants 0812267 and 0420407.

PY - 2007

Y1 - 2007

N2 - We provide new perspectives on the semantics of logic programs with constraints. To this end we introduce several notions of computation and propose to use the results of computations as answer sets of programs with constraints. We discuss the rationale behind different classes of computations and study the relationships among them and among the corresponding concepts of answer sets. The proposed semantics generalize the answer set semantics for programs with monotone, convex and/or arbitrary constraints described in the literature.

AB - We provide new perspectives on the semantics of logic programs with constraints. To this end we introduce several notions of computation and propose to use the results of computations as answer sets of programs with constraints. We discuss the rationale behind different classes of computations and study the relationships among them and among the corresponding concepts of answer sets. The proposed semantics generalize the answer set semantics for programs with monotone, convex and/or arbitrary constraints described in the literature.

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

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

U2 - 10.1007/978-3-540-74610-2_20

DO - 10.1007/978-3-540-74610-2_20

M3 - Conference contribution

AN - SCOPUS:38149110023

SN - 9783540746089

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

SP - 286

EP - 301

BT - Logic Programming - 23rd International Conference, ICLP 2007, Proceedings

Y2 - 8 September 2007 through 13 September 2007

ER -

Liu L, Pontelli E, Son TC, Truszczyńki M. Logic programs with abstract constraint atoms: The role of computations. In Logic Programming - 23rd International Conference, ICLP 2007, Proceedings. 2007. p. 286-301. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-74610-2_20

Logic programs with abstract constraint atoms: The role of computations

Abstract

Publication series

Conference

Bibliographical note

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this