TAILIEUCHUNG - Báo cáo khoa học: "The Formal and Processing Models of CLG"

In this paper we present the tormal processing model of CLG, which has been influenced by the Constraint Logic Programming paradigm 18] 191. We show in what way it extends pure unilication based formalisms and how it achieves a sound implementation of classically interpreted first order logic while m a i n t a i n i n g practical computational behaviour by resorting to a simple set of constraint rewrite rules and a lazy evaluation model for constraints satisfaction thus avoiding the problem mentioned in I10] concerning the non-monotonic properties of negation and implication intcrpretcd in the. | The Formal and Processing Models of CLG Luis DAMAS Nelma MOREIRA University of Porto Campo Alegre 823 P-4000 Porto luis@ Abstract We present the formal processing model of CLG a logic grammar formalism based on complex constraint resolution. In particular we show how to monotonically extend terms and their unification to constrained terms and their resolution. The simple CLG constraint rewrite scheme is presented and its consequence for CLG s multiple delay model explained. Keywords Grammatical formalisms Complex constraint resolution. Introduction CLG is a family of grammar formalisms based on complex constraint resolution designed implemented and tested over the last three years. CLG grammars consist of the description of global and local constraints of linguistic objects as described in 1 and 2 For the more recent members of the CLG family global constraints consist of sort declarations and the definition of relation between sorts while local constraints consist of partial lexical and phrasal descriptions. The sorts definable in CLG are closed in a way akin to the ones used by UCG 13 . Relations over sorts represent the statement of linguistic principles in the spirit of HPSG 4 The constraint language is a classical first order language with the usual unary and binary logical connectives . negation conjunction disjunction I material implication - equivalence - and a restricted form of quantification V and 3 over finitely instantiatable domains. The interpretation of these connectives in CLG is strictly classical as in Smolka s FL 16 and Johnson s AVL 15 unlike the intuitionistic interpretation of negation of Moshier and Rounds 7 A more detailed Giovanni B. VARILE CEO Jean Monnel Bldg. B4 001 L-2920 Luxembourg nino@ description of CLG including its denotational semantics can be found in 2 . In this paper we present the formal processing model of CLG which has been influenced by the Constraint Logic Programming paradigm 18 9 . We show in .

• Báo cáo khoa học
• The Formal and Processing
• Models of CLG
• Giovanni B
• VARILE
• scientific reports
• model language
• process natural language
• Database system concepts
• The relational model
• Formal relational query languages
• Database design
• Relational database design
• Query processing
• Query optimization
• Information Sciences
• Intelligent tutoring system
• Supporting active learning
• Predictive parsing learning
• Formal language processing
• Dialog Control
• Natural Language System
• Dialog Control in a Natural Language System
• Expanding the Horizons
• Natural Language Interfaces
• Phil Hayes
• PROSPECTS OR PRACTICAL
• NATURAL LANGUAGE SYSTEMS
• Workshops
• NATURAL LANGUAGE
• INTERACTION WITH MACHINES
• Long Papers
• COMPUTER INTEBFACE DESIGN MURRAY TUROFF DEPARTMENT OF COMPUTER
• IiVFORMATION SCIENCE IIEW JERSEY INSTITUTE OF TECHNOLOGY
• EVALUATION OF NATURAL LANGUAGE
• INTERFACES TO DATABASE SYSTEMS
• A PANEL DISCUSSION
• database query system
• J
• Norwood Crout
• INTERFACES TO DATA BASE SYSTEMS
• Bozena Henisz
• INTERPRETING NATURAL LANGUAGE
• DATABASE UPDATES
• S
• Jermld Kaplan Jim David
• TRANSPORTABLE NATURAL LANGUAGE
• INTERFACES TO DATABASES
• Gary G
• Hendrlx and William H
• Lewis
• DATABASES THEORETICAL
• TECHNICAL ISSUES
• TRANSPORTABLE NATURAL LANGUAGE INTERFACES
• PROBLEMS AND TECHNIQUES
• Barbara J
• Grosz
• THEORETICAL TECHNICAL ISSUES
• NATURAL LANGUAGE ACCESS TO DATABASES
• R
• Petrick
• Domain Independent
• Database Access Systems
• ISSUES IN NATURAL LANGUAGE
• ACCESS TO DATABASES
• A LOGIC PROGRAMMING PERSPECTIVE
• Sharon C
• Salveter David Maier
• PLANNING NATURAL LANGUAGE
• EXPRESSIONS REFERRING
• Douglas E
• Appelt
• THE TEXT SYSTEM
• NATURAL LANGUAGE GENERATION
• Kathleen R
• M
• MENTING A DATABASE
• KNOWLEDGE REPRESENTATION
• THE KEY TO THE SELECTION PROBLEM
• E
• Jeffrey Conklin David D
• McDonald
• A KNOWLEDGE ENGINEERING
• NATURAL LANGUAGE UNDERSTANDING
• Stuart C
• Shapiro
• NATURAL LANGUAGE TEXTS
• NECESSARILY GRAMMATICAL
• EVEN COMPLETE
• UNGRAMHATICALITY
• EXTRA GRAMMATICALITY
• NATURAL LANGUAGE UNDERSTANDING SYSTEMS
• Taxonomy
• Descriptions
• Individuals in Natural
• Language Understanding
• The Use of Ooject Special Knowledge
• Natural Language Processing
• Mark H
• Bursteln