850 search results - page 112 / 170 » A Logic Programming Language Based on Binding Algebras |
108
click to vote
RISE
2004
Springer
15 years 6 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...
131
click to vote
JMLR
2012
13 years 3 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...
113
click to vote
VLDB
1994
ACM
15 years 5 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...
126
click to vote
JFP
2008
15 years 1 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...
105
click to vote
ICLP
2005
Springer
15 years 6 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...