450 search results - page 35 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
AISC
1998
Springer
13 years 11 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
FMCAD
2007
Springer
14 years 1 months ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...