Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
Proceedings of the 17th International Conference on Logic Programming
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
Answer sets for logic programs with arbitrary abstract constraint atoms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Properties of programs with monotone and convex constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Declarative and computational properties of logic programs with aggregates
IJCAI'05 Proceedings of the 19th 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
SMODELSA: a system for computing answer sets of logic programs with aggregates
LPNMR'05 Proceedings of the 8th 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
Loop formulas for logic programs with arbitrary constraint atoms
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
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
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
The loop formula based semantics of description logic programs
Theoretical Computer Science
Hi-index | 0.00 |
We present a generalized Gelfond-Lifschitz transformation in order to define stable models for a logic program with arbitrary abstract constraints on sets (c-atoms). The generalization is based on a formal semantics and a novel abstract representation of c-atoms, as opposed to the commonly used power set form representation. In many cases, the abstract representation of a c-atom results in a substantial reduction of size from its power set form representation. We show that any c-atom A = (Ad, Ac) in the body of a clause can be characterized using its satisfiable sets, so that given an interpretation I the c-atom can be handled simply by introducing a special atom θA together with a new clause θA ← A1, ..., An for each satisfiable set {A1, ..., An} of A. We also prove that the latest fixpoint approach presented by Son et al. and our approach using the generalized Gelfond-Lifschitz transformation are semantically equivalent in the sense that they define the same set of stable models.