A. Podelski and G. Smolka. Operational Semantics of Constraint Logic Programs with Coroutining. In Proc. of ICLP'95, pages 449-463. MIT Press, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....descriptions of Prolog with the main emphasis on covering the backtracking strategy and the cut operator. Although the modeling of backtracking by the use of a goal sequence has some similarities with our description, laziness, sharing, and concurrency are not covered there. Podelski and Smolka [18] de ned an operational semantics for constraint logic programs with coroutining in order to specify the interaction of backtracking, cut, and coroutining. Their modeling of coroutining via pools is related to our model of concurrency, but demand driven evaluation and sharing is not contained in ....

A. Podelski and G. Smolka. Operational Semantics of Constraint Logic Programs with Coroutining. In Proc. of the Twelfth International Conference on Logic Programming (ICLP'95), pages 449-463. MIT Press, 1995.

....has some similarities with our description, laziness, sharing, and concurrency are not covered there. The same holds for Borger s descriptions of Prolog s operational semantics (e.g. 7, 8] which consist of various small step semantics for the di#erent language constructs. Podelski and Smolka [19] defined an operational semantics for constraint logic programs with coroutining in order to specify the interaction of backtracking, cut, and coroutining. Their modeling of coroutining via pools is related to our model of concurrency, but demand driven evaluation and sharing is not contained in ....

A. Podelski and G. Smolka. Operational Semantics of Constraint Logic Programs with Coroutining. In Proc. of ICLP'95, pages 449--463. MIT Press, 1995.

....of Prolog with the main emphasis on covering the backtracking strategy and the cut operator. Although our modeling of search strategies by the use of goal sequences has some similarities with their description, laziness, sharing, and concurrency are not covered there. Podelski and Smolka [20] define an operational semantics for constraint logic programs with coroutining in order to specify the interaction of backtracking, cut, and coroutining. Their modeling of coroutining via pools is related to our model of concurrency, but demand driven evaluation and sharing is not contained in ....

A. Podelski and G. Smolka. Operational Semantics of Constraint Logic Programs with Coroutining. In Proc. of the Twelfth International Conference on Logic Programming (ICLP'95), pages 449--463. MIT Press, 1995.

....of concurrent and constraint logic programming. AKL encapsulates search by using nested computation spaces. A computation space is a constraint store with its associated goals. Search is done by allowing procedures to be defined by 4 The non declarative aspect has received some attention, e.g. [25, 28, 3]. 11 Kind of entity Protocol Entity Stateless Replication Eager record, procedure, class Lazy object record Single assignment Elimination Eager logic variable Lazy logic variable Stateful Localization Mobile cell, object state Stationary port, thread Table 3: Semantics of Distributed Oz ....

Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programs with coroutining. In International Conference on Logic Programming (ICLP 95), pages 449--463, 1995.

....A is an agent or ; if empty, and X is a set of variables, called the hidden variables of c and A. The operational semantics is defined by a transition system which does not take into account specific evaluation strategies. The transitions system is given in the style of the CHAM [2] see also [28]) We thus distinguish a congruence relation between syntactic elements from the very transition relation between configurations. Definition 2.6 (Congruence) The structural congruence j is the least congruence satisfying the rules of table 1. 5 C Equivalence c a C d c j d ff Conversion z ....

A. Podelski and G. Smolka. Operational semantics of constraint logic programming with coroutining. In Proceedings of ICLP'95, International Conference on Logic Programming, Tokyo, 1995. 32

....on the same variable in different nodes. A simple fixed point algorithm is used for proving that the tests implemented by another, practical algorithm are correct and complete for entailment and disentailment. An operational semantics of constraint logic programs with coroutining is presented in [80]. The semantics of constraint logic programming languages with coroutining facilities ( freeze , suspension, residuation, etc. cannot be fully declarative; thus, an operational semantics has to be taken as the defining one. 80] gives a formal operational semantics for a Prolog like language with ....

....of constraint logic programs with coroutining is presented in [80] The semantics of constraint logic programming languages with coroutining facilities ( freeze , suspension, residuation, etc. cannot be fully declarative; thus, an operational semantics has to be taken as the defining one. [80] gives a formal operational semantics for a Prolog like language with cut and an entailment based conditional. The approach is derived from those used for concurrent calculi. Abstract syntax trees, congruence laws and rewrite rules are used to define the semantics. A computation step is modeled as ....

[Article contains additional citation context not shown here]

Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programming with coroutining. In Leon Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 449-- 463, Kanagawa, Japan, June 1995. The MIT Press.

....when maintaining large Prolog programs this proves to be invaluable. This has been made possible by a declarative semantics capable of describing the effects of the cut operator. Although a lot of work has been going on in order to give a declarative semantics to the cut operator, compare e.g. [Bor89, PS95], previous approaches were only concerned with the operational semantics. Most probably the fact that previous authors confined themselves to an investigation of the operational semantics of the cut has its origin in the fact that a declarative semantics for an unrestricted use of the cut operator ....

Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programs with coroutining. In Leon Sterling, editor, Proceedings of the 1995 International Conference on Logic Programming, pages 449--463, Kanagawa, Japan, 13--18 June 1995. The MIT Press.

....introduction, see the Oz programming model [Smo95a] and the calculi underlying Oz [Smo94, NM95b, Nie96] A closely related model of concurrency is the calculus [Mil93] See [Nie96] for a formal comparison between the two models. 2 The non declarative aspect has received some attention, e.g. [Nai86, HL94, PS95, And95]. 3 The higher order ccp core is minimally extended with state and search (see Section 5) The programming style arising from the resulting model can be sketched as follows: Computation is organized as a network of concurrent objects which react with each other and with the external world (I O) ....

Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programs with coroutining. In ICLP 95, pages 449--463, 1995. 12

....A is an agent or ; if empty, and x is a set of variables, called the hidden variables of c and A. The operational semantics is de ned by a transition system which does not take into account speci c evaluation strategies. The transitions system is given in the style of the CHAM [2] see also [28]) We thus distinguish a congruence relation between syntactic elements from the very transition relation between con gurations. De nition 2.6 (Congruence) The structural congruence is the least congruence satisfying the rules of table 1. 5 C Equivalence c a C d c d Conversion z 62 ....

A. Podelski and G. Smolka. Operational semantics of constraint logic programming with coroutining. In Proceedings of ICLP'95, International Conference on Logic Programming, Tokyo, 1995.

....versions of Concurrent Prolog and GHC, called FCP and FGHC respectively, were the focus of much work [8, 22] The KL1 language, derived from FGHC, was implemented in the high performance KLIC system. This system runs on sequential, 3 The non declarative aspect has received some attention, e.g. [18, 19, 7]. Kind of entity Protocol Entity Stateless Replication Eager record, procedure, class Lazy object record Single assignment Binding Eager logic variable Lazy logic variable Stateful Localization Mobile cell, object state Stationary port, thread Table 5: Semantics of Distributed Oz parallel, and ....

Andreas Podelski, Gert Smolka. Operational semantics of constraint logic programs with coroutining. In International Conference on Logic Programming (ICLP 95), pages 449-463, 1995.

....earlier. 2 A Uniform Model for Multiparadigm Programming Our approach to multiparadigm programming is to start with concurrent constraint programming (ccp) as a foundation. Concurrency is important because it is the most general 2 The non declarative aspect has received some attention, e.g. [27, 19, 34, 2]. form of control and can easily be restricted to the requirements of any programming style. Constraints are important because they provide a simple and uniform way to express communication and synchronization. The ccp model [23, 37] combines ideas from research in concurrent [39] and constraint ....

Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programs with coroutining. In ICLP 95, pages 449--463, 1995.

....the set of fresh variables and c is the store. A (resp. B) denotes the set of agents (resp. configurations) The semantics is defined by a transition system which does not take into account specific evaluation strategies. The transition system is given in the style of the CHAM [2] see also [24]) A congruence relation between configurations is thus distinguished from the very transition relation (between configurations) In this presentation the constraint system is implicit. Definition 4 The structural congruence j is the least congruence such that: Parallel composition (x; c; A k B; ....

A. Podelski and G. Smolka. Operational semantics of constraint logic programming with coroutining. In Proceedings of ICLP'95, International Conference on Logic Programming, Tokyo, 1995.

....This system runs on sequential, parallel, and distributed machines [14] A number of implementation techniques in the current Distributed Oz system have been borrowed from KLIC, notably the distributed garbage collection algorithm. 5 The non declarative aspect has received some attention, e.g. [36, 39, 3]. Kind of entity Protocol Entity Stateless Replication Eager record, procedure, class Lazy object record Single assignment Binding Eager logic variable Lazy logic variable Stateful Localization Mobile cell, object state Stationary port, thread Table 3: Semantics of Distributed Oz An important ....

Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programs with coroutining. In International Conference on Logic Programming (ICLP 95), pages 449--463, 1995.

....relation containing fl C and closed by the rule c d ) c Omega e) d. We shall define the operational semantics by a transition system which abstracts from specific evaluation strategies. The transition system is given in table 1 in the style of the Chemical Abstract Machine [4] see also [24]) This presentation, though different from a logic programming one, has the advantage of keeping track of the variable bindings, and we find it therefore cleaner to manage logically. We also chose to define the transition relation as a congruence (thus c A Gamma c B whenever A Gamma B) ....

