Siskind, J.M., McAllester, D.A.: Nondeterministic lisp as a substrate for constraint logic programming. In Fikes, R., Lehnert, W., eds.: Proceedings of the Eleventh National Conference on Artificial Intelligence, Menlo Park, California, AAAI Press (1993) 12  Home/Search   Document Details and Download   Summary   Related Articles   Check

....that all the given constraints are satisfied. In other words one has to choose such components that the resulted artefact will achieve requested functionality and satisfy all the given constraints of various nature. CSE is built on top of a non deterministic COMMON LISP extension called SCREAMER [7] which was originally developed at the M.I.T. Artificial Intelligence Laboratory. Using the CSE constraint satisfaction problems can be easily formulated and solved using SCREAMER without bothering about the SCREAMER syntax. Moreover, new search strategies have been added to give the user enhanced ....

....CSE The Constraint satisfaction engine enables it to describe a task as a constraint satisfaction problem and use specialised constraint solving techniques to solve the problem. Constraint satisfaction is implemented in SCREAMER by a combination of constraint propagation and backtracking search [7]. Constraint propagation and backtracking search run automatically in an interleaved opportunistic fashion. The main advantage of the Constraint Satisfaction Engine is its declarative nature. The user simply (1) creates variables, 2) asserts constraints between them and (3) chooses the search ....

Siskind J.M., McAllester D.A., 1994, Non-deterministic Lisp as a Substrate for Constraint Logic Programming, Technical Report, University of Pennsylvania

....with the ENCODE kernel [4] a control part administering the use of specialised solving modules. 3. CONSTRAINT SATISFACTION MODULE OF THE ENCODE WORKBENCH Screamer is an efficient implementation of a non deterministic Lisp as a fully portable extension of Common Lisp. In the form described in [6] it can be seen as a comprehensive constraint based programming language as an extension of Common Lisp. The Screamer includes the function make variable which returns a data structure called variable which is a generalisation of a Prolog logic variable. Screamer provides a variety of constraint ....

....are not only numeric, Boolean and type constraints, but also expression equalv and functionsfuncallv and applyv. This constraint package provides a unified framework for solving both numeric and non numeric systems of constraints using a combination of five kinds of constraint propagations [6]: binding propagation, Boolean constraint propagation, generalised forward checking, propagation of bounds and unification. By design, all of the constraint primitives described use only fast local propagation techniques. Such techniques are necessarily incomplete; they cannot always solve ....

Siskind, J.M. - McAllester, D.A.: Non-deterministic Lisp as a Substrate for Constraint Logic Programming. Technical Report, University of Pennsylvania, 1994.

....language, Lisp ) Screamer is an extension to Common Lisp that permits the addition of backtracking and constraint solving to the language. However there seems to have been no theoretical basis provided for this language. It was developed by David McAllester and Je rey Mark Siskind (see [11]) and was one of the major in uences for this work. The Constrained Lambda Calculus by Luis Mandel is a combination of the untyped lambda calculus with constraints. It is described in [8, 2, 10, 3] and [9] There are three variants of this calculus: A simple propositional calculus, the rst order ....

David McAllester and Jerey Mark Siskind. Nondeterministic Lisp as a substrate for constraint logic programming. In Proceedings AAAI, pages 133-138, July 1993.

.... [22 30] Finally, a third type of model consists in distinguishing the concept of a generic constraint (a relation represented, for example, by a class in an object oriented language) and the concept of an instance of the constraint applied to specific variables of the problem to solve [31 35] . The main advantage of this type of model is that it allows the user to define very precisely the constraints of the problem on the one hand, and to implement the most appropriate problem solving strategy on the other hand. In addition, it permits the close integration of constraint based ....

SISKIND, J., and MCALLESTER D.: 'Non deterministic Lisp as a substrate for Constraint Logic Programming'. Proceedings of the Eleventh National Conference on Artificial Intelligence, Washington, District of Columbia, 1993.

