M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Publications, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....types with LOGIN s feature types. Feature Logic [Smo88a, Smo89] is a decidable logic that generalizes Ait Kaci s formalism by adding negation and quantification. Feature Logic makes explicit that Ait Kaci s terms, the feature descriptions developed by computational linguists [KB82, RK86, Joh88] and the knowledge representation language KL ONE [BS85, LB87, Neb89, SSS91, NS90] are all closely related members of the same family of logics. These logics offer attributive concept descriptions that are interpreted as sets and are built from sorts and binary relations (called attributes, ....

....calculus and led to the development of Feature Logic [Smo88a, Smo89] a decidable logic that generalizes Ait Kaci s formalism by adding negation and quantification. Feature Logic makes explicit that Ait Kaci s terms, the feature descriptions developed by computational linguists [KB82, RK86, Joh88] and the knowledge representation language KL ONE [BS85, LB87, Neb89, SSS91, NS90] are all closely related members of the same family of logics. These logics offer attributive concept descriptions that are interpreted as sets and are built from sorts and binary relations (called attributes, ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, 1988.

.... John sings a song . The features appear as edges of the graph. The terminal nodes are atoms representing primitive linguistic objects. Kasper and Rounds [10, 17] were the first to capture the relation between feature descriptions and linguistics objects in terms of a logic. Subsequently, Johnson [6] and Smolka [22, 23] realized that feature logics can be modeled straightforwardly in Predicate Logic. In this approach, which underlies the present paper, a domain of linguistic objects is called a feature algebra and is simply a structure that interprets atoms as pairwise distinct individuals ....

M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, Cal., 1988.

....descriptions in logic programming has been advocated and studied [3, 4, 5, 6, 21] Essentially, feature descriptions provide a logical version of records, a data structure found in many programming languages. Feature descriptions have been proposed in various forms with various formalizations [1, 2, 14, 18, 11, 20, 7, 12]. We will follow the logical approach pioneered by [20] which accommodates feature descriptions as standard first order formulae interpreted in first order structures. In this approach, a semantics for feature descriptions can be given by means of a feature theory (i.e. a set of closed feature ....

M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, CA, 1988.

....[Bouma et al. 88] are used as con straints to describe declaratively what proper ties should be assigned to a linguistic entity. In the lst few years, the study of the forreal semantics and formal properties of losics involving such constraints has made substan tial progress [Kasper Rounds 86, Johnson 87, Smolka 88, Smolka 89] e.g. by making precise which sublanguages of predicate logic it corre sponds to. This paves the way not only for reliable implementations of these formalisms, but also for extensions of the basic logic with a precisely defined meaning. The extension we present here, weak ....

Mark Jolmson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16, CSLI, Stanford University, 1987.

....called feature structures [40] or feature terms [46] In contrast to earlier work, the notion feature structure was mostly used for designating a record structure itself [14, 39, 42] rather than a record description. Logical descriptions of record structures lead to the notion of feature logic [25, 23, 46]. When we call these descriptions feature constraints, feature unification becomes constraint solving. Two main approaches to feature logics should be clearly distinguished. In computational linguistics [14, 39, 42] a record structure is traditionally described from an internal perspective, i.e. ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. Number 16 in CSLI Lecture Notes. Center for the Study of Language and Information, 1988.

....has been recognized as a powerful description language for feature trees. For the first area, this is immediate by the role of constraints in constraint logic programming [19] and in concurrent constrained based languages [26] while in the second area different approaches have been proposed. [24, 27, 20, 25] have advocated the use of predicate logic as feature description languages. 6] argues that predicate logic is the right language to express phenomena in both fields, and that feature trees constitute the canonical semantical model. Feature trees [4] are possibly infinite, finitely branching ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, CA, 1988. 26

....is sung is given by the object of the sentence. Moreover, the graph states that the tense of the sentence is present. Two kinds of feature descriptions have been developed. Bresnan and Kaplan s LexicalFunctional Grammar [17] Shieber s patr ii formalism [46] and Johnson s Attribute Value Logic [16] employ boolean combinations of equations built from features (used as unary functions) atoms (used as constants) and variables. Kay s Functional Unification Grammar [24, 25, 26] Ait Kaci s Term Calculus [2, 3, 4] and Kasper and Rounds logic [23, 39] employ set denoting expressions, called ....

....with equality. This reduction to a very well understood framework is surprisingly natural and brings much simplicity and clarity. This approach is already suggested by Bresnan and Kaplan s pioneering paper on Lexical Functional Grammar [17] and has been worked out further in Johnson s dissertation [16]. However, the present paper, which is an elaboration of [47] shows for the first time that the feature term descriptions of Kay, Ait Kaci, and Kasper and Rounds can be embedded as well into predicate logic. It turns out that feature terms are merely a syntactic extension, which can be eliminated ....

[Article contains additional citation context not shown here]

M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, CA, 1988.

....equivalent to the decidability (in the classical sense) of the p acceptation prob lem. In other words: See footnote 17. These papers do not use the concept (or, a forttort, the terminology) finite enumerability of parsing , which, to my knowledge, appears here for the first time (see however [6], for the related notion of Universal Parsing Problem ) 24 p enumeration is discoverable if and only if p acceptation is decidable. 16 Enumerability . By the definition of a grammar as being a recursively enumerable mechanism, and by property (2) r is enumerable on any spe cialization ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI lecture note No. 16. Center for the Study of Language and Information, Stanford, CA, 1988.

.... et al. 1996, Lascarides Copestake 1999) which is an extension of a Kasper Rounds logic (Rounds Kasper 1986, Moshier Rounds 1987, Carpenter 1992) The ontological assumptions and formal properties of a KasperRounds logic differ in crucial respects from those of an Attribute Value logic (Johnson 1988, Smolka 1988, King 1989) and King (1994) shows that only the latter is compatible with the assumptions of HPSG as proposed in Pollard Sag (1994) Since it is unclear how defaults could be integrated into an Attribute Value logic and therefore into the setup of HPSG discussed here, a discussion ....

Johnson, M., 1988. Attribute-value Logic and the Theory of Grammar, vol. 16 of CSLI Lecture Notes. Stanford, CA: CSLI Publications.

....which stand in a one to one relation with linguistic objects, as in HPSG II. Apart from the philosophical consequences (which will not be discussed here) this gap between HPSG II and King (1989) can 13 cf. Rounds and Kasper (1986) Moshier and Rounds (1987) and Carpenter (1992) 14 cf. Johnson (1988), Smolka (1988) and King (1989) 15 Note that the theories in an HPSG II architecture are formulated using implications on types; in fact, even stronger implicative statements with complex antecedents are used. We will see on pp. 15 of section 3.2.1 how certain stronger implicative statements ....

Johnson, M. 1988. Attribute-value Logic and the Theory of Grammar. Vol. 16 of CSLI Lecture Notes. Stanford, CA: CSLI.

....proof of this fact, based on a comparison of proof trees for the original and the transformed grammar, is given in [2] 7 His paper does not state termination conditions for the transformed program. Such termination conditions would probably involve some generalized notion of offline parsability [6, 5, 13]. By contrast, we prove termination only for DCGs which are OP in the original sense of Pereira and Warren, but this case seems to us to represent much of the core issue, and to lead to some direct extensions. For instance, the DCG transformation proposed here can be directly applied to guided ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI lecture note No. 16. Center for the Study of Language and Information, Stanford, CA, 1988.

....but does not unify with the following feature bundle: 4) lex=house,string=houses,cat=v,agr= per=3,num=sing because of conflicting values for the feature cat . This type of unification is at the heart of all unification based grammar formalisms [Johnson 1988; Shieber 1986; Kay 1984] In addition, negative and disjunctive constraints impose conditions on feature values, which are evaluated lazily , i.e. only when sufficient information is present within a feature bundle to unambiguously resolve the constraint. Thus, the following feature bundle: 5) ....

