Kuniaki Mukai. Anadic tuples in prolog. Technical Report TR-239, ICOT, Tokyo, Japan, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....admitting ad hoc polymorphism in the presence of subsorts. Another direction of the semantic approach was initiated by Ait Kaci and Nasr s [AKN86] language LOGIN, which replaces ordinary first order terms with record structures and employs a typed unification called unification. Mukai s [Muk87] language CIL is similar to LOGIN but has no subsorts. Smolka and Ait Kaci [SA89] show how LOGIN can be captured in order sorted logic and device a framework that combines order sorted constructor types with LOGIN s feature types. Feature Logic [Smo88a, Smo89] is a decidable logic that ....

....in an algebra providing rational trees and rational numbers and allows for linear equations and inequations for numbers, boolean expressions for truth values, and equations and disequations for general terms. Other recent examples of constraint logic programming languages are CLP(R) JM87] CIL [Muk87] and CHIP [DHS 88] Jaffar and Lassez [JL86, JL87] were the first to identify the new model, coined the name Constraint Logic Programming, and developed a general framework that is parameterized This Chapter is an adaptation of [HS88] 7 with respect to the constraint language being ....

Kuniaki Mukai. Anadic tuples in prolog. Technical Report TR-239, ICOT, Tokyo, Japan, 1987.

....relation. Rounds [38] investigates a generalization of feature graphs that accommodates set valued edges. The integration of Prolog like logic programming with feature constraint languages seems to be a promising line of research. Language proposals based on this idea are login [4] and cil [32]. The theoretical foundations for this kind of languages are given by Feature Logic and the constraint logic programming model [15, 13] 37 Acknowledgements. The research reported in this paper was carried out when I was a Postdoc Fellow with IBM Deutschland at the IWBS in Stuttgart and has ....

K. Mukai. Anadic tuples in Prolog. Technical Report TR-239, ICOT, Tokyo, Japan, 1987.

....in first order automated theorem proving [242, 44] 2 The language Absys [82] which was very similar to Prolog, used equations explicitly, making it more obviously a CLP language. 6 Prolog like trees are essentially part of this domain, instead of being built on top of the domain. CIL [192] computes over a domain similar to feature trees. BNR Prolog [198] computes over three domains: the 2 valued Boolean algebra, finite domains, and arithmetic over the real numbers. In contrast to other CLP languages over arithmetic domains it computes solutions numerically, instead of ....

K. Mukai, Anadic Tuples in Prolog, Technical Report TR-239, ICOT, Tokyo, 81 1987.

....logic programming with feature logic seems to be a very promising line of research. In LOGIN [3] which pioneered this approach, feature terms (without singletons, unions and complements) take the place of ordinary terms and feature unification replaces ordinary term unification. Mukai s [17] language CIL is similar but uses constants instead of sorts. While LOGIN is presented without a declarative semantics, Mukai defines a declarative semantics for CIL using a fixed domain of rational records. Mukai also realizes that CIL is an instance of constraint logic programming, an approach ....

K. Mukai. Anadic tuples in Prolog. Technical Report TR-239, ICOT, Tokyo, Japan, 1987.

....experimental tool for the computational linguist. To be sure, there are other efforts attempting to tailor programming languages, typically logic programming, for linguistic analysis. As has been pointed out in [10] order sorted logic is quite convenient for parsing. Among those known to us CIL [14, 15] is one that comes close to LIFE s spirit in that it combines partial features of Log In [3] see Section 2.2.2) with delayed evaluation handled with an explicit freeze meta predicate borrowed from Prolog II [9] CIL s constructs are called Partially Specified Terms (PST s) which are exactly the ....

Mukai, K., "Anadic Tuples in Prolog," Report draft from lecture presented at the Workshop on Foundations of Deductive Databases and Logic Programming organized by J. Minker. Washington, DC. August 1986.

....experimental tool for the computational linguist. To be sure, there are other efforts attempting to tailor programming languages, typically logic programming, for linguistic analysis. As has been pointed out in [12] order sorted logic is quite convenient for parsing. Among those known to us CIL [17, 18] is one that comes close to LIFE s spirit in that it combines partial features of Log In [3] see Section 2.2.2) with delayed evaluation handled with an explicit freeze meta predicate borrowed from Prolog II [11] CIL s constructs are called Partially Specified Terms (PST s) which are exactly the ....

Mukai, K., "Anadic Tuples in Prolog," Report draft from lecture presented at the Workshop on Foundations of Deductive Databases and Logic Programming organized by J. Minker. Washington, DC. August 1986.

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