226 search results - page 36 / 46 » BDDs and Automated Deduction |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
TPHOL
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
ISTA
2004
13 years 9 months ago
2004
Abstract: This paper presents the evidential paradigm of computer-supported mathematical assistance in "doing" mathematics and in reasoning activity. At present, the evid...
KRDB
2003
13 years 9 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
We propose a setting in which the search for a proof of B or a refutation of B (a proof of ¬B) can be carried out simultaneously: this is in contrast to the usual approach in aut...