850 search results - page 112 / 170 » A Logic Programming Language Based on Binding Algebras |
139
click to vote
RISE
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
160
click to vote
JMLR
2012
13 years 6 months ago
2012
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
143
click to vote
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
Physical data independence is touted as a central feature of modern database systems. Both relational and object-oriented systems, however, force users to frame their queries in t...
148
click to vote
JFP
2008
15 years 4 months ago
2008
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
135
Voted
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...