Anticipatory pruning networks and minimal 2LP (linear programming and logic programming).

Title: Anticipatory pruning networks and minimal 2LP (linear programming and logic programming).
Identifier: AAI9119641
identifier: 9119641
Creator: Jo, Geun-Sik.
Contributor: Adviser: Kenneth McAloon
Date: 1991
Language: English
Publisher: City University of New York.
Subject: Computer Science
Abstract: In this thesis, the notion of the Anticipatory Pruning Network (APN) is introduced and developed for the 2LP system; 2LP (Linear Programming and Logic Programming) is a constraint logic programming system which has been developed and implemented at the Logic Based System Lab at Brooklyn College/CUNY. Using compilation of rules in the style of the Rete algorithm, the APN maps program clauses into a network. The APN prunes a search space by consistency checking and inconsistency propagation through the network and resets itself upon backtracking. The APN extends forward checking to continous constraint domains. Overall, the benchmarks show the APN to be an effective forward checking mechanism for both discrete and continuous problem domains for Simplex based constraint solvers. In particular, the APN is an effective pruning method for constrained optimization problems.
Type: dissertation
Source: PQT Legacy CUNY.xlsx
degree: Ph.D.

Media: Anticipatory pruning networks and minimal 2LP (linear programming and logic programming).