A Generalization of Staalmarck's Method
| dc.contributor.author | Reps, Thomas | |
| dc.contributor.author | Thakur, Aditya | |
| dc.date.accessioned | 2012-04-02T19:58:02Z | |
| dc.date.available | 2012-04-02T19:58:02Z | |
| dc.date.issued | 2011-12 | |
| dc.description.abstract | 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. | en |
| dc.identifier.citation | TR1699 | en |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/60979 | |
| dc.publisher | University of Wisconsin-Madison Department of Computer Sciences | en |
| dc.subject | propositional logic | en |
| dc.subject | abstract interpretation | en |
| dc.subject | dilemma rule | en |
| dc.subject | validity checking | en |
| dc.title | A Generalization of Staalmarck's Method | en |
| dc.type | Technical Report | en |