Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence
A Constructive semantic characterization of aggregates in answer set programming
Theory and Practice of Logic Programming
A reductive semantics for counting and choice in answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Loop formulas for logic programs with arbitrary constraint atoms
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
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
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Unfounded sets for disjunctive logic programs with arbitrary aggregates
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Logic programs with propositional connectives and aggregates
ACM Transactions on Computational Logic (TOCL)
Relational information exchange and aggregation in multi-context systems
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Integrating rules and ontologies in the first-order stable model semantics
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
On elementary loops of logic programs
Theory and Practice of Logic Programming
First-Order encodings for modular nonmonotonic datalog programs
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Interpolable formulas in equilibrium logic and answer set programming
Journal of Artificial Intelligence Research
First-order extension of the FLP stable model semantics via modified circumscription
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Look-back Techniques for ASP Programs with Aggregates
Fundamenta Informaticae
| Hi-index | 0.00 |
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building upon a reductive approach to designing aggregates, we provide reformulations of some existing semantics in terms of propositional formulas, which help us compare the semantics and understand their properties in terms of their propositional formula representations. We also present a generalization of semantics of aggregates without involving grounding, and define loop formulas for programs with aggregates guided by the reductive approach.