Johnson, Mark (1988) Attribute--Value Logic and the Theory of Grammar, CSLI Lecture Notes 16, Stanford:CSLI.

....Rather than give a general outline here, let us consider the particular case of attribute value logic. 3.3 Application to Attribute Value Logic Attribute value logic is used by both LFG and unification based grammars. We will start with a simple version of the rewriting formalism given in Johnson[5]. For our purposes, we only need two of the rewriting rules that Johnson defines[5, pp. 38 39] t 1 t 2 , t 2 t 1 when kt 1 k kt 2 k (kt i k is Johnson s norm for terms. 5) t 2 t 1 OE) t 2 t 1 OE[t 2 =t 1 ] where OE contains t 2 and kt 2 k kt 1 k (OE[t 2 =t 1 ] denotes OE with ....

Johnson, M. (1988). Attribute-Value Logic and the Theory of Grammar. Ph.D. Thesis. Stanford University.

....in so called unification grammars [13, 12] developed for natural language processing, and also the formalisms of Mukai [17, 18] These early feature structure formalism were presented in a nonlogical form. Major steps in the process of their understanding and logical reformulation are the articles [20, 23, 11, 22]. Feature trees, the feature tree structure T , and the axiomatization of T were first given in [6] The paper is organized as follows. Section 2 defines the basic notions and discusses the differences in expressivity between Herbrand and FT. Section 3 gives a basic simplification system that ....

M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, CA, 1988.

....a specific formal framework. Now, properties of classes of structures that are defined in some formal way are the provenance of Model Theory. It s not surprising, then, to find treatments of the meaning of such systems of constraints couched in terms of formal logic [KR86, MR87, KR90, GPC 88, Joh88, Smo89, DVS90, Car92, Kel93] More recently, the role of logic has begun to expand beyond just providing formal semantics for the constraints to provide the entire linguistic formalism. See, for instance, Joh89, Sta92, Cor92, BGMV93, BMV94, Kel93, Rog94, Kra95] and, anticipating all of these, ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. Number 16 in CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, CA, 1988.