....specialising in resource optimisation systems. 2 JSolver is available for download from http: www.aotl.com technique of constraint propagation [4, 10] Constraint propagation combined with non deterministic search became a success paradigm to solve constraint satisfaction problems (CSP) [2, 8, 14, 15, 16]. In recent years, CSP algorithms have be used successfully to solve many different types of real life problems [9, 12] such as resource allocation, job shop scheduling, timetabling, and duty rostering. The Waltz Filtering Algorithm was originally implemented in Micro Planner and Lisp. However, ....

....must form junctions that are physically realisable, and that each edge can have only one single label, i.e. the line labels at both ends of an edge must agree. Although constraint programming has a relatively long history [15] with constraint language extensions found in Prolog [2, 16] Lisp [14], and C [6, 9, 11] it is only recently that constraint programming techniques can be found in Java [7] The example line labelling problem in this paper is implemented using the JSolver constraint programming class library. 4. THE JSOLVER LINE LABELLING PROGRAM This Section describes the ....

J.M. Siskind and D.A. McAllester, "Nondeterministic Lisp as a Substrate for Constraint Logic Programming," In Proceedings of the Eleventh National Conference on Artificial Intelligence, Washington, DC, pp.133-138, July, 1993.

....constraints on object oriented representations in the form of CLOS objects. Keywords: Constraints, LISP, SCREAMER, CLOS. 1. A higher order function in LISP is a function which accepts another function as an argument. Constraint Handling in Common LISP 1 Introduction 1 Introduction SCREAMER (Siskind McAllester, 1993; Siskind McAllester, 1994) is a freely available extension of Common LISP (Steele, 1990) that provides for nondeterministic and constraint based programming. It was developed at the MIT AI Laboratory and the University of Pennsylvania, and is portable across most modern Common LISP ....

....of some Common LISP function. So, for example, integerpv is the SCREAMER constraint primitive corresponding to the LISP function integerp, which determines whether its argument is an integer. It is a convention that constraint primitives end in the letter v, 2. The code is adapted from (Siskind and McAllester, 1993). Constraint Handling in Common LISP 3 The Features of SCREAMER because each of them creates and returns a constraint variable to hold the result of evaluating the expression. To assert truths about constraint variables, one uses the primitive assert , which takes an expression as its argument ....

SISKIND, J. M., MCALLESTER, D. A., (1993), "Nondeterministic LISP as a Substrate for Constraint Logic Programming", in proceedings of AAAI-93.

....the constraint variable P . Since the tools we wished to model and the rest of the MUSKRAT framework were already implemented in Common LISP, we sought to implement the plausibility approximation to fitness for purpose using SCREAMER, a constraint logic programming library for Common LISP [22] [23]. 4.1 A Brief Introduction to SCREAMER and SCREAMER SCREAMER introduced two paradigms into Common LISP: firstly, it introduced a nondeterminism similar to the backtracking capabilities of PROLOG. Secondly, and more importantly for our purposes, it used these backtracking capabilities as the ....

J. M. Siskind, D. A. McAllester, (1993), "Nondeterministic LISP as a Substrate for Constraint Logic Programming", in proceedings of AAAI-93.

....interpretation , which provides us the formal tool for expressing the above layers. The implementation relies on an extension of the Beth semantic tableaux to stratified logic. The code is written in Common Lisp and makes extensive use of the nondeterministic facilities of the Screamer system [ Siskind and McAllester, 1993 ] The result of our work is a logical formalism that yields a tractable computational method that uniformly calculates all the presuppositions of a given utterance, including the existential ones. 1 This paper has been accepted by the International Workshop on Computational Semantics, Dec. ....

J.M. Siskind and D.A. McAllester. Nondeterministic Lisp as a substrate for constraint logic programming. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 133--138, 1993.

....the intervals associated with the variables so that every constraint appears to be locally consistent. The local consistency condition of Helios is called box consistency, an approximation of arc consistency, a notion well known in artificial intelligence [20, 22] and used in many systems (e.g. [39, 42, 37]) to solve discrete combinatorial search problems. Informally speaking, a constraint is arc consistent if for each value in the range of a variable there exist values in the ranges of the other variables such that the constraint is satisfied. Helios approximates arc consistency which cannot be ....

