Sciweavers

33 search results - page 4 / 7
» First-Order Theorem Proving and Vampire
Sort
View
AICOM
2010
129views more  AICOM 2010»
13 years 7 months ago
Automated theorem proving in quasigroup and loop theory
We survey all known results in the area of quasigroup and loop theory to have been obtained with the assistance of automated theorem provers. We provide both informal and formal d...
J. D. Phillips, David Stanovský
SYNTHESE
2010
95views more  SYNTHESE 2010»
13 years 5 months ago
Ranking judgments in Arrow's setting
In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit (Synthese 140(1–2):2...
Daniele Porello
IJAIT
2006
106views more  IJAIT 2006»
13 years 7 months ago
An Empirical Evaluation of Automated Theorem Provers in Software Certification
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
Ewen Denney, Bernd Fischer 0002, Johann Schumann
CADE
2010
Springer
13 years 8 months ago
Sledgehammer: Judgement Day
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
Sascha Böhme, Tobias Nipkow
AML
2000
101views more  AML 2000»
13 years 7 months ago
Local order property in nonelementary classes
We study a local version of the order property in several frameworks, with an emphasis on frameworks where the compactness theorem fails: (1) Inside a fixed model, (2) for classes ...
Rami P. Grossberg, Olivier Lessmann