58 search results - page 4 / 12 » Ordered Completion for First-Order Logic Programs on Finite ... |
CORR
2004
Springer
13 years 6 months ago
2004
Springer
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
CORR
2004
Springer
13 years 6 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
JSYML
2008
13 years 6 months ago
2008
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
EJC
2010
13 years 6 months ago
2010
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
ASIAN
2006
Springer
13 years 10 months ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...