J. Siskind and D. McAllester. Nondeterministic Lisp as a Substrate for Constraint Logic Programming. In AAAI-93, pages 133--138, 1993.

.... editors [80, 92] backward error recovery in fault tolerant and transaction processing systems [20, 49, 11, 57] playback in program debuggers [2, 31, 64] versioning in software engineering tools [81] backtracking in logic programming [18] non determinism and backtracking in functional language [76, 93] and rollback based synchronization in optimistic parallel discrete event simulation [38, 54] The straightforward solution of resetting the system to the initial state (cold starting) and regenerating the required state by forward execution is not practical for systems with long life times. ....

J. Siskind and D. McAllester. Nondeterministic Lisp as a substrate for constraint logic programming. In Proceedings of AAAI-93, pages 133--138, July 194 1993.

....interpretation , which provides us the formal tool for expressing the above layers. The implementation relies on an extension of the Beth semantic tableaux to stratified logic. The code is written in Common Lisp and makes extensive use of the nondeterministic facilities of the Screamer system [ Siskind and McAllester, 1993a, Siskind and McAllester, 1993b ] We first review the philosophical approaches in studying existence and nonexistence and the linguistic approaches in studying presuppositions, emphasizing their (in)ability to deal with presuppositions and nonexistence respectively. We give a brief ....

....us the formal tool for expressing the above layers. The implementation relies on an extension of the Beth semantic tableaux to stratified logic. The code is written in Common Lisp and makes extensive use of the nondeterministic facilities of the Screamer system [ Siskind and McAllester, 1993a, Siskind and McAllester, 1993b ] We first review the philosophical approaches in studying existence and nonexistence and the linguistic approaches in studying presuppositions, emphasizing their (in)ability to deal with presuppositions and nonexistence respectively. We give a brief introduction to stratified logic, its ....

[Article contains additional citation context not shown here]

J.M. Siskind and D.A. McAllester. Nondeterministic Lisp as a substrate for constraint logic programming. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 133--138, 1993.

....expressions allow specification of and reasoning over constraints. Nondeterminism supports search and handles the potential for multiple, alternative bindings of symbolic variables. These features are present in other constraint programming languages, most notably the SCREAMER Constraint System [SM93a]. The SCREAMER Constraint System is built upon SCREAMER, a nondeterministic implementation of COMMON LISP [SM93b] Although SCREAMER does not, strictly speaking, include the constraint reasoning facility, the SCREAMER Constraint System will be referred to here simply as SCREAMER. SCREAMER ....

....of node consistency. The methods described thus far are designed to terminate quickly, relative to the expense of search. To allow the maximum flexibility and control, LOGISTICA CFP provides the end programmer the ability to order variable and value selection. Borrowing directly from [SM93a], definitions (39) and (40) implement the linear force function. This function takes a variable and the constraint expression and nondeterministically applies values from the domain of the variable to the expression. The let expression in (40) matches the segment variables of (domain (x) s ....

J. M. Siskind and D. A. McAllester, "Nondeterministic LISP as a Substrate for Constraint Logic Programming," Proceedings of the Eleventh National Conference on Artificial Intelligence, July 11-15, 1993, Washington DC, MIT Press, pp. 133-138.

....at time point t 0 using E 1 of action a 1 . We call the above transformation a reduction of the set c 2 at t 1 to c 0 2 at t 0 . Condition c 2 is satisfied in the chronicle constrained by c 1 and E 1 iff the set C = fc 1 ; c 0 2 g is consistent. Constraint solving techniques such as Screamer [ 8 ] can be used to check the consistency of C to see whether it is necessary to create branch (c; I; E ) Note that the constraint solver must be sound but need not be complete; if the inconsistancy of C cannot be detected the only thing we loose is some extra projection due to the created branch ....

J.M. Siskind and D.A. McAllester. Nondeterministic lisp as a substrate for constraint logic programming. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 133--138, Washington,DC, July 1993.

....of a certain cardinality assigned to them. Since the set of possible values is not known at the outset of problem solving, the model must recognize when to treat the set of values as open, when to treat it as closed and when to reopen it. We use the Screamer constraint logic programming language [SM93] to model the problem solving. Although Screamer does not handle dynamic variables, we temporarily resolve this by setting up the variables and constraints anew with each utterance. The input is limited to just the shared knowledge of S and H as an effect of the utterance, and comprises: 1. the ....

Jeffrey M. Siskind and David A. McAllester. Nondeterministic lisp as a substrate for constraint logic programming. In Proceedings of AAAI-93, CA, 1993. AAAI Press.

....1979 ] In spite of this, CS algorithms seem to perform well for certain classes of problems. Determining whether the problem of text structure derivation falls into a class of problems for which CS algorithms perform well enough is an empirical question. To answer it, I used Lisp and Screamer [ Siskind and McAllester, 1993a, Siskind and McAllester, 1993b ] a macro package that provides constraint satisfaction facilities, to fully implement a system that builds text structures by means of the algorithm shown in figure 3.1. The implementation takes as input a linear sequence of textual units U = u 1 ; u 2 ; ....

