Sciweavers

1128 search results - page 24 / 226
» Classical Natural Deduction
Sort
View
FOSSACS
2005
Springer
14 years 3 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
CICLING
2003
Springer
14 years 3 months ago
Experiments with Linguistic Categories for Language Model Optimization
In this work1 we obtain robust category-based language models to be integrated into speech recognition systems. Deductive rules are used to select linguistic categories and to matc...
Arantza Casillas, Amparo Varona, Inés Torre...
LACL
1998
Springer
14 years 1 months ago
Lambek Calculus Proofs and Tree Automata
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
Hans-Jörg Tiede
JAR
2007
123views more  JAR 2007»
13 years 9 months ago
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
Alberto Ciaffaglione, Luigi Liquori, Marino Micula...
AAAI
1996
13 years 11 months ago
A Connectionist Framework for Reasoning: Reasoning with Examples
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...
Dan Roth