....for greater empiricism in phonological research. 2 Constraints as partial descriptions It is surely uncontroversial that phonology attempts to scientifically model aspects of a cognitive system and the physical system which signals it. Declarative Phonology adopts the distinction proposed by Johnson (1988) and Kaplan and Bresnan (1982) between linguistic objects and the formal theoretical descriptions of these objects. A formal description usually consists of the rules of a generative grammar (1) or particular representations generated by the rules (2) 1) a. s (onset) rime b. rime nucleus ....

Johnson, Mark (1988). Attribute-value logic and the theory of grammar. Stanford: CSLI, Stanford University.

....est fondamentale et n ecessite la pr esentation de quelques notions plus formelles. Une structure de traits est consitu ee comme chacun sait d un ensemble de traits formant des couples attribut valeur. Les caract eristiques essentielles d une structure de traits sont, comme l indique Johnson (cf. Johnson88] les suivantes : ffl les el ements de la structure sont atomiques ou complexes, ffl la structure interne d un el ement est d efinie par ses attributs et ses valeurs, ffl les valeurs peuvent etre partag ees. Le m ecanisme de partage de valeurs est central en HPSG et permet de d ecrire un ....

Johnson M. (1988), Attribute-Value Logic and the Theory of Grammar, CSLI Lecture Notes, Chicago University Press.

....from the same node labeled the same way, is an AVS of such a signature. The ve graphs given earlier are examples of such AVSs. The de nition subsumes the better known de nitions of Attribute Value Structures found in the literature, and in particular those of Gazdar et al. [10] 9] Johnson [12], and Kasper and Rounds [14] Moreover it s not too liberal. There are only two reasonably common further restrictions on the binary relations that it does not impose. The rst of these is acyclicity, which means that it is never possible to return to a node n by following some sequence of R l ....

M. Johnson, 1988, Attribute-Value Logic and the Theory of Grammar, CSLI Lecture Notes Series, University of Chicago Press.

.... words: given an arbitrary NFA, we can always construct a deterministic one which recognizes the same language (however, in the worst case with exponentially more states) 1 In the following, we will assume a basic familiarity with unification based grammar theories [23, 25] and their logics [9, 7, 24]. 3 Fortunately, our approach is also capable of directly representing and processing non deterministic FA with ffl moves, and allows for edges which are multiplesymbol consumers (see next section) It is worth noting that edges may not only be annotated with atomic symbols. They can also be ....

Mark Johnson. Attribute Value Logic and the Theory of Grammar. CSLI Lecture Notes, Number 16. Center for the Study of Language and Information, Stanford, 1988.

....in Morphe is represented by a value. It consists of a collection of features, each of which is a pair (em label, value) The term feature comes from the terminology used in linguistic grammar formalisms based on feature structure unification [Karttunen 84, Kasper and Rounds 86, Shieber 86, Johnson 88] Feature structures have also been used as a basis for incorporating object oriented concepts into logic programming language frameworks [Ait Kaci and Podelski 91, Kifer and Lausen 89, Yasukawa et al. 92] 3.2 Subsumption Atoms and all other values in Morphe are partially ordered according to ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. Center for the Study of Language and Information, 1988.

