We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as probl...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Al...
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...
The influential pure embedding methodology of embedding domainspecific languages (DSLs) as libraries into a general-purpose host language forces the DSL designer to commit to a ...
Christian Hofer, Klaus Ostermann, Tillmann Rendel,...
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives without the burden of any form of negation. This complete ab...