Semantic Resolution for Horn Sets

Lawrence Joseph Henschen*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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 languageEnglish (US)
Pages (from-to)816-822
Number of pages7
JournalIEEE Transactions on Computers
VolumeC-25
Issue number8
DOIs
StatePublished - Jan 1 1976

Keywords

  • Horn sets
  • interpretations
  • models
  • resolution
  • semantic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Semantic Resolution for Horn Sets'. Together they form a unique fingerprint.

Cite this