Semantical considerations on nonmonotonic logic
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
The well-founded semantics of aggregation
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Journal of the ACM (JACM)
Aggregation and negation-as-failure
New Generation Computing
Extending and implementing the stable model semantics
Artificial Intelligence
Formalizing Commonsense: Papers by John McCarthy
Formalizing Commonsense: Papers by John McCarthy
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
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
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 abstract constraint atoms
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
Conflict-driven answer set solving
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
Logic programs with abstract constraint atoms: The role of computations
Artificial Intelligence
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
Logic programs with propositional connectives and aggregates
ACM Transactions on Computational Logic (TOCL)
A Logic-Based System for e-Tourism
Fundamenta Informaticae - On the Italian Conference on Computational Logic: CILC 2009
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
The HiLeX system for semantic information extraction
Transactions on Large-Scale Data- and Knowledge-Centered Systems V
Team-building with answer set programming in the gioia-tauro seaport
Theory and Practice of Logic Programming
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
Advanced conflict-driven disjunctive answer set solving
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Nested Weight Constraints in ASP
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Hi-index | 0.00 |
Logic programs with aggregates (LPA) are one of the major linguistic extensions to Logic Programming (LP). In this work, we propose a generalization of the notions of unfounded set and well-founded semantics for programs with monotone and antimonotone aggregates (LPm,aA programs). In particular, we present a new notion of unfounded set for LPm,aA programs, which is a sound generalization of the original definition for standard (aggregate-free) LP. On this basis, we define a well-founded operator for LPm,aA programs, the fixpoint of which is called well-founded model (or well-founded semantics) for LPm,aA programs. The most important properties of unfounded sets and the well-founded semantics for standard LP are retained by this generalization, notably existence and uniqueness of the well-founded model, together with a strong relationship to the answer set semantics for LPm,aA programs. We show that one of the D-well-founded semantics, defined by Pelov, Denecker, and Bruynooghe for a broader class of aggregates using approximating operators, coincides with the well-founded model as defined in this work on LPm,aA programs. We also discuss some complexity issues, most importantly we give a formal proof of tractable computation of the well-founded model for LPm,aA programs. Moreover, we prove that for general LPA programs, which may contain aggregates that are neither monotone nor antimonotone, deciding satisfaction of aggregate expressions with respect to partial interpretations is coNP-complete. As a consequence, a well-founded semantics for general LPA programs that allows for tractable computation is unlikely to exist, which justifies the restriction on LPm,aA programs. Finally, we present a prototype system extending DLV, which supports the well-founded semantics for LPm,aA programs, at the time of writing the only implemented system that does so. Experiments with this prototype show significant computational advantages of aggregate constructs over equivalent aggregate-free encodings.