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 …

This paper describes the First-Order Form (FOF) and Clause Normal Form (CNF) parts of the
TPTP problem library, and the associated infrastructure. TPTP v3. 5.0 was the last release …

Abstract Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted
in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing …

Abstract Answer Set Programming (ASP) is a well-established paradigm of declarative
programming that has been developed in the field of logic programming and non-monotonic …

Answer-set programming (ASP) has emerged as a declarative programming paradigm
where problems are encoded as logic programs, such that the so-called answer sets of …

We consider the problem of allocating fairly a set of indivisible goods among agents from the
point of view of compact representation and computational complexity. We start by assuming …

The seaport of Gioia Tauro is the largest transshipment terminal of the Mediterranean coast.
A crucial management task for the companies operating in the seaport is team-building: the …

Abstract Answer Set Programming (ASP), referred to also as Disjunctive Logic Programming
under the stable model semantics (DLP), is a powerful formalism for Knowledge …

Abstract Disjunctive Logic Programming (DLP) under the answer set semantics, often
referred to as Answer Set Programming (ASP), is a powerful formalism for knowledge …

The n-Queens problem is to place n chess queens on an n by n chessboard so that no two
queens are on the same row, column or diagonal. The n-Queens Completion problem is a …