....are basically two flavors of such formalisms. In one school, which is currently represented most visibly by LFG [Kap89] the parsing process has a context free backbone, and the unification based formalism is used as a constraintenforcement mechanism to weed out incorrect parses. Both Johnson s [Joh88] and Shieber s books [Shi92] describe recent theoretical efforts in this direction. In the other school, which is currently represented most visibly by HPSG [PS87] the context free backbone is eschewed entirely. Rather, the entire parsing process becomes one of constraint satisfaction. This is a ....

Johnson, M., Attribute-Value Logic and the Theory of Grammar, CSLI, 1988.

....author was with IBM Deutschland. The author s article [23] is a more recent work on feature logics. 1 1 Introduction This paper presents a set description logic that generalizes and integrates formalisms that have been developed for knowledge representation [1, 2] and computational linguistics [13, 21, 11, 9]. The logic comes with an open world model theoretic semantics, where admissible worlds can be required to satisfy a classification scheme postulated by means of a sort lattice. The logic supports the typically partial description of objects using sorts and features as primitives. It is not ....

....negation. They show that the consistency problem of the extended logic is PSPACE complete. In contrast, classical negation, which underlies our logic, does not render the consistency problem any harder (it is already NP complete if just singletons, selection and union are available) Johnson s [9] attribute value logic is close to the unification grammar formalism LFG [10] It employs relational feature descriptions with classical negation, where agreement is expressed with variables. Like Rounds and Kasper s logic, Johnson s logic is interpreted over feature structures only. In contrast ....

[Article contains additional citation context not shown here]

M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, CA, 1988.

....the category data type. lleaf(Cat) dir = left cat = Cat rleaf(Cat) dir = right cat = Cat maxproj(CatName) root = CatName subcat = hi 4 The simulation of LFG s functional completeness and coherence constraints by subcategorization lists has been suggested independently by Johnson [5]. 3 LEXICALIZATION 9 Templates: category definitions complementizer : root = cp vl subcat = hrleaf(maxproj(vp) i adverb : root = vp subcat = rleaf root = vp subcat = SubCat fi fi fi fi fi SubCat verb(V erbClass) V erbClass v1 : root = vp subcat = h ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, Ca., 1988.

....is that of some theoretically inclined formal linguists and logicians, who regard feature structures as PARSING AS DYNAMIC INTERPRETATION 93 a relatively new kind of language for representating linguistic knowledge. Studies concerned with feature structures from this perspective are, for example, Johnson (1988), Carpenter (1992) Dorre Seiffert (1991) Kasper Rounds (1986) Smolka (1989) Moss (1990) These studies are primarily concerned with formal definitions of languages of feature structures and their formal properties. In the present chapter we consider feature structures also as ....

Johnson, M. (1988) Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16.

....Smolka s feature logic ( 15] from where negation has been omitted, but the disjunction operator and circular terms are still permitted. Other formalizations and implementations of feature terms, in particular those containing disjunctions, have been described e.g. by Kasper Rounds [10] Johnson [9], Maxwell Kaplan [12] Eisele Dorre [5] and Wedekind [16] The plan of this papers is as follows: In section 1.2, the syntax and the semantic of a basic feature type system is presented which corresponds essentially to a Horn system where first order terms have been replaced by feature terms. In ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, Ca., 1988.

....inefficient way to circumvent the conceptual difficulty caused by the presence of disjunction is to produce a disjunctive normal form and to handle the individual disjuncts by an adapted algorithm for first order term unification. Variants of this idea have been defined e.g. by Kasper [7] Johnson [6], and Smolka [12] At least two computation oriented proposals have been made which offer the possibility of early discovery of inconsistencies (Maxwell Kaplan [9] and Eisele Dorre [4] Both approaches are formulated as systems of rewrite rules. From a theorem proving perspective, however, a ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, Ca., 1988.

....be read as saying that x is a woman whose father is an engineer, whose husband is a painter and whose father and husband are both of the same age. Feature description have been proposed in various forms with various formalizations (Ait Kaci (1986) Kasper Rounds (1986) Rounds Kasper (1986) Johnson (1988), y This work was supported by a research grant, ITW 9002 0, from the German Bundesministerium fur Forschung und Technologie to the DFKI project DISCO 0747 7171 94 050421 35 08.00 0 c fl 1994 Academic Press Limited 422 R. Backofen Smolka (1992) Johnson (1991) We will follow the logical ....

Johnson, M. (1988). Attribute-Value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. CSLI.

....only phonological information is shown in Figure 1. It has an auxiliary list containing subtrees ff, fi and fl. Each of these subtrees is rooted by a pseudoterminal node (notice the hanging edges) For now, we will not distinguish between 2 This is consistent with the approach taken by Johnson [Joh88] where he introduces a language for describing attribute value structures. the functor and arguments subtrees. The value of the phonology attribute is a split string, where the location of the split is marked with a hyphen. Juxtaposition is used to represent concatenation, with capital letters ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. Centre for the Study of Language and Information, Stanford University, Stanford, CA, 1988.

....on. 10 M. Kracht July 24, 1996 a f is called internal in F if it is in F otherwise it is called external. F is called differentiated if it satisfies (8x) 8y) x = y: 8a 2 F) x 2 a: y 2 a) In terms of avms we can say that an avm is differentiated if points are reentrant iff identical. Johnson, 1988 ] calls these structures discernible. To use the terminology of [ Carpenter, 1992 ] an avm is differentiated if nodes are extensionally identical iff they are intensionally identical. Namely, reentrancy is by definition the sharing of the truth of all propositions alias structure. This merits ....

