37 search results - page 1 / 8 » Weak Equivalence in Propositional Calculus |
ESSLLI
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
92
Voted
ICALP
1998
Springer
15 years 3 months ago
1998
Springer
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
APAL
2006
14 years 11 months ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
ICALP
1998
Springer
15 years 3 months ago
1998
Springer
99
Voted
SLOGICA
2010
14 years 5 months ago
2010
In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the...