438 search results - page 20 / 88 » On theorem proving in annotated logics |
DAC
2003
ACM
14 years 9 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
CADE
1990
Springer
14 years 20 days ago
1990
Springer
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today's automated theorem pro...
CADE
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
JAR
2002
13 years 8 months ago
2002
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
ECCC
2010
13 years 7 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...