Sciweavers

641 search results - page 10 / 129
» Embedding Finite Sets in a Logic Programming Language
Sort
View
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
A Translational Approach to Constraint Answer Set Solving
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
Christian Drescher, Toby Walsh
CADE
2006
Springer
14 years 8 months ago
Using the TPTP Language for Writing Derivations and Finite Interpretations
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...
ASP
2003
Springer
14 years 1 months ago
Integrating Semantic Web Reasoning and Answer Set Programming
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...
Stijn Heymans, Dirk Vermeir
GPCE
2008
Springer
13 years 9 months ago
Polymorphic embedding of dsls
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,...
AGP
2003
IEEE
14 years 1 months ago
An Ordered Choice Logic Programming Front-End for Answer Set Solvers
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...
Marina De Vos