Sciweavers

1322 search results - page 77 / 265
» Unsound Theorem Proving
Sort
View
CADE
1990
Springer
13 years 11 months ago
Presenting Intuitive Deductions via Symmetric Simplification
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...
Frank Pfenning, Dan Nesmith
CSL
2004
Springer
13 years 11 months ago
Towards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
Tjark Weber
CSL
2010
Springer
13 years 8 months ago
Formal Theories for Linear Algebra
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
Stephen Cook, Lila Fontes
ENTCS
2002
82views more  ENTCS 2002»
13 years 7 months ago
A Hybrid Encoding of Howe's Method for Establishing Congruence of Bisimilarity
We give a short description of Hybrid, a new tool for interactive theorem proving, s introduced in [4]. It provides a form of Higher Order Abstract Syntax (HOAS) combined consiste...
Alberto Momigliano, Simon Ambler, Roy L. Crole
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