....algorithms seem to perform well for certain classes of problems. Determining whether the problem of text structure derivation falls into a class of problems for which CS algorithms perform well enough is an empirical question. To answer it, I used Lisp and Screamer [ Siskind and McAllester, 1993a, Siskind and McAllester, 1993b ] a macro package that provides constraint satisfaction facilities, to fully implement a system that builds text structures by means of the algorithm shown in figure 3.1. The implementation takes as input a linear sequence of textual units U = u 1 ; u 2 ; u n and the set of simple and ....

Jeffrey M. Siskind and David A. McAllester. Nondeterministic Lisp as a substrate for Constraint Logic Programming. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI--93), pages 133--138, 1993.

....independent fashion [16] Similar comments can be applied to the EKS V1 system [25] which adopts the query subquery evaluation approach. The evaluation of the n queens program or other similar programs has also been studied extensively from the point of view of search and constraint satisfaction [14, 18, 12, 26, 21]. Unification operation in the kernel of logic programming can also be viewed as constraint satisfaction [14, 18] Much effort has been exercised to improve the classical heuristic search strategies, where an optimal node is to be sought [12, 26, 21] Our chainbased evaluation approach is ....

....approach. The evaluation of the n queens program or other similar programs has also been studied extensively from the point of view of search and constraint satisfaction [14, 18, 12, 26, 21] Unification operation in the kernel of logic programming can also be viewed as constraint satisfaction [14, 18]. Much effort has been exercised to improve the classical heuristic search strategies, where an optimal node is to be sought [12, 26, 21] Our chainbased evaluation approach is different from those studies in two aspects. First, it finds all the answers instead of a few (sub)optimal ones to a ....

J.M. Siskind and D. A. McAllester. Nondeterministic lisp as a substrate for constraint logic programming. In Proc. 11th National Conf. on AI, AAAI-93, pages 133--138, Washington, D.C., July 1993.

....dependent variables monotonically. Additional qualitative functional relationships can be specified, such as the M Gamma inverse monotonic relationship. We have been developing a general constraint based simulation tool, QobiSIM [9] that is built on a constraint programming language, SCREAMER [8]. SCREAMER accepts both qualitative and quantitative variables and constraints on variables, allowing development of a mixed qualitative quantitative simulation tool which offers advantages over existing qualitative quantitative simulation tools, including efficiency, generality and ease of use. ....

J. Siskind and D. McAllester. Nondeterministic Lisp as a Substrate for Constraint Logic Programming. Proc. AAAI, pages 133--138, Washington D.C., July 1993.

