Hassan At-Kaci and Patrick Lincoln. LIFE: A natural language for natural language. MCC Technical Report ACA-ST-074-88, MCC, ACA Program, February 1988.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....example, let us introduce an abstraction, called search object, that is similar to a Prolog top level. It does depth first search and can be queried to obtain successive solutions. Three steps are needed to use it: declare P E in 1. Define a new search query: proc P S X Y in Append X Y [1 2 3 4 5] S=sol(X Y) end 2. Set up a new search engine: E= New Search.object script(P) 3. Get and display the first solution: and others, when repeated) local X in E next(X) Browse X end Let us explain each of these steps: Lazy search is di#erent from lazy evaluation in that the program ....

....of the query P. If there is a solution, then X is bound to a list containing it as single element. If there are no more solutions, then X is bound to nil. Browse is a tool provided by the system to display data structures. When running this example, the first call displays the solution [sol(nil [1 2 3 4 5]) that is, a one element list containing a solution. Successive calls display the solutions [sol( 1] 2 3 4 5] sol( 1 2 3 4 5] nil) When there are no more solutions, then nil is displayed instead of a one element list. The standard Oz approach is to use search only for problems that ....

[Article contains additional citation context not shown here]

Hassan At-Kaci and Patrick Lincoln. LIFE: A natural language for natural language. MCC Technical Report ACA-ST-074-88, MCC, ACA Program, February 1988.

....This is just syntactic sugar; in Oz, a function is just a shorter way of writing a procedure where the procedure s last argument is the function s output. The statement Ys= NRev Xs has identical behavior to the procedure call NRev Xs Ys . The function can be called as follows: Browse NRev [1 2 3 4 5] where Browse opens a concurrent graphic tool, the Browser, to display the result [58] The Append and NRev calls do not do search. If there is not enough information to continue, then the computation may suspend. For example, take these two calls: declare X Y in Browse Append [1] X ....

....small search space, dis may be sucient. For example, a practical diagnostics generator for the VLSI BAM microprocessor was written in Prolog [31] 2 Note that lazy search is orthogonal to lazy evaluation (see Section 7) 4 declare Define a new search query: proc P S X#Y=S in Append X Y [1 2 3 4 5] end Set up a new search engine: E= New Search.object script(P) Get and display the first solution: and others, when repeated) Browse E next( This example introduces an important syntactic short cut: the use of (dollar) as a nesting marker. The dollar indicates the part of a ....

[Article contains additional citation context not shown here]

Hassan At-Kaci and Patrick Lincoln. LIFE: A natural language for natural language. MCC Technical Report ACA-ST-074-88, MCC, ACA Program, February 1988.

....Xr [X] end end This is just syntactic sugar; in Oz, a function is just a shorter way of writing a procedure where the procedure s last argument is the function s output. The function NRev Xs is identical to the procedure NRev Xs Ys . The function can be called as follows: Browse NRev [1 2 3 4 5] where Browse opens a concurrent graphic tool, the Browser, to display the result [55] This is how Oz supports deterministic logic programming. Syntactically, it looks like functional programming, but it s more. All calculations are done over a constraint store: unifications add information ....