A. Podelski and G. Smolka. Operational semantics of constraint logic programming with coroutining. In Proceedings of ICLP'95, Int. Conf. on Logic Programming, Tokyo, 1995.

....operator by cut is provably correct with respect to Gelfond and Lifschitz s stable model semantics. There has been relatively few formal work on cut compared to that on negation in logic programming. Previous work on the semantics of cut includes an operational semantics by Podelski and Smolka [9], a denotational semantics by Jones and Mycroft [5] a dynamic algebra semantics by Borger [2] a paralogical semantics by Andrews [1] and a simple completion style semantics by Stroetmann and Gla [11] for a very special class of programs. Comparisons among these different semantics and between ....

A. Podelski and G. Smolka. operational semantics of constraint logic programs with cocoutining. In Proc. of the 1995 International Conf. on Logic Programming, pages 449--463. Kanagawa, Japan, 13-18 June 1995. The MIT Press, 1995.

....hidden variables and c is the store. Let A (resp. B) denotes the set of agents (resp. configurations) The operational semantics is defined by a transition system which does not take into account specific evaluation strategies. The transitions system is given in the style of the CHAM [2] see also [26]) We distinguish a congruence relation (between configurations) from the very transition relation (between configurations) Definition 2.6 (Transitions) The structural congruence j is the least congruence satisfying the rules of table 1. ff Conversion z 62 v(A) 9yA j 9zA[z=y] Parallel ....

