Logic programs with abstract constraint atoms: the role of computations

Authors:
Lengning Liu;Enrico Pontelli;Tran Cao Son;Mirosł/aw Truszczy*nacute/ski
Affiliations:
Department of Computer Science, University of Kentucky, Lexington, KY;Department of Computer Science, New Mexico State University, Las Cruces, NM;Department of Computer Science, New Mexico State University, Las Cruces, NM;Department of Computer Science, University of Kentucky, Lexington, KY
Venue:
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Year:
2007

Citing 14
Cited 12

The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Nonmonotonic Logic: Context-Dependent Reasoning

Nonmonotonic Logic: Context-Dependent Reasoning
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates

Proceedings of the 17th International Conference on Logic Programming
Representing Knowledge in A-Prolog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Bounded LTL model checking with stable models

Theory and Practice of Logic Programming
Temporal phylogenetic networks and logic programming

Theory and Practice of Logic Programming
Answer set based design of knowledge systems

Annals of Mathematics and Artificial Intelligence
A Constructive semantic characterization of aggregates in answer set programming

Theory and Practice of Logic Programming
Logic programs with abstract constraint atoms

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Properties of programs with monotone and convex constraints

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Answer sets for logic programs with arbitrary abstract constraint atoms

Journal of Artificial Intelligence Research
Aggregate functions in disjunctive logic programming: semantics, complexity, and implementation in DLV

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Answer sets for propositional theories

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning

Lparse Programs Revisited: Semantics and Representation of Aggregates

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Integrating answer set programming and constraint logic programming

Annals of Mathematics and Artificial Intelligence
Answer Set Programming with Constraints Using Lazy Grounding

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A First Order Forward Chaining Approach for Answer Set Computing

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A Default Approach to Semantics of Logic Programs with Constraint Atoms

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Present and Future Challenges for ASP Systems

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms

Theory and Practice of Logic Programming
Logic programs with abstract constraint atoms: The role of computations

Artificial Intelligence
GASP: Answer Set Programming with Lazy Grounding

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Logic programming for knowledge representation

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Compiling answer set programs into event-driven action rules

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
GASP: Answer Set Programming with Lazy Grounding

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)

Quantified Score

Hi-index	0.00

Visualization

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.