3228 search results - page 202 / 646 » Computationally Sound Proofs |
203
click to vote
TIME
2007
IEEE
16 years 25 days ago
2007
IEEE
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
152
click to vote
CPM
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...
178
click to vote
TPHOL
2002
IEEE
15 years 11 months ago
2002
IEEE
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detai...
133
click to vote
ISSAC
1994
Springer
15 years 10 months ago
1994
Springer
After four years of experience with the nonassociative algebra program Albert, we highlight its successes and drawbacks. Among its successes are the discovery of several new resul...
132
click to vote
DCG
2008
15 years 6 months ago
2008
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...