884 search results - page 3 / 177 » A Proof Theory for DL-Lite |
TPHOL
1996
IEEE
15 years 1 months ago
1996
IEEE
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
CADE
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...
96
Voted
CADE
2000
Springer
15 years 1 months ago
2000
Springer
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...