Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
From MaRDI portal
Publication:4018150
DOI10.1287/ijoc.1.1.7zbMath0753.90069OpenAlexW2152512857MaRDI QIDQ4018150
Jinchang Wang, Robert G. Jeroslow
Publication date: 16 January 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1.1.7
Linear programming (90C05) Combinatorial optimization (90C27) Dynamic programming (90C39) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Classical propositional logic (03B05)
Related Items
Characterizing consistency in probabilistic logic for a class of Horn clauses, The problem of asking the minimum number of questions in Horn clause systems, Question-asking strategies for Horn clause systems, A cost effective question-asking strategy for Horn clause systems, Max Horn SAT and the minimum cut problem in directed hypergraphs, Facets of the Stochastic Network Flow Problem, Sensitivity analysis for Horn formulae, Deriving conclusions in expert systems when knowledge is incomplete, Gainfree Leontief substitution flow problems, Inference flexibility in Horn clause knowledge bases and the simplex method
