8 search results - page 1 / 2 » Deleting Redundancy in Proof Reconstruction |
TABLEAUX
1998
Springer
13 years 8 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...
ENTCS
2008
13 years 4 months ago
2008
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
CADE
2006
Springer
14 years 4 months ago
2006
Springer
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...
KDD
2005
ACM
13 years 9 months ago
2005
ACM
We propose a new text mining system which extracts characteristic contents from given documents. We define Key semantics as characteristic sub-structures of syntactic dependencie...
VL
2009
IEEE
13 years 11 months ago
2009
IEEE
Spreadsheets can be viewed as a highly flexible endusers programming environment which enjoys wide-spread adoption. But spreadsheets lack many of the structured programming conce...