2152 search results - page 239 / 431 » On Automating the Calculus of Relations |
146
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refuta...
147
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
146
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
179
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
168
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...