Sciweavers

1302 search results - page 34 / 261
» Free-Style Theorem Proving
Sort
View
DLOG
2010
13 years 5 months ago
Paraconsistent Description Logics Revisited
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
Norihiro Kamide
CORR
2011
Springer
137views Education» more  CORR 2011»
13 years 2 months ago
An improvement of the Moser-Tardos algorithmic local lemma
A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics extends the Lov´asz Local Lemma by weakening the conditions under w...
Wesley Pegden
CADE
2012
Springer
11 years 10 months ago
Rewriting Induction + Linear Arithmetic = Decision Procedure
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...
Stephan Falke, Deepak Kapur
PLDI
2003
ACM
14 years 29 days ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
MLQ
2010
148views more  MLQ 2010»
13 years 6 months ago
Abelian groups and quadratic residues in weak arithmetic
We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for...
Emil Jerábek