Journal of the ACM (JACM)
Declarative problem-solving in DLV
Logic-based artificial intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
IEEE Transactions on Knowledge and Data Engineering
Efficient Recursive Aggregation and Negation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
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
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Well-founded and stable semantics of logic programs with aggregates
Theory and Practice of Logic Programming
Experimenting with recursive queries in database and logic programming systems
Theory and Practice of Logic Programming
Logic programs with monotone abstract constraint atoms*
Theory and Practice of Logic Programming
Enhancing a DLP System for Advanced Database Applications
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Lparse Programs Revisited: Semantics and Representation of Aggregates
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Logic Language with Stable Model Semantics for Social Reasoning
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Logic programming with social features1
Theory and Practice of Logic Programming
Resource allocation with answer-set programming
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Logic programs with abstract constraint atoms
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Answer sets for logic programs with arbitrary abstract constraint atoms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
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 of programs with monotone and convex constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
A generalized gelfond-lifschitz transformation for logic programs with abstract constraints
AAAI'07 Proceedings of the 22nd 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
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
Theory and Practice of Logic Programming
Logic programs with abstract constraint atoms: The role of computations
Artificial Intelligence
Logic programs with abstract constraints: representaton, disjunction and complexities
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Logic programming for knowledge representation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Logic programs with abstract constraint atoms: the role of computations
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A 25-year perspective on logic programming
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Tabling with answer subsumption: implementation, applications and performance
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Secommunity: a framework for distributed access control
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Socially constructed trust for distributed authorization
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
A social semantics for multi-agent systems
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
Adding efficient data management to logic programming systems
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Privacy is linking permission to purpose
SP'04 Proceedings of the 12th international conference on Security Protocols
PlexC: a policy language for exposure control
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
Logical approaches to authorization policies
Logic Programs, Norms and Action
Modeling stable matching problems with answer set programming
RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Hi-index | 0.00 |
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ΣP2 (NPNP). Despite the high expressiveness of DLP, there are some simple properties, often arising in real-world applications, which cannot be encoded in a simple and natural manner. Among these, properties requiring to apply some arithmetic operators (like sum, times, count) on a set of elements satisfying some conditions, cannot be naturally expressed in DLP. To overcome this deficiency, in this paper we extend DLP by aggregate functions. We formally define the semantics of the new language, named DLPA. We show the usefulness of the new constructs on relevant knowledge-based problems. We analyze the computational complexity of DLPA, showing that the addition of aggregates does not bring a higher cost in that respect. We provide an implementation of the DLPA language in DLV- the state-of-the-art DLP system - and report on experiments which confirm the usefulness of the proposed extension also for the efficiency of the computation.