Sciweavers

CADE
2006
Springer
14 years 11 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
CADE
2006
Springer
14 years 11 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
CADE
2006
Springer
14 years 11 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...
CADE
2006
Springer
14 years 11 months ago
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
Christian Urban, Stefan Berghofer
CADE
2006
Springer
14 years 11 months ago
Automatic Construction and Verification of Isotopy Invariants
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
Volker Sorge, Andreas Meier, Roy L. McCasland, Sim...
CADE
2006
Springer
14 years 11 months ago
Description Logic Reasoner: System Description
This is a system description of the Description Logic reasoner FaCT++. The reasoner implements a tableaux decision procedure for the well known SHOIQ description logic, with additi...
Dmitry Tsarkov, Ian Horrocks
CADE
2006
Springer
14 years 11 months ago
On Keys and Functional Dependencies as First-Class Citizens in Description Logics
We investigate whether identification constraints such as keys and functional dependencies can be granted full status as a concept constructor in a Boolean-complete description log...
David Toman, Grant E. Weddell
CADE
2006
Springer
14 years 11 months ago
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
Brigitte Pientka
CADE
2006
Springer
14 years 11 months ago
Connection Tableaux with Lazy Paramodulation
It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tablea...
Andrey Paskevich
CADE
2006
Springer
14 years 11 months ago
Importing HOL into Isabelle/HOL
We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL-light a...
Steven Obua, Sebastian Skalberg