Forward chaining is simple(x)

DOI10.1016/S0167-6377(99)00055-3MaRDI QIDQ1970424zbMATH OpenOpenAlexWikidataFDO

Authors Julián Aráoz

Publication date 21 March 2000

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6377(99)00055-3

zbMATH Keywords

Analysis of algorithmsknowledge basessimplex

Mathematics Subject Classification ID

Hypergraphs (05C65) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• The achievement of knowledge bases by cycle search.
• Exact knowledge compilation in predicate calculus: the partial achievement case
• Inference flexibility in Horn clause knowledge bases and the simplex method
• Forward chaining for hybrid ASP
• A kind of logical compilation for knowledge bases

Cites work

• scientific article; zbMATH DE number 4094876 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• On sentences which are true of direct unions of algebras

Cited in

(5)

• Finding optimal derivation strategies in redundant knowledge bases
• Inference flexibility in Horn clause knowledge bases and the simplex method
• Partially dynamic maintenance of minimum weight hyperpaths
• The achievement of knowledge bases by cycle search.
• Forward chaining for hybrid ASP

This page was built for publication: Forward chaining is simple\((x)\)

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