K. McAloon & C. Tretkoff, 2LP: A Logic Programming and Linear Programming System, Brooklyn College Computer Science Technical Report No 1989-21, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Adding Constraints to Logic-based Formalisms - Maher (1999) (Correct)
....that constraints have been added to formalisms that are not logical in nature. Language libraries such as Solver [18] embed constraint solving in non logical programming languages. Similarly, rule systems have been extended with constraints [31] Other constraint programming languages, like 2LP [33], are not presented in logical terms. In these cases, although the formalism itself is not logical, it seems that the ways in which the constraints are used remain logical [46] although it is not clear if it will remain so. There has also been incorporation of constraints in formalisms that ....
K. McAloon & C. Tretkoff, 2LP: A Logic Programming and Linear Programming System, Brooklyn College Computer Science Technical Report No 1989-21, 1989.
Constraint Logic Programming: A Survey - Jaffar, Maher (1994) (359 citations) (Correct)
....are used in control. All constructs of the language are based on augmented rewrite rules, and the programmer adds rules for the specific constraint solving algorithm to be implemented. Post CLP, there have been a number of works which are able to deal with dynamic constraints. The language 2LP [170] is described to be a CLP language with a C like syntax for representing and solving combinatorial problems. Obtaining parallel execution is one of the main objectives of this work. The commercial language CHARME, also based on a procedural framework, arose from the work on CHIP (by essentially ....
....algebra, finite domains, and arithmetic over the real numbers. In contrast to other CLP languages over arithmetic domains it computes solutions numerically, instead of symbolically. Trilogy [256, 257] computes over strings, integers and real numbers. Although its syntax is closer to that of C, 2LP [170] can be considered to be a CLP language permitting only a subset of Horn clauses. It computes with linear constraints over integers and real numbers. CAL [4] computes over two domains: the real numbers, where constraints are equations between polynomials and a Boolean algebra with symbolic ....
K. McAloon & C. Tretkoff, 2LP: A Logic Programming and Linear Programming System, Brooklyn College Computer Science Technical Report No 1989-21, 1989.
Semantics of Constraint Logic Programs with Optimization - Marriott, Stuckey (1993) (7 citations) (Correct)
....semantics is related to that proposed by Naish [17] for negation and aggregation, in that optimization subgoals must delay until their global variables have a fixed value. Using the current best optimum to prune the search space is related to the operational semantics of optimization in 2LP [16] and CHIP s minimize(G,M) predicate [3] Our proofs are based on expressing optimization in terms of negation. We emphasize that although negation is used to formalize optimization, the replacement of minimization with negation does not lead to an operationally feasible approach to minimization ....
McAloon, K. and Tretkoff, C. 2LP: A logic programming and linear programming system. Brooklyn College of CUNY, CIS department, Technical Report No. 1989-21, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC