121 search results - page 3 / 25 » Elimination of Negation in a Logical Framework |
IS
2006
13 years 5 months ago
2006
Abstract. Terms which are not explicitly mentioned in the text of a document receive often a minor role in current retrieval systems. In this work we connect the management of such...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
ACL
1989
13 years 7 months ago
1989
Feature structures are informational elements that have been used in several linguistic theories and in computational systems for natural-language processing. A logicaJ calculus h...
CADE
2006
Springer
14 years 6 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...
FTP
1998
Springer
13 years 10 months ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...