- Meltzer, B. (1971) Prolegomena to a Theory of Efficiency of Proof Procedures.
Artificial Intelligence and Heuristic Programming, pp. 15--33 (eds, Meltzer, B. and Findler, N. V.). Edinburgh University Press.Google Scholar
Index Terms
- There is no best proof procedure
Recommendations
From model checking to a temporal proof
SPIN '01: Proceedings of the 8th international SPIN workshop on Model checking of softwareModel checking is used to automatically verify temporal properties of finite state systems. It is usually considered to be `sucessful', when an error, in the form of a counterexample to the checked property, is found. We present the dual approach, where,...
Catching the best views of skyline: a semantic approach based on decisive subspaces
VLDB '05: Proceedings of the 31st international conference on Very large data basesThe skyline operator is important for multi-criteria decision making applications. Although many recent studies developed efficient methods to compute skyline objects in a specific space, the fundamental problem on the semantics of skylines remains open:...
Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure
We present an abstraction refinement algorithm for model checking of safety properties that relies exclusively on a SAT solver for checking the abstract model, testing abstract counterexamples on the concrete model, and refinement. Model checking of the ...
Comments