Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
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
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
Logic-based artificial intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Extending and implementing the stable model semantics
Artificial Intelligence
Uniform semantic treatment of default and autoepistemic logics
Artificial Intelligence
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
Proceedings of the 17th International Conference on Logic Programming
The Magic of Duplicates and Aggregates
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Ultimate approximation and its application in nonmonotonic knowledge representation systems
Information and Computation
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics
ACM Transactions on Computational Logic (TOCL)
A Constructive semantic characterization of aggregates in answer set programming
Theory and Practice of Logic Programming
Logic programs with abstract constraint atoms
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A framework for representing and solving NP search problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
IJCAI'03 Proceedings of the 18th 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
Lparse Programs Revisited: Semantics and Representation of Aggregates
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
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
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Properties and applications of programs with monotone and convex constraints
Journal of Artificial Intelligence Research
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
Theory and Practice of Logic Programming
On the complexity of answer set programming with aggregates
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Logic programs with abstract constraints: representaton, disjunction and complexities
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Well-founded semantics for description logic programs in the semantic web
ACM Transactions on Computational Logic (TOCL)
A 25-year perspective on logic programming
Logic programming languages for databases and the web
A 25-year perspective on logic programming
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
ILP'09 Proceedings of the 19th international conference on Inductive logic programming
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
ACM Transactions on Computational Logic (TOCL)
Loop-separable programs and their first-order definability
Artificial Intelligence
Logic programs with propositional connectives and aggregates
ACM Transactions on Computational Logic (TOCL)
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
Strong equivalence of logic programs with abstract constraint atoms
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Aggregates in answer set optimization
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
LP with flexible grouping and aggregates using modes
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Unfounded sets and well-founded semantics of answer set programs with aggregates
Journal of Artificial Intelligence Research
Specification patterns from research to industry: a case study in service-based applications
Proceedings of the 34th International Conference on Software Engineering
Look-back Techniques for ASP Programs with Aggregates
Fundamenta Informaticae
Well-Supported semantics for logic programs with generalized rules
Correct Reasoning
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Nested Weight Constraints in ASP
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Hi-index | 0.00 |
In this paper, we present a framework for the semantics and the computation of aggregates in the context of logic programming. In our study, an aggregate can be an arbitrary interpreted second order predicate or function. We define extensions of the Kripke-Kleene, the well-founded and the stable semantics for aggregate programs. The semantics is based on the concept of a three-valued immediate consequence operator of an aggregate program. Such an operator approximates the standard two-valued immediate consequence operator of the program, and induces a unique Kripke-Kleene model, a unique well-founded model and a collection of stable models. We study different ways of defining such operators and thus obtain a framework of semantics, offering different trade-offs between precision and tractability. In particular, we investigate conditions on the operator that guarantee that the computation of the three types of semantics remains on the same level as for logic programs without aggregates. Other results show that, in practice, even efficient three-valued immediate consequence operators which are very low in the precision hierarchy, still provide optimal precision.