2585 search results - page 193 / 517 » Automating Coherent Logic |
134
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
144
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
We present sKizzo, a system designed to evaluate and certify Quantified Boolean Formulas (QBFs) by means of propositional skolemization and symbolic reasoning.
134
click to vote
CADE
2004
Springer
16 years 6 months ago
2004
Springer
We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant.
157
click to vote
LICS
2008
IEEE
16 years 28 days ago
2008
IEEE
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
196
click to vote
DLOG
1998
15 years 7 months ago
1998
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...