CADE
2010
Springer
13 years 10 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
CADE
2009
Springer
14 years 29 days ago
2009
Springer
CADE
2010
Springer
14 years 29 days ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
CADE
2010
Springer
14 years 29 days ago
2010
Springer
State of the art reasoners for expressive description logics, such as those that underpin the OWL ontology language, are typically based on highly optimized implementations of (hyp...
CADE
2010
Springer
14 years 29 days ago
2010
Springer
CADE
2010
Springer
14 years 29 days ago
2010
Springer
CADE
2010
Springer
14 years 29 days ago
2010
Springer
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
CADE
2010
Springer
14 years 29 days ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
CADE
2010
Springer
14 years 29 days ago
2010
Springer
CADE
2010
Springer
14 years 29 days ago
2010
Springer
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...