A Generalization of Staalmarck's Method

File(s)
Date
2011-12Author
Reps, Thomas
Thakur, Aditya
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Metadata
Show full item recordAbstract
This paper gives an account of Staalmarck's method for validity
checking of propositional-logic formulas, and explains each of the key components in terms of concepts from the field of abstract
interpretation. We then use these insights to present a framework for
propositional-logic validity-checking algorithms that is parametrized by an abstract domain and operations on that domain. Staalmarck's method is one instantiation of the framework; other instantiations
lead to new decision procedures for propositional logic.
Subject
propositional logic
abstract interpretation
dilemma rule
validity checking
Permanent Link
http://digital.library.wisc.edu/1793/60979Type
Technical Report
Citation
TR1699