....it makes extensive use of two packages: Screamer [ Siskind, 1991 ] a set of nondeterministic macros, and Iterate [ Amsterdam, 1990 ] an iteration macro similar to loop. The interested reader can find our program in annex A. Details on nondeterministic programming and Screamer are given by [ Siskind and McAllester, 1993a, Siskind and McAllester, 1993b ] 6.1 Representation Constants, variables, functions, and predicates are represented as Lisp symbols. Stratified predicates are prefixed by U , I , or D : for example, adult d (x) is represented as (D adult x) Terms and atomic formulas such as come(Mary; ....

....packages: Screamer [ Siskind, 1991 ] a set of nondeterministic macros, and Iterate [ Amsterdam, 1990 ] an iteration macro similar to loop. The interested reader can find our program in annex A. Details on nondeterministic programming and Screamer are given by [ Siskind and McAllester, 1993a, Siskind and McAllester, 1993b ] 6.1 Representation Constants, variables, functions, and predicates are represented as Lisp symbols. Stratified predicates are prefixed by U , I , or D : for example, adult d (x) is represented as (D adult x) Terms and atomic formulas such as come(Mary; party) are represented as Lisp ....

J.M. Siskind and D.A. McAllester. Nondeterministic Lisp as a substrate for constraint logic programming. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 133--138, 1993.

....the intervals associated with the variables so that every constraint appears to be locally consistent. The local consistency condition of Newton is called box consistency, an approximation of arc consistency, a notion well known in arti cial intelligence [16, 18] and used in many systems (e.g. [32, 34, 30]) to solve discrete combinatorial search problems. Informally speaking, a constraint is arc consistent if for each value in the range of a variable there exist values in the ranges of the other variables such that the constraint is satis ed. Newton approximates arc consistency which cannot be ....

J. Siskind and D. McAllester. Nondeterministic Lisp as a Substrate for Constraint Logic Programming. In AAAI-93, pages 133-138, 1993.

....the intervals associated with the variables so that every constraint appears to be locally consistent. The local consistency condition of Newton is called box consistency, an approximation of arc consistency, a notion well known in artificial intelligence [16, 18] and used in many systems (e.g. [32, 34, 30]) to solve discrete combinatorial search problems. Informally speaking, a constraint is arc consistent if for each value in the range of a variable there exist values in the ranges of the other variables such that the constraint is satisfied. Newton approximates arc consistency which cannot be ....

J. Siskind and D. McAllester. Nondeterministic Lisp as a Substrate for Constraint Logic Programming. In AAAI-93, pages 133--138, 1993.

....the intervals associated with the variables so that every constraint appears to be locally consistent. The local consistency condition of Newton is called box consistency, an approximation of arc consistency, a notion well known in artificial intelligence [10, 12] and used in many systems (e.g. [24, 25, 22]) to solve discrete combinatorial search problems. Informally speaking, a constraint is arc consistent if for each value in the range of a variable there exist values in the ranges of the other variables such that the constraint is satisfied. Newton approximates arc consistency which cannot be ....

J. Siskind and D. McAllester. Nondeterministic lisp as a substrate for constraint logic programming. In AAAI-93, pages 133--138, 1993.

....the intervals associated with the variables so that every constraint appears to be locally consistent. The local consistency condition of Newton is called box consistency, an approximation of arc consistency, a notion well known in artificial intelligence [17, 19] and used in many systems (e.g. [33, 34, 31]) to solve discrete combinatorial search problems. Informally speaking, a constraint is arc consistent if for each value in the range of a variable there exist values in the ranges of the other variables such that the constraint is satisfied. Newton approximates arc consistency which cannot be ....

J. Siskind and D. McAllester. Nondeterministic Lisp as a Substrate for Constraint Logic Programming. In AAAI-93, pages 133--138, 1993.

No context found.

Siskind, J.M., McAllester, D.A.: Nondeterministic lisp as a substrate for constraint logic programming. In Fikes, R., Lehnert, W., eds.: Proceedings of the Eleventh National Conference on Artificial Intelligence, Menlo Park, California, AAAI Press (1993) 12

No context found.

Siskind, J. M., McAllester, D. A., (1993), "Nondeterministic LISP as a Substrate for Constraint Logic Programming", in proceedings of AAAI-93.

No context found.

Siskind, J. M., & McAllester, D. A. (1993a). Nondeterministic Lisp as a Substrate for Constraint Logic Programming. In Proceedings of the 11th National ConferenceonArtificial Intelligence (pp. 133--138). Washington DC: AAAI Press.

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