Sciweavers

1410 search results - page 184 / 282
» Proving theorems by reuse
Sort
View
AMC
2006
79views more  AMC 2006»
13 years 10 months ago
Church's thesis meets the N-body problem
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
Warren D. Smith
ENTCS
2008
103views more  ENTCS 2008»
13 years 10 months ago
Systematic Semantic Tableaux for PLTL
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
ENTCS
2008
116views more  ENTCS 2008»
13 years 10 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 10 months ago
Symmetric Subresultants and Applications
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
Cyril Brunie, Philippe Saux Picart
ECEASST
2006
114views more  ECEASST 2006»
13 years 10 months ago
Semantic Issues of OCL: Past, Present, and Future
We report on the results of a long-term project to formalize the semantics of OCL 2.0 in Higher-order Logic (HOL). The ultimate goal of the project is to provide a formalized, mach...
Achim D. Brucker, Jürgen Doser, Burkhart Wolf...