Download Free The Logic Of Typed Feature Structures Book in PDF and EPUB Free Download. You can read online The Logic Of Typed Feature Structures and write the review.

This book develops the theory of typed feature structures, a new form of data structure that generalizes both the first-order terms of logic programs and feature-structures of unification-based grammars to include inheritance, typing, inequality, cycles and intensionality. It presents a synthesis of many existing ideas into a uniform framework, which serves as a logical foundation for grammars, logic programming and constraint-based reasoning systems. Throughout the text, a logical perspective is adopted that employs an attribute-value description language along with complete equational axiomatizations of the various systems of feature structures. Efficiency concerns are discussed and complexity and representability results are provided. The application of feature structures to phrase structure grammars is described and completeness results are shown for standard evaluation strategies. Definite clause logic programs are treated as a special case of phrase structure grammars. Constraint systems are introduced and an enumeration technique is given for solving arbitrary attribute-value logic constraints. This book with its innovative approach to data structures will be essential reading for researchers in computational linguistics, logic programming and knowledge representation. Its self-contained presentation makes it flexible enough to serve as both a research tool and a textbook.
Much of the work in modern formal linguistics is concerned with creating mathematically precise accounts of human languages—accounts that are particularly useful in research involving language processing with computers. Implementing Typed Feature Structure Grammars provides a student-level introduction to the most popular approach to this issue, and includes software that allows users to experiment with modeling different aspects of language.
This book develops the theory of typed feature structures and provides a logical foundation for logic programming and constraint based reasoning systems.
The articles collected in this volume present different aspects of the use of typed feature structures in theoretical and computational linguistics. It covers a wide range of linguistics theories (CCG, Construction Grammar, HPSG, LTAG), a wide range of linguistic phenomena (aspect, concord, idioms, passive), and a wide range of applications (parsing, question answering, semantic composition).
This Handbook documents the main trends in current research between logic and language, including its broader influence in computer science, linguistic theory and cognitive science. The history of the combined study of Logic and Linguistics goes back a long way, at least to the work of the scholastic philosophers in the Middle Ages. At the beginning of this century, the subject was revitalized through the pioneering efforts of Gottlob Frege, Bertrand Russell, and Polish philosophical logicians such as Kazimierz Ajdukiewicz. Around 1970, the landmark achievements of Richard Montague established a junction between state-of-the-art mathematical logic and generative linguistic theory. Over the subsequent decades, this enterprise of Montague Grammar has flourished and diversified into a number of research programs with empirical and theoretical substance. This appears to be the first Handbook to bring logic-language interface to the fore. Both aspects of the interaction between logic and language are demonstrated in the book i.e. firstly, how logical systems are designed and modified in response to linguistic needs and secondly, how mathematical theory arises in this process and how it affects subsequent linguistic theory. The Handbook presents concise, impartial accounts of the topics covered. Where possible, an author and a commentator have cooperated to ensure the proper breadth and technical content of the papers. The Handbook is self-contained, and individual articles are of the highest quality.
Abstract: "Over the past decade or so, a number of approaches to natural language grammar have developed a notion of partially-specified, record-like data structures which have come to be known as feature structures. Feature structures provide for the representation of linguistic information in terms of attributes and associated values, and support a computationally efficient pattern-matching and information- combining operation called unification. For work in natural language processing, a sound theoretical understanding of the mathematical and computational properties of feature structures and the formalisms which employ them is of vital importance. To this end, researchers in computational linguistics have developed and investigated logical theories of feature structures: feature logics. This thesis makes two broad contributions to the application of feature logics in studying grammar formalisms and the representation of lingusitic [sic] knowledge. First, the feature logic introduced by Rounds and Kasper is extended to incorporate the linguistically useful device of functional uncertainty proposed by Kaplan and Zaenen. The extended language can be used to express certain kinds of infinite disjunction, and has application to the analysis of unbounded dependency constructions. Second, a simple and general method for handling recursion is proposed. A uniform logical language is developed which is sufficiently powerful to allow for the expression of recursive descriptions of feature structures, and can be viewed as a 'stand alone' formalism for representing grammars. The general approach emphasizes a view of grammar as a branch of model theory. Throughout the thesis, attention is given to both the formal properties and linguistic applications of the logical languages under discussion."
Includes tutorials, lectures, and refereed papers on all aspects of logic programming, including theoretical foundations, constraints, concurrency and parallelism, deductive databases, language design and implementation, nonmonotonic reasoning, and logic programming and the Internet. The International Conference on Logic Programming, sponsored by the Association for Logic Programming, includes tutorials, lectures, and refereed papers on all aspects of logic programming, including theoretical foundations, constraints, concurrency and parallelism, deductive databases, language design and implementation, nonmonotonic reasoning, and logic programming and the Internet.
This volume contains selected and thoroughly revised papers plus contributions from invited speakers presented at the First International Workshop on C- straint Solving and Language Processing, held in Roskilde, Denmark, September 1–3, 2004. Constraint Programming and Constraint Solving, in particular Constraint Logic Programming, appear to be a very promising platform, perhaps the most promising present platform, for bringing forward the state of the art in natural language processing, this due to the naturalness in speci?cation and the direct relation to e?cient implementation. Language, in the present context, may - fer to written and spoken language, formal and semiformal language, and even general input data to multimodal and pervasive systems, which can be handled in very much the same ways using constraint programming. The notion of constraints, with slightly di?ering meanings, apply in the ch- acterization of linguistic and cognitive phenomena, in formalized linguistic m- els as well as in implementation-oriented frameworks. Programming techniques for constraint solving have been, and still are, in a period with rapid devel- ment of new e?cient methods and paradigms from which language processing can pro?t. A common metaphor for human language processing is one big c- straintsolvingprocessinwhichthedi?erent(-lyspeci?ed)linguisticandcognitive phases take place in parallel and with mutual cooperation, which ?ts quite well with current constraint programming paradigms.