Sciweavers

73 search results - page 1 / 15
» plp: A Generic Compiler for Ordered Logic Programs
Sort
View
LPNMR
2001
Springer
13 years 9 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 4 months ago
A Framework for Compiling Preferences in Logic Programs
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
James P. Delgrande, Torsten Schaub, Hans Tompits
ESOP
2007
Springer
13 years 10 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
CORR
2007
Springer
123views Education» more  CORR 2007»
13 years 4 months ago
A Generic Analysis Environment for Curry Programs
We present CurryBrowser, a generic analysis environment for the declarative multi-paradigm language Curry. CurryBrowser supports browsing through the program code of an application...
Michael Hanus
PPCP
1993
13 years 8 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning