103 search results - page 11 / 21 » Proof Systems for Effectively Propositional Logic |
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a logic for reasoning both about the ability of agents to cooperate to execute complex actions, and how this relates to their ability to reach certain states of affairs...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
FSS
2006
13 years 7 months ago
2006
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
27
Voted
CADE
2001
Springer
14 years 7 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
CADE
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...