2303 search results - page 214 / 461 » On the logic of argumentation theory |
146
Voted
CSL
2001
Springer
15 years 11 months ago
2001
Springer
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including l...
160
click to vote
CADE
1999
Springer
15 years 11 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
167
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
181
click to vote
CADE
2004
Springer
16 years 14 hour ago
2004
Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
183
click to vote
IJAC
2010
15 years 3 months ago
2010
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...