The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Extending and implementing the stable model semantics
Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Quartet-Based Phylogeny Reconstruction with Answer Set Programming
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A Constructive semantic characterization of aggregates in answer set programming
Theory and Practice of Logic Programming
Well-founded and stable semantics of logic programs with aggregates
Theory and Practice of Logic Programming
Logic programs with monotone abstract constraint atoms*
Theory and Practice of Logic Programming
Properties and applications of programs with monotone and convex constraints
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
Declarative and computational properties of logic programs with aggregates
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The first answer set programming system competition
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
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
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
Well-Supported semantics for logic programs with generalized rules
Correct Reasoning
| Hi-index | 0.00 |
Lparse programs are logic programs with weight constraints as implemented in the smodels system, which constitute an important class of logic programs with constraint atoms. To effectively apply lparse programs to problem solving, a clear understanding of its semantics and representation power is indispensable. In this paper, we study the semantics of lparse programs, called the lparse semantics . We show that for a large class of programs, called strongly satisfiable programs , the lparse semantics agrees with the semantics based on conditional satisfaction. However, when the two semantics disagree, a stable model admitted by the lparse semantics may be circularly justified. We then present a transformation, by which an lparse program can be transformed to a strongly satisfiable one, so that no circular models may be generated under the current implementation of smodels . This leads to an investigation of a methodological issue, namely the possibility of compact representation of aggregate programs by lparse programs. We present some experimental results to compare this approach with the ones where aggregates are more explicitly handled.