Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Information Processing Letters
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
ACM Transactions on Database Systems (TODS)
Logics with aggregate operators
Journal of the ACM (JACM)
Declarative problem-solving using the DLV system
Logic-based artificial intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
IEEE Transactions on Knowledge and Data Engineering
Efficient Recursive Aggregation and Negation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Modular Logic Programming and Generalized Quantifiers
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Weight constraints as nested expressions
Theory and Practice of Logic Programming
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
Properties of programs with monotone and convex constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Experimenting with heuristics for answer set programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
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
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
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
The DLV Project: A Tour from Theory and Research to Applications and Market
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
Computing Weighted Solutions in Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
On the Input Language of ASP Grounder Gringo
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
Dynamic magic sets for programs with monotone recursive aggregates
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Answer set programming at a glance
Communications of the ACM
Computing weighted solutions in ASP: representation-based method vs. search-based method
Annals of Mathematics and Artificial Intelligence
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Look-back Techniques for ASP Programs with Aggregates
Fundamenta Informaticae
The intelligent grounder of DLV
Correct Reasoning
Data exchange in datalog is mainly a matter of choice
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Tableau Calculi for Logic Programs under Answer Set Semantics
ACM Transactions on Computational Logic (TOCL)
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
Social access control language (SocACL)
Proceedings of the 6th International Conference on Security of Information and Networks
Hi-index | 0.02 |
Disjunctive logic programming (DLP) is a very expressive formalism. It allows for expressing every property of finite structures that is decidable in the complexity class ΣP2(=NPNP). Despite this high expressiveness, there are some simple properties, often arising in real-world applications, which cannot be encoded in a simple and natural manner. Especially properties that require the use of arithmetic operators (like sum, times, or count) on a set or multiset of elements, which satisfy some conditions, cannot be naturally expressed in classic DLP. To overcome this deficiency, we extend DLP by aggregate functions in a conservative way. In particular, we avoid the introduction of constructs with disputed semantics, by requiring aggregates to be stratified. We formally define the semantics of the extended language (called ), and illustrate how it can be profitably used for representing knowledge. Furthermore, we analyze the computational complexity of , showing that the addition of aggregates does not bring a higher cost in that respect. Finally, we provide an implementation of in DLVa state-of-the-art DLP systemand report on experiments which confirm the usefulness of the proposed extension also for the efficiency of computation.