Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
From MaRDI portal
Publication:4018150
Recommendations
- Dynamic programming and d-graphs
- Polyhedral Characterization of Discrete Dynamic Programming
- Implementing Courcelle's theorem in a declarative framework for dynamic programming
- A combinatorial algorithm for Horn programs
- A combinatorial algorithm for Horn programs
- Disjunctive programming and relaxations of polyhedra
- scientific article; zbMATH DE number 1615255
- Modelling dynamic programming problems by generalized d-graphs
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Polyhedral proof methods in combinatorial optimization
Cited in
(14)- Sensitivity analysis for Horn formulae
- Deriving conclusions in expert systems when knowledge is incomplete
- Inference flexibility in Horn clause knowledge bases and the simplex method
- 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
- Gainfree Leontief substitution flow problems
- Deductive inference for the interiors and exteriors of Horn theories
- Deductive Inference for the Interiors and Exteriors of Horn Theories
- scientific article; zbMATH DE number 4094876 (Why is no real title available?)
- scientific article; zbMATH DE number 408798 (Why is no real title available?)
- Facets of the stochastic network flow problem
This page was built for publication: Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018150)