A. Colmerauer, H. Kanoui, and M. van Caneghem. Prolog, Theoretical Basis & Current Developments. TSI (Technology and Science of Informatics), 2(4):271--311, July 1983.  @ NUS  Home/Search   Document Not in Database   Summary   Related Articles   Check

....: 25 6 Constraint Communication 30 1 Introduction Concurrent constraint programming [28] brings together ideas from constraint and concurrent logic programming. Constraint logic programming [13, 2] on the one hand, originated with Prolog II [6] and was prompted by the need to integrate numbers and data structures in an operationally efficient, yet logically sound manner. Concurrent logic programming [30] on the other hand, originated with the Relational Language [5] and was promoted by the Japanese Fifth Generation Project, where logic ....

A. Colmerauer, H. Kanoui, and M. Van Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

.... 2 The Approach The ingredients of our semantics are (cf. Figure 1) BNF style rules to define the abstract syntax, reduction rules ( Gamma ) for the operational and For example: freeze, suspension, residuation (negated constraints also introduce an implicit form of coroutining) cf. [5, 10, 11, 4, 1]) congruence laws ( j ) for the declarative aspects. The execution of a program is seen as a sequence of state transitions. The states are modeled by formulae ( continuations ) which are represented as trees as usual. A computation step is modeled as the application of a rewrite rule to an ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2:4, pages 255--292, 1983.

....Nat(x) then Delta Delta Delta will not fire in a context where Even(x) is given. The third reason why we can not employ the extension facility for dealing with memberships is founded in the use of 3 infinite trees as the basic data structure. Infinite trees have been introduced in Prolog II [CKC83] in order to model cyclic data structures. With the definition of Nat as above, the conjunction x = succ(x) Nat(x) will forever unfold Nat . Again, an inductive reasoning is missing here. Consequently, we claim that CCP systems will benefit from the incorporation of memberships of some ....

A. Colmerauer, H. Kanoui, and M. Van Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

