HORNLOG: A graph-based interpreter for general Horn clauses

DOI10.1016/0743-1066(87)90015-XzbMath0641.68145MaRDI QIDQ3782842

Stan Raatz, Jean H. Gallier

Publication date: 1987

Published in: The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

graph rewritingHorn clausesinterpreterslogic-programming

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

On renamable Horn and generalized Horn functions, Uniform proofs as a foundation for logic programming, Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems, LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation, From LP to LP: Programming with constraints, Parsing as non-Horn deduction, Hornlog