....module (see Section 6.2) The simplest way to use search in Oz is by using the search object. The search object provides a lazy depth first search, similar to a Prolog top level. Here s how to use it: Set up a new search engine: E= New Search.object script(proc S X#Y=S in Append X Y [1 2 3 4 5] end) Get the first solution: and next solutions, when repeated) Browse E next( The is a nesting marker that makes for compact source code. For example, the syntax proc S . end denotes an anonymous unary procedure, which is essentially a lambda expression, in the sense of ....

[Article contains additional citation context not shown here]

Hassan Ait-Kaci and Patrick Lincoln. LIFE: A natural language for natural language. MCC Technical Report ACA-ST-074-88, MCC, ACA Program, February 1988.

....and feature types supporting inheritance. This language is well suited for knowledge representation, in particular for applications in computational linguistics. Keywords: Knowledge representation, AI software, inferences, natural language processing 1 Introduction Ait Kaci designed LIFE [4, 5], a language developed in an attempt to integrate the three most important programming styles: functional, logic oriented and object oriented programming. The functional programming style is defined by deterministic computations and first classness of functional expressions of any order. A ....

Hassan Ait-Kaci and Patrick Lincoln. LIFE --- a natural language for natural language. Technical report, Microelectronics and Computer Technology Corporation, Austin (TX), February 1988.

....abstract machine for CCP languages that provides for deep guards, threads, and lexically scoped higher order procedures. The paper is based on foundational work on records [19] and terms [3] for logic programming. Most of the theoretical concepts were introduced by Ait Kaci in the LIFE language [2]. The entailment checking algorithm, using the scripting idea, was used in early committed choice systems and justified in [8] Previous work with record like structures was done as part of the work on LIFE compilation [5, 7, 12, 13, 14] The main results of this work are the Beauty Beast ....

Hassan Ait-Kaci and Pat Lincoln. LIFE: A natural language for natural language. Technical Report ACA-ST-074-88, MCC, Austin, TX, 1988.

....in the reverse order as they are predicted, with the assumption that all phrase types specify continuous structures. 7 Implementational Issues We have implemented an HPSG parser for Turkish, a free word order, head final language, using the present algorithm, in the LIFE programming language (Ait Kaci and Lincoln, 1988). LIFE provides the programmer with features from three different programming paradigms, namely functional programming, logic programming and object oriented programming; e.g. functions, predicates, a Prolog like resolution strategy, unification, memoization, an inheritance based sorted feature ....

H. Ait-Kaci and P. Lincoln. 1988. Life: A natural language for natural language. Technical Report ACA-ST-074-88, Systems Technology Laboratory, Austin, Tex.

....language like Prolog contains constructor terms with an unification operation defined on them and uses a resolution based theorem prover. The objectoriented style allows to specify a hierarchy of classes containing objects. The properties of these objects can be inherited through the hierarchy. In [4] Ait Kaci describes the language LIFE , which was developed as an attempt to integrate these three programming styles into a single language. The most interesting new ideas in his paper are the conception of feature types and the treatment of function evaluation in a logic oriented programming ....

....subterms. At any place where a variable can occur any number of functional expressions may be given too. These may contain references to any variables in the feature term and so express functional constraints between subterms. For a more elaborate description of feature terms see Ait Kaci [4]. A formal definition of feature terms and their semantics is given in section 4.1. Closed types are a special kind of types. A feature term of such a type may have only attributes whose names are taken from a fixed list defined with the type. So these types are used to model constructor terms ....

Hassan Ait-Kaci and Patrick Lincoln. LIFE --- a natural language for natural language. Technical report, Microelectronics and Computer Technology Corporation, Austin (TX), February 1988.

....canonical boolean lattice under the cartesian extension of the 0 1 ordering. The computation of greatest lower bounds, for example, is thus reduced to a binary and. We developed this technique implementing the particular mechanism of object inheritance of LogIn [6] and further extended in Life [5]. Another promising prospect of relevance for the techniques we describe seems to be the fast implementation of other constraint programming models strongly related to ours such as [13, 15, 16] Section 2 states the problem in general terms. We first focus on the GLB operation, the most commonly ....

Ait-Kaci, H. and Lincoln, P. LIFE: A Natural Language for Natural Language. Technical Report ACA-ST-074-88, Microelectronics and Computer Technology Corporation, Austin, TX (February 1988).

....immediat ni plus ancien, ce ne sont pas les elements qui determinent l ensemble, mais l ensemble qui determine les elements. GEORGES PEREC La vie, mode d emploi. 1 1 Introduction LIFE is a programming language originally conceived by Hassan At Kaci and his colleagues at MCC, in Austin, Texas [4, 5, 3]. It is a synthesis of three different programming paradigms: logic programming, functional programming and object oriented programming. 2 LIFE is a declarative logic based language that can be seen as a constraint language. It derives its syntax and resolution method from Prolog. Except for ....

....right hand side of = is not bound to X until run time. March 1994 Digital PRL Wild LIFE Handbook 13 Unifying with results in U: V: U:V: U:100 V:int U:V:100 5. 6 int fg car(wheels= 4) vehicle(wheels= N:int) car(wheels= N:4) int(luck= bad) 13(roman= XIII ) 13(roman= XIII ,luck= bad) A,B,C] [1,2,3] [A:1,B:2,C:3] H T] a,b,c,d] H:a T: b,c,d] X:s(s(X) Y:s(s(s(Y) X:Y:s(X) The unification of two terms corresponds to testing whether the intersection of the two sets of records described by the two terms is empty. If it is nonempty, then the unification yields a term that describes the ....

[Article contains additional citation context not shown here]

Hassan At-Kaci and Patrick Lincoln. LIFE---A natural language for natural language. T.A. Informations, 30(1--2):37--67 (1989). Association pour le Traitement Automatique des Langues, Paris, France.

No context found.

Hassan Ait-Kaci and Patrick Lincoln. LIFE: A natural language for natural language. Technical Report ACA-ST-074-88, MCC, 1988.

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