DMCA
The Propositional Formula Checker HeerHugo (1999)
Cached
Download Links
- [www.cwi.nl]
- [ftp.cwi.nl]
- [www.cwi.nl]
- [oai.cwi.nl]
- DBLP
Other Repositories/Bibliography
| Venue: | JOURNAL OF AUTOMATED REASONING |
| Citations: | 45 - 1 self |
BibTeX
@ARTICLE{Groote99thepropositional,
author = {J. F. Groote and J. P. Warners},
title = {The Propositional Formula Checker HeerHugo},
journal = {JOURNAL OF AUTOMATED REASONING},
year = {1999},
volume = {24},
pages = {261--281}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
HeerHugo is a propositional formula checker that determines whether a given formula is satisfiable or not. Its main ingredient is the branch/merge rule, that is inspired by an algorithm proposed by Stallmarck, which is protected by a software patent. The algorithm can be interpreted as a breadth first search algorithm. HeerHugo differs substantially from Stallmarck's algorithm, as it operates on formulas in conjunctive normal form and it is enhanced with many logical rules including unit resolution, 2-satisfiability tests and additional systematic reasoning techniques. In this paper, the main elements of the algorithm are discussed, and its remarkable effectiveness is illustrated with some examples and computational results.
Keyphrases
propositional formula checker heerhugo main element conjunctive normal form heerhugo differs 2-satisfiability test propositional formula checker computational result additional systematic reasoning technique main ingredient many logical rule branch merge rule remarkable effectiveness software patent search algorithm unit resolution
