58 search results - page 3 / 12 » Resolution Proof Systems with Weak Transformation Rules |
LOPSTR
1994
Springer
13 years 9 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
LATIN
2004
Springer
13 years 11 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
CONCUR
1995
Springer
13 years 9 months ago
1995
Springer
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
IFSA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The paper develops fuzzy attribute logic, i.e. a logic for reasoning about formulas of the form A ⇒ B where A and B are fuzzy sets of attributes. A formula A ⇒ B repr...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...