Sciweavers

4617 search results - page 547 / 924
» Automation of Diagrammatic Reasoning
Sort
View
191
Voted
CADE
2006
Springer
16 years 8 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
207
Voted
CADE
2006
Springer
16 years 8 months ago
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Abstract. The inverse method is a generalization of resolution that can be applied to non-classical logics. We have recently shown how Andreoli's focusing strategy can be adap...
Kaustuv Chaudhuri, Frank Pfenning, Greg Price
195
Voted
CADE
2006
Springer
16 years 8 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
204
Voted
CADE
2006
Springer
16 years 8 months ago
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
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...
Brigitte Pientka
178
Voted
CADE
2006
Springer
16 years 8 months ago
On Keys and Functional Dependencies as First-Class Citizens in Description Logics
We investigate whether identification constraints such as keys and functional dependencies can be granted full status as a concept constructor in a Boolean-complete description log...
David Toman, Grant E. Weddell