Sciweavers

4 search results - page 1 / 1
» Improving the Performance of Automated Theorem Provers by Re...
Sort
View
CORR
2007
Springer
96views Education» more  CORR 2007»
13 years 4 months ago
Edit and verify
Abstract. Automated theorem provers are used in extended static checking, where they are the performance bottleneck. Extended static checkers are run typically after incremental ch...
Radu Grigore, Michal Moskal
CADE
2008
Springer
14 years 5 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten
BIRTHDAY
2010
Springer
13 years 5 months ago
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
Christoph Benzmüller