Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Logic programs with classical negation
Logic programming
Handbook of theoretical computer science (vol. B)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
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
On Logical Constraints in Logic Programming
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A logic programming approach to knowledge-state planning, II: the DLVk system
Artificial Intelligence
Theory and Practice of Logic Programming
Bounded LTL model checking with stable models
Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
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 monotone abstract constraint atoms*
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
A generalized gelfond-lifschitz transformation for logic programs with abstract constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Answer set planning under action costs
Journal of Artificial Intelligence Research
Answer sets for logic programs with arbitrary abstract constraint atoms
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Logic programs with abstract constraints: representaton, disjunction and complexities
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Logic programs with abstract constraint atoms: the role of computations
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Unfounded sets and well-founded semantics of answer set programs with aggregates
Journal of Artificial Intelligence Research
Logic Programs, Norms and Action
Disjunctive programs with set constraints
Correct Reasoning
Stepwise debugging of description-logic programs
Correct Reasoning
Hi-index | 0.00 |
We provide a new perspective on the semantics of logic programs with arbitrary abstract constraints. To this end, we introduce several notions of computation. We use the results of computations to specify answer sets of programs with constraints. We present the rationale behind the classes of computations we consider, and discuss the relationships among them. We also discuss the relationships among the corresponding concepts of answer sets. One of those concepts has several compelling characterizations and properties, and we propose it as the correct generalization of the answer-set semantics to the case of programs with arbitrary constraints. We show that several other notions of an answer set proposed in the literature for programs with constraints can be obtained within our framework as the results of appropriately selected classes of computations.