....9 4 Entailment, Independence and Negation 12 5 Entailment Simplification 14 6 Conclusion 20 2 1 Introduction An important structural property of many logic programming systems is the fact that they factorize into a constraint system and an extension facility. Colmerauer s Prolog II [8] is an early language design making explicit use of this property. CLP (Constraint Logic Programming [10] ALPS [16] CCP (Concurrent Constraint Programming [21] and KAP (Kernel Andorra Prolog [9] are recent logic programming frameworks that exploit this property to its full extent by being ....

....FT satisfies the independence property, the simplification system can also check satisfiability of conjunctions of positive and negative constraints. We see four directions for further research. First, FT should be strengthened such that it subsumes the expressivity of rational constructor trees [7, 8]. As is, FT cannot express that x is a tree having direct subtrees at exactly the features f 1 ; f n . It turns out that the system CFT [24] obtained from FT by adding the primitive constraint xff 1 ; f n g (x has direct subtrees at exactly the features f 1 ; f n ) has ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

....a form of garbage collection for the trail, and makes the cut execute in non constant time. Certain programs create large structures on the heap through the process of variable instantiation. A simple example of this occurs in the D.H. D Warren benchmark serialize which builds a tree on the heap ([20]) a more complex example occurs with the XSB compiler which builds its symbol table and program code on the heap. The instantiation used in these programs can create large trails, and, given that trail compaction is invoked with each cut, situations occur in practice where trail compaction must ....

....removed, and with WAM style trailing. To separate the effects of the freeze registers from that of trailing, a version of the emulator was also created with WAM style trailing but with freeze registers as in the SLG WAM. The times of all emulators compared for five D.H.D. Warren benchmarks [20] are provided below. Tests deriv. qsort nrev serialize query Geo. mean SLG WAM 1.32 1.24 1.08 1.11 1.17 1.18 SLG WAM: WAM trail 1.2 1.21 1.06 1.01 1.21 1.13 SLG WAM: WAM trail 1 1 1 1 1 1 no freezes For qsort, naive reverse, and query, the increase in time appears to be due to the addition ....

A. Colmerauer, H. Kanoui, and M. V. Canaghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

.... Method, see e.g. Hal95] possible mathematical domains are logic, set theory, and category theory [BW90b] each of these will be used in the case study of section 4) Logic is particularly useful for educational purposes, but could also favorably be considered in the context of a PROLOG [CKvC83] implementation. Set theory is more suitable in case the formalization is required to be concise and formal properties need to be investigated. Category theory then could be exploited as an even more abstract system, formalization is intellectually more demanding, but the rewards are reduction in ....

A. Colmerauer, H. Kanoui, and M. van Caneghem. Prolog, Theoretical Basis & Current Developments. TSI (Technology and Science of Informatics), 2(4):271--311, July-August 1983.

....starting point was concurrent constraint programming [ Saraswat and Rinard, 1990 ] which brings together ideas from constraint and concurrent logic programming. Constraint logic programming [ Jaffar and Lassez, 1987, Colmerauer and Benhamou, 1993 ] on the one hand, originated with Prolog II [ Colmerauer et al. 1983 ] and was prompted by the need to integrate numbers and data structures in an operationally efficient, yet logically sound manner. Concurrent logic programming [ Shapiro, 1989 ] on the other hand, originated with This work has been supported by the Bundesminister fur Forschung und Technologie, ....

A. Colmerauer, H. Kanoui, and M. Van Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

....Nat(x) then Delta Delta Delta will not fire in a context where Even(x) is given. The third reason why we can not employ the extension facility for dealing with memberships is founded in the use of infinite trees as the basic data structure. Infinite trees have been introduced in Prolog II [CKC83] in order to model cyclic data structures. With the definition of Nat as above, the conjunction x : succ(x) Nat(x) will forever unfold Nat . Again, an inductive reasoning is missing here. Consequently, we claim that CCP systems will benefit from the incorporation of memberships of some ....

A. Colmerauer, H. Kanoui, and M. Van Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

.... contrast, imperative languages do have elegant formal semantics (both operational and denotational style) The work in [2] gives the operational semantics of freeze, but 1 For example: freeze, suspension, residuation (negated constraints also introduce an implicit form of coroutining) cf. [4, 9, 10, 3, 1] on a very low level; for example, it formalizes the stepwise search through the list of frozen goals. Such a low level approach seems suitable for specifying and comparing language implementations, but not so much for designing and specifying the languages themselves. On a very high level, ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2:4, pages 255--292, 1983.

....: 25 6 Constraint Communication 30 1 Introduction Concurrent constraint programming [28] brings together ideas from constraint and concurrent logic programming. Constraint logic programming [13, 2] on the one hand, originated with Prolog II [6] and was prompted by the need to integrate numbers and data structures in an operationally efficient, yet logically sound manner. Concurrent logic programming [30] on the other hand, originated with the Relational Language [5] and was promoted by the Japanese Fifth Generation Project, where logic ....

A. Colmerauer, H. Kanoui, and M. Van Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

....10 5 Entailment Simplification 12 6 Conclusion 17 References 19 v A Feature Constraint System 1 1 Introduction An important structural property of many logic programming systems is the fact that they factorize into a constraint system and a relational facility. Colmerauer s Prolog II [10] is an early language design making explicit use of this property. CLP (Constraint Logic Programming [12] ALPS [18] CCP (Concurrent Constraint Programming [23] and KAP (Kernel Andorra Prolog [11] are recent logic programming frameworks that exploit this property to its full extent by being ....

....FT satisfies the independence property, the simplification system can also check satisfiability of conjunctions of positive and negative constraints. We see four directions for further research. First, FT should be strengthened such that it subsumes the expressivity of rational constructor trees [9, 10]. As is, FT cannot express that x is a tree having direct subtrees at exactly the features f 1 ; f n . It turns out that the system CFT [26] obtained from FT by adding the primitive constraint: xff 1 ; f n g (x has direct subtrees at exactly the features f 1 ; f n ) has ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

....complete, and (2) a proof showing that FT satisfies the so called independence of negative constraints. 1 Introduction An important structural property of many logic programming systems is the fact that they factorize into a constraint system and an extension facility. Colmerauer s Prolog II [7] is an early language design making explicit use of this property. CLP (Constraint Logic Programming [9] ALPS [15] CCP (Concurrent Constraint Programming [20] and KAP (Kernel Andorra Prolog [8] are recent logic programming frameworks that exploit this property to its full extent by being ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

....10 5 Entailment Simplification 12 6 Conclusion 17 References 19 v A Feature Constraint System 1 1 Introduction An important structural property of many logic programming systems is the fact that they factorize into a constraint system and a relational facility. Colmerauer s Prolog II [10] is an early language design making explicit use of this property. CLP (Constraint Logic Programming [12] ALPS [18] CCP (Concurrent Constraint Programming [23] and KAP (Kernel Andorra Prolog [11] are recent logic programming frameworks that exploit this property to its full extent by being ....

....FT satisfies the independence property, the simplification system can also check satisfiability of conjunctions of positive and negative constraints. We see four directions for further research. First, FT should be strengthened such that it subsumes the expressivity of rational constructor trees [9, 10]. As is, FT cannot express that x is a tree having direct subtrees at exactly the features f 1 ; f n . It turns out that the system CFT [26] obtained from FT by adding the primitive constraint: xff 1 ; f n g (x has direct subtrees at exactly the features f 1 ; f n ) has ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

.... logical formulation of matching and non unifiability, respectively [17] 1 Tests for entailment and disentailment are used in all logic programming languages and instances of concurrent constraint programming schemes that employ suspensionmechanisms such as residuation [5] delaying [18] freeze [6, 7, 10], committed choice [17, 21] guarded rules [22, 15] concurrent constraints [20] and the Andorra Principle [13, 19] They are also used for solving disequations, i.e. constraints with negation, as in Prolog II [8] or CLP(rational trees) 14] It is important to consider the incrementality ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

....store modulo logic equivalence. This means that the synchronization mechanism is completely declarative. It turns out that there are constraint systems for which synchronization as entailment is both expressive and efficient. Synchronization on a constraint store appeared first in Prolog II [4] in the primitive form of the so called freeze construct. The idea to synchronize on entailment of constraints is due to Maher [10] 5 Constraint Structures We now make precise the notions of constraint and entailment. We will also see that the constraint store is the place where information ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

....M 0 length(U; M) which is an answer if the relation length is residuating. In any case, it would not make sense to reduce this goal further. Residuation is a simple and powerful alternative to delay primitives such as the delay annotations of IC Prolog [5] the freeze construct of Prolog II [8], or the wait declarations of MU Prolog [17] There are major advantages offered by residuation over these delay primitives. ffl Residuation applies to every constraint system (rather than to tree systems only) ffl No annotations in clauses are needed the programmer only decides which ....

A. Colmerauer, H. Kanoui, and M. Van Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292 (1983).

....M 0 length(U; M) which is an answer if the relation length is residuating. In any case, it would not make sense to reduce this goal further. Residuation is a simple and powerful alternative to delay primitives such as the delay annotations of IC Prolog [4] the freeze construct of Prolog II [6], or the wait declarations of MU Prolog [15] Major advantages of residuation over these delay primitives are: ffl residuation applies to every constraint system (rather than to tree systems only) ffl no annotations in clauses are needed the programmer only decides which relations should be ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255-- 292, 1983.

....Simplification 9 4 Entailment, Independence and Negation 12 5 Entailment Simplification 14 6 Conclusion 20 1 Introduction An important structural property of many logic programming systems is the fact that they factorize into a constraint system and an extension facility. Colmerauer s Prolog II [8] is an early language design making explicit use of this property. CLP (Constraint Logic Programming [10] ALPS [16] CCP (Concurrent Constraint Programming [21] and KAP (Kernel Andorra Prolog [9] are recent logic programming frameworks that exploit this property to its full extent by being ....

....FT satisfies the independence property, the simplification system can also check satisfiability of conjunctions of positive and negative constraints. We see four directions for further research. First, FT should be strengthened such that it subsumes the expressivity of rational constructor trees [7, 8]. As is, FT cannot express that x is a tree having direct subtrees at exactly the features f 1 ; f n . It turns out that the system CFT [24] obtained from FT by adding the primitive constraint xff 1 ; f n g (x has direct subtrees at exactly the features f 1 ; f n ) has ....

A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255--292, 1983.

No context found.

A. Colmerauer, H. Kanoui, and M. van Caneghem. Prolog, Theoretical Basis & Current Developments. TSI (Technology and Science of Informatics), 2(4):271--311, July 1983.

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.