A maximal-literal unit strategy for horn clauses

Nachum Dershowitz*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

A new positive-unit theorem-proving procedure for equational Horn clauses is presented. It uses a term ordering to restrict paramodulation to potentially maximal sides of equations. Completeness is shown using proof orderings.

Original languageEnglish
Title of host publicationConditional and Typed Rewriting Systems - 2nd International CTRS Workshop, Proceedings
EditorsStephane Kaplan, Mitsuhiro Okada
PublisherSpringer Verlag
Pages14-25
Number of pages12
ISBN (Print)9783540543176
DOIs
StatePublished - 1991
Externally publishedYes
Event2nd International Workshop on Conditional and Typed Rewriting Systems, CTRS 1990 - Montreal, Canada
Duration: 11 Jun 199014 Jun 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume516 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Workshop on Conditional and Typed Rewriting Systems, CTRS 1990
Country/TerritoryCanada
CityMontreal
Period11/06/9014/06/90

Funding

FundersFunder number
National Science FoundationCGR-9007195

    Fingerprint

    Dive into the research topics of 'A maximal-literal unit strategy for horn clauses'. Together they form a unique fingerprint.

    Cite this