MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  1 2LP: Linear Programming and Logic Programming

Download:
pdf | ps
by Ken Mcaloon, Carol Tretkoff
http://www.sci.brooklyn.cuny.edu/~lbslab/ftp/doc/ppcp93.ps
Add To MetaCart

Abstract:

The 2LP system is a step in the "Operatica Program, " a project whose grand design is to provide an elegant and powerful programming language environment for combining AI and OR methods for decision support software systems. The term "Operatica " was coined by J.L. Lassez to suggest an analogy with the Mathematica system which provides a programming environment for symbolic mathematical computation. In the dialogue between AI and OR, there are two basic themes: (1) declarative programming and the notion of logical consequence and, (2) procedural programming and the search algorithm in its many variations. Integrating AI and OR requires an environment that combines a modeling language with a logic based language. 2LP, which stands for "linear programming and logic programming, " has the simplex based search mechanism of linear programming and the backtracking mechanism of logic programming built in. 2LP is both an algebraic modeling language and a logical control language. By bringing these techniques together in a language which has standard C style syntax and treats the mathematical module in an object-oriented way, this technology provides very powerful and usable tools for decision support programming. The design decisions that led to 2LP were based on the following considerations:. For run time efficiency the system should enforce a restriction to linear constraints at compile time.. The array rather than the linked-list is the natural data structure for mathematical modeling.. Communication between the logic and the numerical solver should be primitive to the language.. A small language with standard syntax and with explicit integration of procedural programming constructs would be accessible to decision support programmers.. The power of constraint programming is such that a compact language is sufficient for the intended applications.. The system should be callable as a set of library routines.. Hooks for expandability to an or-parallel system should be built in to the system. In this paper, after discussing the relationship of 2LP to other programming paradigms and introducing some

Citations

448 An abstract Prolog instruction set – Warren
243 AMPL: A Modeling Language for – Fourer, Gay, et al. - 1993
125 Combinatorial Algorithms: Theory and Practice – Reingold, Nievergelt - 1977
85 Methodology and implementation of a CLP system – Jaffar, Michaylov - 1987
51 Some Results and Experiments in Programming Techniques for Propositional Logic – Blair, Jeroslow, et al. - 1986
38 The birth of prolog – Colmerauer, Roussel - 1993
19 Input proofs and rank one cutting planes – Hooker - 1989
17 Functional description of MINTO, a Mixed INTeger Optimizer – Savelsbergh, Nemhauser - 1996
16 Logic-based Decision Support; Mixed Integer Model Formulation – Jeroslow - 1989
13 Integer Programming vs. Expert Systems� An Experimental Comparison – Dhar� - 1990
12 Computational Complexity and Constraint Logic Programming – Cox, McAloon, et al. - 1992
10 Implementing deductive databases by linear programming – Bell, Nerode, et al. - 1992
5 A Parallelization of the Constraint Logic Programming Language 2LP – Atay - 1992
4 2LP: A Highly Parallel Constraint Logic Programming Language – Atay, McAloon, et al. - 1993
4 Dynamic programming, integral polyhedra and Horn clause knowledge base – Jeroslow, Wang - 1989
3 Logic and Optimization – McAloon, Tretkoff - 1995
1 A new translation for deduction into integer programming, submitted for publication – Hahnle
1 From logic programming to lazy programming, manuscript – Lassez
1 Subrecursive constraint logic programming – McAloon, Tretkoff
1 AI/OR Modeling in 2lp – McAloon, Tretkoff