HORNLOG: A graph-based interpreter for general Horn clauses

DOI10.1016/0743-1066(87)90015-XMaRDI QIDQ3782842zbMATH OpenFDO

Authors Jean Gallier, Stan Raatz

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0743-1066(87)90015-X

zbMATH Keywords

Horn clausesgraph rewritinginterpreterslogic-programming

Mathematics Subject Classification ID

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

Recommendations

• Graph-based proof procedures for horn clauses
• scientific article; zbMATH DE number 4092826
• Interval-valued probabilistic logic for a class of Horn clauses
• Higher-order Horn clauses
• Negation as inconsistency. I

Cited in

(14)

• Parsing as non-Horn deduction
• Translating propositional extended conjunctions of Horn clauses into Boolean circuits
• Clausal intuitionistic logic I. fixed-point semantics
• On renamable Horn and generalized Horn functions
• Autark assignments of Horn CNFs
• scientific article; zbMATH DE number 3978424 (Why is no real title available?)
• From LP to LP: Programming with constraints
• Uniform proofs as a foundation for logic programming
• Hornlog
• Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
• scientific article; zbMATH DE number 3921956 (Why is no real title available?)
• LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
• A new combination of input and unit deductions for Horn sentences
• Horn clauses as an intermediate representation for program analysis and transformation

This page was built for publication: HORNLOG: A graph-based interpreter for general Horn clauses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3782842)