Journal of the ACM (JACM)
Complexity results for disjunctive logic programming and application to nonmonotonic logics
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Proceedings of the eleventh international conference on Logic programming
Foundations of logic programming
Principles of knowledge representation
Proceedings of the 1999 international conference on Logic programming
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
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
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
Proceedings of the 17th International Conference on Logic Programming
Developing a Declarative Rule Language for Applications in Product Configuration
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Formalizing (and Reasoning About) the Specifications of Workflows
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
Wire Routing and Satisfiability Planning
CL '00 Proceedings of the First International Conference on Computational Logic
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
Weight constraints as nested expressions
Theory and Practice of Logic Programming
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence
Well-founded and stable semantics of logic programs with aggregates
Theory and Practice of Logic Programming
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
Expressiveness of answer set languages
Expressiveness of answer set languages
On Reductive Semantics of Aggregates in Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Answer sets for logic programs with arbitrary abstract constraint atoms
Journal of Artificial Intelligence Research
A logic program characterization of causal theories
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Declarative and computational properties of logic programs with aggregates
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Causal theories of action and change
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The loop formula based semantics of description logic programs
Theoretical Computer Science
Unfounded sets and well-founded semantics of answer set programs with aggregates
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Answer set programming (ASP) is a logic programming paradigm that can be used to solve complex combinatorial search problems. Aggregates are an ASP construct that plays an important role in many applications. Defining a satisfactory semantics of aggregates turned out to be a difficult problem, and in this article we propose a new approach, based on an analogy between aggregates and propositional connectives. First we extend the definition of an answer set/stable model to cover arbitrary propositional theories; then we define aggregates on top of them both as primitive constructs and as abbreviations for formulas. Our definition of an aggregate combines expressiveness and simplicity, and it inherits many theorems about programs with nested expressions, such as theorems about strong equivalence and splitting.