123 search results - page 5 / 25 » The Deduction Theorem for Strong Propositional Proof Systems |
109
Voted
EUROCAST
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Hybrid systems are a well-established mathematical model for embedded systems. Such systems, which combine discrete and continuous behavior, are increasingly used in safe...
CADE
1990
Springer
15 years 1 months 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...
APAL
1999
14 years 9 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
KBSE
1999
IEEE
15 years 1 months ago
1999
IEEE
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...