A. Podelski and G. Smolka. Operational semantics of constraint logic programming with coroutining. In Proceedings of ICLP'95, International Conference on Logic Programming, Tokyo, 1995.

.... useful for constraint simplification [41] during record type inference, but it is also prerequisite for a possible usage of FT in modern constraint programming languages with advanced control mechanisms such as delaying, coroutining, synchronization, committed choice and local computation spaces [2, 5, 47, 38]. We furthermore show that FT has the independence property if the set of features provided by the signature is infinite. Thanks to the independence property, the entailment test is sufficient for testing conjunctions j :j 1 : j n for satisfiability (namely, by testing that none of the ....

Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programs with coroutining. In Leon Sterling, editor, Proceedings of the 12 International Conference on Logic Programming, pages 449--463, Kanagawa, Japan, 13--18 June 1995. The MIT Press, Cambridge, MA.

....a particular guard operator. In [10] the commit condition was analyzed as logical entailment. The delay mechanism in Prolog like languages as MuProlog [13, 12] and functional residuation in LIFE [1, 2] are based on entailment as well; for a formal operational semantics of these languages see [15]. AKL [7] and Oz [8, 9] are two practical systems providing both for concurrent (as in multi agent) and constraint logic programming in one uniform framework. Here, deep guards constitute the central mechanism to combine processes and ( encapsulated ) search for problem solving. The first formal ....

Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programming with coroutining. In Leon Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 449--463, Kanagawa, Japan, 1995. The MIT Press.

No context found.

A. Podelski and G. Smolka. Operational Semantics of Constraint Logic Programs with Coroutining. In Proc. of ICLP'95, pages 449-463. MIT Press, 1995.

No context found.

A. Podelski and G. Smolka. Operational Semantics of Constraint Logic Programs with Coroutining. In Proc. of the Twelfth International Conference on Logic Programming (ICLP'95), pp. 449--463. MIT Press, 1995.

No context found.

A. Podelski and G. Smolka. Operational semantics of constraint logic programs with coroutining. In Proceedings of the International Conference of Logic Programming (ICLP'95), Kanagawa, Japan, Jun 1995. MIT Press.

No context found.

Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programming with coroutining. In Leon Sterling, editor, Proceedings of the 1995 International Conference on Logic Programming, pages 449-- 463, Kanagawa, Japan, 13--18 June 1995. The MIT 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