Sciweavers

182 search results - page 24 / 37
» A Theory of Strict P-completeness
Sort
View
EJC
2010
14 years 9 months ago
On the infinitesimal rigidity of weakly convex polyhedra
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
Robert Connelly, Jean-Marc Schlenker
NIL
1991
15 years 1 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
CSL
2010
Springer
14 years 10 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
KBSE
1997
IEEE
15 years 1 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell
ICCAD
1995
IEEE
68views Hardware» more  ICCAD 1995»
15 years 1 months ago
Generating sparse partial inductance matrices with guaranteed stability
This paper proposes a definition of magnetic vector potential that can be used to evaluate sparse partial inductance matrices. Unlike the commonly applied procedure of discarding...
Byron Krauter, Lawrence T. Pileggi