Sciweavers

290 search results - page 39 / 58
» Theorem Proving Using Lazy Proof Explication
Sort
View
CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 9 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
AI
2000
Springer
14 years 9 months ago
Boolean connection algebras: A new approach to the Region-Connection Calculus
The Region-Connection Calculus (RCC) is a well established formal system for qualitative spatial reasoning. It provides an axiomatization of space which takes regions as primitive...
John G. Stell
LICS
2012
IEEE
12 years 12 months ago
Logics of Dynamical Systems
—We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the s...
André Platzer
CADE
2001
Springer
15 years 9 months ago
Incremental Closure of Free Variable Tableaux
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
Martin Giese
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
15 years 3 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar