351 search results - page 13 / 71 » Logic Programs with Compiled Preferences |
ICLP
1994
Springer
14 years 21 days ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
LISP
2006
13 years 8 months ago
2006
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
ECAI
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. Possibilistic knowledge bases gather propositional formulas associated with degrees belonging to a linearly ordered scale. These degrees reflect certainty or priority, de...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalu...
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...