Forward chaining is simple(x)

Authors:
JuliáN AráOz
Affiliations:
Universidad Simón Bolıvar, Res. El Aleph, 2-A, Av. Los Samanes, La Florida, Caracas 1050, Venezuela
Venue:
Operations Research Letters
Year:
2000

Citing 2
Cited 1

Computation-oriented reductions of predicate to propositional logic

Decision Support Systems
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation

Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that Forward Chaining in Horn Systems is merely the Simplex Algorithm, although they look completely different. This difference is similar to the one between the Simplex and Transportation Algorithms, in that the latter takes advantage of special structure in the problem. We further show that Backward Chaining is the same as the Dual Simplex Algorithm.