AGP
1996
IEEE
13 years 12 months ago
1996
IEEE
ICAIL
1997
ACM
13 years 12 months ago
1997
ACM
ICAIL
1997
ACM
13 years 12 months ago
1997
ACM
ICAIL
1997
ACM
13 years 12 months ago
1997
ACM
The capacity for self-explanation can makecomputer-drafted documents more credible, assist in the retrieval and adaptation of archival documents, and permit comparison of document...
ICAIL
1997
ACM
13 years 12 months ago
1997
ACM
WIA
1998
Springer
13 years 12 months ago
1998
Springer
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
WIA
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
TABLEAUX
1998
Springer
13 years 12 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...
TABLEAUX
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Set theory is the common language of mathematics. Therefore, set theory plays an important r^ole in many important applications of automated deduction. In this paper, we ...
TABLEAUX
1998
Springer
13 years 12 months ago
1998
Springer
The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for ...