Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored
to modeling problems in the area of Knowledge Representation and Reasoning (KRR) …

Potassco: The Potsdam Answer Set Solving Collection Page 1 AI Communications 24 (2011)
107–124 107 DOI 10.3233/AIC-2011-0491 IOS Press Potassco: The Potsdam Answer Set …

We introduce an approach to computing answer sets of logic programs, based on concepts
successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in …

Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans,
that is, solutions to planning problems, that transform a given state of the world to another …

Procedural content generators for games produce artifacts from a latent design space. This
space is often only implicitly defined, an emergent result of the procedures used in the …

Pathfinding for a single agent is the problem of planning a route from an initial location to a
goal location in an environment, going around obstacles. Pathfinding for multiple agents …

This paper develops a declarative language, P-log, that combines logical and probabilistic
arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while …

Over the last two decades, numerous approaches have been developed for automating
construction safety assessment, that is, prevention through design and planning (PtD/P), that …

Abstract Despite early interest Predicate Invention has lately been under-explored within
ILP. We develop a framework in which predicate invention and recursive generalisations are …

All solutions SAT (AllSAT for short) is a variant of the propositional satisfiability problem.
AllSAT has been relatively unexplored compared to other variants despite its significance …