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 …

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 …

The increasing availability of streaming data has accelerated advances in information
processing tools that no longer store data for static querying but push information to …

Standardization of solver input languages has been a main driver for the growth of several
areas within knowledge representation and reasoning, fostering the exploitation in actual …

Since its birth, the field of Probabilistic Logic Programming has seen a steady increase of
activity, with many proposals for languages and algorithms for inference and learning. This …

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 …

2.00 Nov. 16th, 2012. First public release of the document. 2.01 Nov. 21th, 2012. Explicit
support of negative integers in grammar table. 2.02 Dec. 4th, 2012. Addition of optimize …

Recent research has explored using Datalog-based languages to express a distributed
system as a set of logical invariants. Two properties of distributed systems proved difficult to …

Artificial intelligence (AI) approaches to problem-solving and decision-making are becoming
more and more complex, leading to a decrease in the understandability of solutions. The …

Answer Set Programming (ASP) is a well-known paradigm of declarative programming with
roots in logic programming and non-monotonic reasoning. Similar to other closely related …