EUVIMEDEUVIMED entdecken
Crossref

Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base

Robert G. Jeroslow, Jinchang Wang

ORSA Journal on Computing · 1989

DOI: 10.1287/ijoc.1.1.7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ORSA Journal on Computing, 1989. Verfasst von Robert G. Jeroslow und 1 weiteren Autor:innen. Die Arbeit wurde bisher 19-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We show how the structure of proofs in a Horn clause knowledge base is completely described by certain of the extreme solutions to a suitable “dual” linear constraint set. The extreme points of this linear system are integer vectors, and give the count of the number of times that a given proposition is used in a proof of a “target” proposition. The “primal” to this dual provides the pointwise maximum vector which solves a set of dynamic programming recursions, and the latter recursions are derived from the Horn clause knowledge base. Variation in the facts or in the rules of the knowledge base corresponds to changes in only the criterion vector of the dual linear program. This linear programming approach to inference in expert systems also allows for the detection of “near proofs.” The latter are, by definition, proof structures which would become valid, if only exactly one more fact were known to be true. The first author, Robert G. Jeroslow, deceased August 31, 1988. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.

Zitieren

APA

Jeroslow, R. G., & Wang, J. (1989). Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base. ORSA Journal on Computing. https://doi.org/10.1287/ijoc.1.1.7

Vancouver

Jeroslow RG, Wang J. Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base. ORSA Journal on Computing. 1989. doi:10.1287/ijoc.1.1.7

BibTeX
@article{Jeroslow1989,
  author = {Jeroslow, Robert G. and Wang, Jinchang},
  title = {Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base},
  journal = {ORSA Journal on Computing},
  year = {1989},
  doi = {10.1287/ijoc.1.1.7}
}
Kostenlos starten →