Sciweavers

233 search results - page 3 / 47
» Applications of Polytypism in Theorem Proving
Sort
View
GG
2008
Springer
13 years 8 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
EPIA
1999
Springer
13 years 11 months ago
Critical Agents Supporting Interactive Theorem Proving
We introduce a resource adaptive agent mechanism which supports the user of an interactive theorem proving system. The mechanism, an extension of 5 , uses a two layered architectur...
Christoph Benzmüller, Volker Sorge
FM
1999
Springer
161views Formal Methods» more  FM 1999»
13 years 11 months ago
Combining Theorem Proving and Continuous Models in Synchronous Design
Support for system speci cation in terms of modelling and simulation environments has become a common practice in safety-critical applications. Also, a current trend is the automat...
Simin Nadjm-Tehrani, Ove Åkerlund
TPHOL
1999
IEEE
13 years 11 months ago
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
CADE
2009
Springer
14 years 8 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning