Abstract Answer Set Programming (ASP) is a well-known logic-based formalism that has
been used to model and solve a variety of AI problems. For several years, ASP …

Abstraction is an important technique utilized by humans in model building and problem
solving, in order to figure out key elements and relevant details of a world of interest. This …

Abstraction is a well-known approach to simplify a complex problem by over-approximating
it with a deliberate loss of information. It was not considered so far in Answer Set …

Many efficient algorithms for the computation of optimum stable models in the context of
Answer Set Programming (ASP) are based on unsatisfiable core analysis. Among them …

Abstract Answer Set Programming (ASP) is a prominent modeling and solving framework.
An inconsistent core (IC) of an ASP program is an inconsistent subset of rules. In the case of …

The fundamental mechanism that humans use in argumentation can be formalized in
abstract argumentation frameworks. Many semantics are associated with abstract …

Propositional circumscription defines a preference relation over the models of a
propositional theory, so that models being subset-minimal on the interpretation of a set of …

Magic sets are a Datalog to Datalog rewriting technique to optimize query answering. The
rewritten program focuses on a portion of the stable model (s) of the input program which is …

Modern, efficient Answer Set Programming solvers implement answer set search via non-
chronological backtracking algorithms. The extension of these algorithms to answer set …

SAT solvers are used in a wide variety of applications, including hardware and software
verification, planning and combinatorial design. Given a propositional formula, standard SAT …