CADE
2005
Springer
14 years 6 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
CADE
2005
Springer
14 years 6 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
CADE
2005
Springer
14 years 6 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...