551 search results - page 67 / 111 » {log}: A Logic Programming Language with Finite Sets |
212
click to vote
SAS
1992
Springer
15 years 10 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
150
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
149
click to vote
ICLP
2004
Springer
15 years 11 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...
183
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
269
click to vote
LISP
2006
15 years 6 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 ...