136 search results - page 4 / 28 » A Logical Framework with Explicit Conversions |
AMAI
2004
Springer
14 years 25 days ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
TACS
2001
Springer
13 years 12 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
TABLEAUX
1998
Springer
13 years 11 months ago
1998
Springer
We present a framework for eliminating redundancies during the reconstruction of sequent proofs from matrix proofs. We show that search-free proof reconstruction requires knowledge...
LICS
1995
IEEE
13 years 11 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
EUSFLAT
2009
13 years 5 months ago
2009
This paper presents a new framework to model an assessment process for a complex and multidimensional syndrome such as depression. Since the measurements of depression are inherent...