438 search results - page 69 / 88 » On theorem proving in annotated logics |
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
CP
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
94
Voted
CADE
2009
Springer
15 years 10 months ago
2009
Springer
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The verification of device drivers is essential for the pervasive verification of an operating system. To show the correctness of device drivers, devices have to be forma...