....the former case we note that a context free grammar even when it generates the right set of string will never generate the right kind of constituent structures. For the type of construction discussed below, the syntactic structure is in fact rather complex. We will not question it here and follow [ Johnson, 1988 ] Recall that nested sentences in English are syntactically unproblematic; the subordinate clause begins after the sequence of nominal complements is complete, e.g. in I told Mary not to let Bill help Peter. In German, the subordinate clauses can also be center embedded. da ich 1 ....

[Article contains additional citation context not shown here]

Mark Johnson. Attribute-Value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. CSLI, 1988.

.... John sings a song . The features appear as edges of the graph. The terminal nodes are atoms representing primitive linguistic objects. Kasper and Rounds [10, 17] were the first to capture the relation between feature descriptions and linguistics objects in terms of a logic. Subsequently, Johnson [6] and Smolka [22, 23] realized that feature logics can be modeled straightforwardly in Predicate Logic. 1 In this approach, which underlies the present paper, a domain of linguistic objects is called a feature algebra and is simply a structure that interprets atoms as pairwise distinct ....

M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, Cal., 1988.

....generate a set of trees, called c structures, each of which is paired with an f description. The yield of the c structure is a string of phonological words, which comprises the phonological form of this utterance. The f descriptions describe f structures, which are attribute value structures (Johnson, 1988; Johnson, 1991) In order for an utterance to be well formed its f description must be consistent (i.e. satisfied by some f structure) Moreover, the fdescription may contain additional constraints that a minimal f structure that satisfies the standard attribute value constraints must satisfy ....

Johnson, Mark. 1988. Attribute Value Logic and The Theory of Grammar. Number 16 in CSLI Lecture Notes Series. Chicago University Press.

....##### 2 ### ##### ## #### ### ##### #### ####### .####### ##### #### ## ###### ######### ##### # # #### ###### ###### ## #### ,#### #### ###### ## ##### ### ##### ###### .##### ####### ### ##### ##### ##### #### ###### . Shieber, 1986) ####### #### ####### ####### ###### ##### ####### ###### . (Johnson, 1988) ####### ##### ## ### #### ###### ######### ## ##### ## . unificands #######) ### ######### ## (#### ###) ##### ## ##### ### , unification) ##### ### ### #### .###### ###### ## ## ### ####### ### ###### ####### #### ## ##### ## ##### (Carpenter, 1992b) ####### ##### ##### #### ####### ## ##### ....

Johnson, Mark. 1988. Attribute-Value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes.

.... the KRL style logic that most closely resembles SRL with classical negation. This belief is false. Before showing how it is false I will show how it became prevalent, via a short detour into a formalism for another grammar, the LFG (lexical functional grammar) of [Kaplan and Bresnan 1982] [Johnson 1988] created AVL (attribute value logic) specifically to provide a formalism for LFG. Despite their independent development and a number of nontrivial technical differences, AVL and SRL have much in common, and it is natural to consider AVL and SRL sister logics, the former tailored to LFG, the latter ....

....Despite their independent development and a number of nontrivial technical differences, AVL and SRL have much in common, and it is natural to consider AVL and SRL sister logics, the former tailored to LFG, the latter to HPSG. In particular, both are concerned with objects, not partial information. [Johnson 1988] did outline an embedding of KRL within AVL that generalised subsumption from KRL to AVL, but [Johnson 1988] also warned that whereas subsumption formalises the partiality that underlies what [Johnson 1988] called unification approaches , it formalises nothing in AVL. Several researchers, ....

