CSL
2010
Springer
13 years 11 months ago
2010
Springer
CSL
2010
Springer
13 years 11 months ago
2010
Springer
CSL
2010
Springer
13 years 11 months ago
2010
Springer
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...
IWAR
1992
13 years 11 months ago
1992
This paper reports the study of properties of the curve pairs of the Bertrand types using our automated reasoning program based on Wu's method of mechanical theorem proving fo...
DLOG
1996
13 years 11 months ago
1996
Several significant problems exist whenapplying knowledge representation systems to real problems. In particular, the obscurity of LISP, the resource consumption, garbage collecti...
DLOG
1996
13 years 11 months ago
1996
DLOG
1996
13 years 11 months ago
1996