Answer sets
M Gelfond - Foundations of Artificial Intelligence, 2008 - Elsevier
Publisher Summary This chapter discusses Answer Set Prolog, which is a language for
knowledge representation and reasoning based on the answer set/stable model semantics …
knowledge representation and reasoning based on the answer set/stable model semantics …
[ΒΙΒΛΙΟ][B] Answer set programming
V Lifschitz - 2019 - cdn.aaai.org
Answer set programming (ASP) is a form of declarative programming oriented towards
difficult search problems. As an outgrowth of research on the use of nonmonotonic …
difficult search problems. As an outgrowth of research on the use of nonmonotonic …
[ΒΙΒΛΙΟ][B] Handbook of knowledge representation
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Semantics and complexity of recursive aggregates in answer set programming
The addition of aggregates has been one of the most relevant enhancements to the
language of answer set programming (ASP). They strengthen the modelling power of ASP in …
language of answer set programming (ASP). They strengthen the modelling power of ASP in …
Abstract dialectical frameworks. An overview
This article describes abstract dialectical frameworks, or ADFs for short. ADFs are
generalizations of the widely used Dung argumentation frameworks. Whereas the latter …
generalizations of the widely used Dung argumentation frameworks. Whereas the latter …
Well-founded and stable semantics of logic programs with aggregates
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 …
in the context of logic programming. In our study, an aggregate can be an arbitrary …
Design and implementation of aggregate functions in the DLV system
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) …
every property of finite structures that is decidable in the complexity class ΣP2 (= NPNP) …
Fixpoint semantics and optimization of recursive datalog programs with aggregates
A very desirable Datalog extension investigated by many researchers in the last 30 years
consists in allowing the use of the basic SQL aggregates min, max, count and sum in …
consists in allowing the use of the basic SQL aggregates min, max, count and sum in …
Vicious circle principle and logic programs with aggregates
Vicious Circle Principle and Logic Programs with Aggregates Page 1 TLP 14 (4–5): 587–601,
2014. C Cambridge University Press 2014 doi:10.1017/S1471068414000222 587 Vicious …
2014. C Cambridge University Press 2014 doi:10.1017/S1471068414000222 587 Vicious …
Optimum stable model search: algorithms and implementation
Abstract Answer Set Programming (ASP) is a well-known declarative problem solving
paradigm developed in the field of nonmonotonic reasoning and logic programming. The …
paradigm developed in the field of nonmonotonic reasoning and logic programming. The …