Abstract
A new resolution strategy for Horn sets of clauses, each clause of which contains no more-than one positive literal, is presented which requires. that in each resolution eitner one ancestor be a false positive unit or that one ancestor and the resolvent both be false. This strategy emphasizes “relevant” positive units while controlling the explosive nonunit resolution. Some properties of interpretations for Horn sets are reviewed and used to significantly reduce the computation and storage required to implement semantic resolution for Horn sets.
Original language | English (US) |
---|---|
Pages (from-to) | 816-822 |
Number of pages | 7 |
Journal | IEEE Transactions on Computers |
Volume | C-25 |
Issue number | 8 |
DOIs | |
State | Published - Aug 1976 |
Keywords
- Horn sets
- interpretations
- models
- resolution
- semantic
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics