Logic programs with abstract constraint atoms: The role of computations

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations


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 languageEnglish
Title of host publicationLogic Programming - 23rd International Conference, ICLP 2007, Proceedings
Number of pages16
StatePublished - 2007
Event23rd International Conference on Logic Programming, ICLP 2007 - Porto, Portugal
Duration: Sep 8 2007Sep 13 2007

Publication series

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


Conference23rd International Conference on Logic Programming, ICLP 2007

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.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Logic programs with abstract constraint atoms: The role of computations'. Together they form a unique fingerprint.

Cite this