183 search results - page 27 / 37 » Automated theorem proving by resolution in non-classical log... |
CADE
2004
Springer
15 years 12 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
125
Voted
PEPM
2010
ACM
15 years 1 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
92
Voted
CADE
2005
Springer
15 years 12 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
ALP
1990
Springer
15 years 3 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
90
Voted
COLING
2002
14 years 11 months ago
2002
We present an architecture for spoken dialogue systems where first-order inference (both theorem proving and model building) plays a crucial role in interpreting utterances of dia...