351 search results - page 11 / 71 » Logic Programs with Compiled Preferences |
HYBRID
2004
Springer
14 years 2 months ago
2004
Springer
We present a new high-level programming language, called XGIOTTO, for programming applications with hard real-time constraints. Like its predecessor, XGIOTTO is based on the LET (l...
PADL
2005
Springer
14 years 2 months ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
ICLP
2004
Springer
14 years 2 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...