Sciweavers

1996 search results - page 12 / 400
» A decision procedure for linear
Sort
View
LPAR
2004
Springer
15 years 3 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
IGPL
2000
152views more  IGPL 2000»
14 years 10 months ago
An Analysis of Empirical Testing for Modal Decision Procedures
Recent years have seen the emergence of a new generation of heavily-optimised modal decision procedures. Several systems based on such procedures are now available and have proved...
Ian Horrocks, Peter F. Patel-Schneider, Roberto Se...
JELIA
2004
Springer
15 years 3 months ago
Combining Decision Procedures for Sorted Theories
The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to ...
Cesare Tinelli, Calogero G. Zarba
CADE
2007
Springer
15 years 10 months ago
An Incremental Technique for Automata-Based Decision Procedures
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
David Toman, Gulay Ünel
CADE
2002
Springer
15 years 10 months ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar