1894 search results - page 70 / 379 » A TLA Proof System |
96
Voted
AAAI
2010
15 years 2 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
106
Voted
AML
2006
15 years 23 days ago
2006
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
GD
2007
Springer
15 years 6 months ago
2007
Springer
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...
89
Voted
FMCAD
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Transformation-based verification has been proposed to synergistically leverage various transformations to successively simplify and decompose large problems to ones whic...
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...