Inference flexibility in Horn clause knowledge bases and the simplex method

DOI10.1007/BF00881908zbMath0802.68147OpenAlexW1971731520MaRDI QIDQ1319393

Jinchang Wang

Publication date: 12 April 1994

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00881908

zbMATH Keywords

linear programminginferenceforward chainingHorn clause

Mathematics Subject Classification ID

Linear programming (90C05) Knowledge representation (68T30) Mechanization of proofs and logical operations (03B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive characterizations of the value-function of a mixed-integer program. I
• Complete problems in the first-order predicate calculus
• Computing circumscriptive databases
• Solving propositional satisfiability problems
• Gainfree Leontief substitution flow problems
• Extreme points of Leontief substitution systems
• Experimental Results on the New Techniques for Integer Programming Formulations
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Column Generation Methods for Probabilistic Logic
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• A Computing Procedure for Quantification Theory