[Article contains additional citation context not shown here]

Mark Johnson. Attribute-value logic and the theory of grammar. CSLI lecture notes, volume 16. CSLI, Stanford, California, USA. 1988.

....sentences sub strings, subsub strings and so on. We will use feature structures to represent this information. There are many ways of viewing, defining and describing feature structures, e.g. as directed acyclic graphs [18] as finite deterministic automata [13] as models for first order logic [19, 20, 9], or as Kripke frames for modal logic [2] Here we use a slightly modified version of Kasper and Rounds [13] definition of feature structures, and we will later use a subset of the equations schemata used by LFG to describe these feature structures. As a basis we assume two predefined sets, one of ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. Number 14 in CSLI Lecture Notes. Center of the Study of Language and Information., Stanford University, California, USA, 1988.

.... describe the intended meaning and the obvious candidate, first order predicate calculus and its associated model theory, was used for this purpose [Schmolze and Israel, 1983; Brachman and Levesque, 1984] A similar process took place in the area of unification grammars [Kasper and Rounds, 1986; Johnson, 1987; Smolka, 1988] This logical reconstruction revealed in both cases that the formalisms correspond to subsets of ordinary first order predicate logic. Although this correspondence is very helpful for understanding the meaning of the formalism and yields a firm base for extensions, it does not help ....

....The feature logic described in Sect. 2 without union t and complement : which give essentially the terms mentioned above, was shown to have a quasi linear satisfiability problem [A it Kaci, 1984] The addition of union or complement leads to NP completeness, as shown in [Kasper, 1987; Johnson, 1987; Smolka, 1988] Attributive Description Formalisms : and the Rest of the World 10 The situation in terminological logics was more problematical because of the variety of possible concept and role forming operators. As mentioned above, for a long time it remained an open problem whether ....

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, Stanford, CA, 1987.

....we aim to derive similar computational advantages in semantic and contextual processing. At a more theoretical level, a question arises in unification based syntactic formalisms of whether feature structures are partial syntactic objects, or partial descriptions of (complete) syntactic objects [ Johnson, 1988; Keller, 1993 ] A similar question arises here. Underspecified semantic representations in monotonic semantics are best seen as partial descriptions of a certain kind of semantic object (semantic compositions) and not as partial semantic objects themselves: Traditionally, semantic ....

Johnson, M. 1988. Attribute-value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. CSLI, Stanford. Distributed by University of Chicago Press.

No context found.

M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Publications, 1988.

No context found.

Mark Johnson, 1988. Attribute Value Logic and Theory of Grammar. CSLI Lecture Notes Series, Chicago University Press.

No context found.

Mark Johnson, 1988. Attribute Value Logic and Theory of Grammar. CSLI Lecture Notes Series, Chicago University Press.

No context found.

Mark Johnson, 1988. Attribute Value Logic and Theory of Grammar. CSLI Lecture Notes Series, Chicago University Press.

No context found.

Mark Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16. Center for the Study of Language and Information, Stanford University, Stanford, CA, 1987.

No context found.

Johnson, M: 1988, Attribute Value Logic and the Theory of Grammar, CSLI Lecture Notes Series, University of Chicago Press: Chicago.

No context found.

Johnson, Mark, 1988. Attribute-Value Logic and the Theory of Grammar, number 16 in CSLI Lecture Notes, Center for the Study of Language and Information, Standford, CA.

No context found.

M. Johnson, Attribute-Value logic and the Theory of Grammar (CSLI Lecture Notes no. 16, 1988).

No context found.

M. Johnson. Attribute-Value Logic and the Theory of Grammar. CSLI, Stanford, 1988.

No context found.

Mark Johnson. Attribute-value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. CSLI, Stanford, Ca., 1988.

No context found.

Mark Johnson. 1988. Attribute-Value Logic and the Theory of Grammar. Number 16 in CSLI Lecture Notes.

No context found.

Johnson, M. (1988). Attribute-Value Logic and the Theory of Grammar, volume 14 of Lecture Notes.

No context found.

Johnson, Mark. 1988. Attribute Value Logic and the Theory of Grammar. Stanford: CSLI.

No context found.

M. Johnson, Attribute-Value logic and the Theory of Grammar (CSLI Lecture Notes no. 16, 1988).

First 50 documents  Next 50

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