LTUR: a simplified linear-time unit resolution algorithm for horn formulae and computer implementation

Information Processing Letters

Volumn 29, Issue 1, 1988, Pages 1-12

  Minoux, Michel ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Horn formula; Propositional calculus; unit resolution

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER METATHEORY--PROGRAMMING THEORY;

HORN FORMULAS; LINEAR-TIME UNIT RESOLUTION ALGORITHM; LOGIC PROGRAMMING; LTUR ALGORITHM; PROPOSITIONAL CALCULUS; SATISFIABILITY;

COMPUTER PROGRAMMING;

EID: 0024070968     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(88)90124-X     Document Type: Article

References (13)

1. The complexity of theorem-proving procedures
2. Linear time algorithms for testing the satisfiability of propositional Horn formulae
3. On the complexity of timetable and multicommodity flow problems
4. HORNLOG: a graph based interpreter for general Horn clauses
5. Algorithms for Testing the Satisfiability of Propositional Formulae
6. On the Complexity of Herbrand's Theorem
7. Complete problems for deterministic polynomial time
8. Reducibility among combinatorial problems
9. Suggested use of Horn relaxations in solving general satisfiability problems
10. Polynomial algorithms for finding deadlocks, traps and other substructures relevant to Petri net analysis
11. A switching algorithm for the solution of quadratic Boolean equations