Sciweavers

3552 search results - page 67 / 711
» Proof theory in the abstract
Sort
View
CADE
1998
Springer
15 years 10 months ago
A Combination of Nonstandard Analysis and Geometry Theorem Proving, with Application to Newton's Principia
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
Jacques D. Fleuriot, Lawrence C. Paulson
QCQC
1998
Springer
115views Communications» more  QCQC 1998»
15 years 10 months ago
Quantum Entanglement and the Communication Complexity of the Inner Product Function
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
Richard Cleve, Wim van Dam, Michael Nielsen, Alain...
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
15 years 10 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...
CONCUR
2006
Springer
15 years 10 months ago
Weak Bisimulation Up to Elaboration
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
Damien Pous
CSCLP
2006
Springer
15 years 10 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...