Sciweavers

Share
CORR
2007
Springer
96views Education» more  CORR 2007»
8 years 3 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
AICOM
2010
129views more  AICOM 2010»
8 years 3 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ý
CADE
2010
Springer
8 years 4 months ago
Premise Selection in the Naproche System
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...
Marcos Cramer, Peter Koepke, Daniel Kühlwein,...
CADE
2008
Springer
8 years 5 months ago
LogAnswer - A Deduction-Based Question Answering System (System Description)
LogAnswer is an open domain question answering system which employs an automated theorem prover to infer correct replies to natural language questions. For this purpose LogAnswer o...
Ulrich Furbach, Ingo Glöckner, Hermann Helbig...
AISC
2006
Springer
8 years 7 months ago
A Search Engine for Mathematical Formulae
We present a search engine for mathematical formulae. The MathWebSearch system harvests the web for content representations (currently MathML and OpenMath) of formulae and indexes ...
Michael Kohlhase, Ioan Sucan
AISC
2010
Springer
8 years 8 months ago
Formal Proof of SCHUR Conjugate Function
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
Franck Butelle, Florent Hivert, Micaela Mayero, Fr...
TABLEAUX
2005
Springer
8 years 9 months ago
Proof Output and Transformation for Disconnection Tableaux
For applications of first-order automated theorem provers in a wider verification context it is essential to provide a means of presenting and checking automatically found proofs...
Philipp Correll, Gernot Stenz
SARA
2007
Springer
8 years 9 months ago
Extensional Reasoning
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
Timothy L. Hinrichs
DIS
2007
Springer
8 years 9 months ago
Computational Discovery in Pure Mathematics
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
Simon Colton
books