Sciweavers

CADE
2006
Springer
15 years 4 months ago
Interpolation in Local Theory Extensions
In this paper we study interpolation in local extensions of a base theory. We identify situations in which it is possible to obtain interpolants in a hierarchical manner, by using ...
Viorica Sofronie-Stokkermans
93
Voted
CADE
2006
Springer
15 years 4 months ago
System Description: GCLCprover + GeoThms
Predrag Janicic, Pedro Quaresma
102
Voted
CADE
2006
Springer
15 years 4 months ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
89
Voted
CADE
2006
Springer
15 years 4 months ago
Matrix Interpretations for Proving Termination of Term Rewriting
Jörg Endrullis, Johannes Waldmann, Hans Zante...
CADE
2006
Springer
15 years 4 months ago
Presburger Modal Logic Is PSPACE-Complete
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
Stéphane Demri, Denis Lugiez
106
Voted
CADE
2006
Springer
16 years 1 months ago
Formal Global Optimisation with Taylor Models
Roland Zumkeller
96
Voted
CADE
2006
Springer
16 years 1 months ago
The MathServe System for Semantic Web Reasoning Services
Jürgen Zimmer, Serge Autexier
112
Voted
CADE
2006
Springer
16 years 1 months ago
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Anna Zamansky, Arnon Avron
96
Voted
CADE
2006
Springer
16 years 1 months ago
On the Strength of Proof-Irrelevant Type Theories
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
Benjamin Werner
87
Voted
CADE
2006
Springer
16 years 1 months ago
Using the TPTP Language for Writing Derivations and Finite Interpretations
One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as probl...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Al...