Sciweavers

351 search results - page 2 / 71
» Logic Programs with Compiled Preferences
Sort
View
IJCAI
1997
13 years 8 months ago
Compiling Reasoning with and about Preferences into Default Logic
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
James P. Delgrande, Torsten Schaub
ESOP
2007
Springer
14 years 1 months ago
Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic
We give an overview of a proof-producing compiler which translates recursion equations, defined in higher order logic, to assembly language. The compiler is implemented and valida...
Guodong Li, Scott Owens, Konrad Slind
EUSFLAT
2009
126views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Fuzzy Answer Set Programming with Literal Preferences
Jeroen Janssen, Steven Schockaert, Dirk Vermeir, M...
LPNMR
2004
Springer
14 years 25 days ago
nlp: A Compiler for Nested Logic Programming
nlp is a compiler for nested logic programming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets ...
Vladimir Sarsakov, Torsten Schaub, Hans Tompits, S...
JUCS
2006
175views more  JUCS 2006»
13 years 7 months ago
The Design of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...
Anderson Faustino da Silva, Vítor Santos Co...