Results 1  10
of
12
A Modal Perspective on the Computational Complexity of Attribute Value Grammar
, 1992
"... Many of the formalisms; used in Attribute Value grammar are notational variants of languages of propositional modal logic,. and testing whether two Attribute Value descriptions unify amounts to testing for modal satisfiability. In this paper we put this. observation to work. We study the complexit ..."
Abstract

Cited by 49 (7 self)
 Add to MetaCart
Many of the formalisms; used in Attribute Value grammar are notational variants of languages of propositional modal logic,. and testing whether two Attribute Value descriptions unify amounts to testing for modal satisfiability. In this paper we put this. observation to work. We study the complexity of the satisfiability problem for nine modal languages which mirror different aspects of AVS description formalisms, including the ability to express reeintrancy, the ability to express generalisations, and the ability to express recursive constraints. Two mail techniques axe used: either Kripke models with desirable properties are constructed, or modalities are used to simulate fragments of Propositional Dynamic Logic. Further possibilities for the application of modal logic in computational linguistics are noted
Feature Logics
 HANDBOOK OF LOGIC AND LANGUAGE, EDITED BY VAN BENTHEM & TER MEULEN
, 1994
"... Feature logics form a class of specialized logics which have proven especially useful in classifying and constraining the linguistic objects known as feature structures. Linguistically, these structures have their origin in the work of the Prague school of linguistics, followed by the work of Chom ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
Feature logics form a class of specialized logics which have proven especially useful in classifying and constraining the linguistic objects known as feature structures. Linguistically, these structures have their origin in the work of the Prague school of linguistics, followed by the work of Chomsky and Halle in The Sound Pattern of English [16]. Feature structures have been reinvented several times by computer scientists: in the theory of data structures, where they are known as record structures, in artificial intelligence, where they are known as frame or slotvalue structures, in the theory of data bases, where they are called "complex objects", and in computati
Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto
 Logic Journal of IGPL
, 2000
"... This paper is about the good side of modal logic, the bad side of modal logic, and how hybrid logic takes the good and xes the bad. In essence, modal logic is a simple formalism for working with relational structures (or multigraphs) . But modal logic has no mechanism for referring to or reasoning ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
This paper is about the good side of modal logic, the bad side of modal logic, and how hybrid logic takes the good and xes the bad. In essence, modal logic is a simple formalism for working with relational structures (or multigraphs) . But modal logic has no mechanism for referring to or reasoning about the individual nodes in such structures, and this lessens its eectiveness as a representation formalism. In their simplest form, hybrid logics are upgraded modal logics in which reference to individual nodes is possible. But hybrid logic is a rather unusual modal upgrade. It pushes one simple idea as far as it will go: represent all information as formulas. This turns out to be the key needed to draw together a surprisingly diverse range of work (for example, feature logic, description logic and labelled deduction) . Moreover, it displays a number of knowledge representation issues in a new light, notably the importance of sorting. Keywords: Labelled deduction, description logic, f...
ConstraintBased Semantics
, 1991
"... Montague's famous characterization of the homomorphic relation between syntax and semantics naturally gives way in computational applications to constraintbased formulations. This was originally motivated by the close harmony it provides with syntax, which is universally processed in a constra ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
Montague's famous characterization of the homomorphic relation between syntax and semantics naturally gives way in computational applications to constraintbased formulations. This was originally motivated by the close harmony it provides with syntax, which is universally processed in a constraintbased fashion. Employing the same processing discipline in syntax and semantics allows that their processing (and indeed other processing) can be as tightly coupled as one wishes  indeed, there needn't be any fundamental distinction between them at all. In this paper, we point out several advantages of the constraintbased view of semantics processing over standard views. These include (i) the opportunity to incorporate nonsyntactic constraints on semantics, such as those arising from phonology and context; (ii) the opportunity to formulate principles which generalize over syntax and semantics, such as those found in headdriven phrase structure grammar; (iii) a characterization of semantic ...
TDL  A Type Description Language for HPSG  Part 1: Overview
, 1994
"... Unificationbased grammar formalisms have become the predominant paradigm in natural language processing (NLP) and computational linguistics (CL). Their success stems from the fact that they can be seen as highlevel declarative programming languages for linguists, which allow them to express lin ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Unificationbased grammar formalisms have become the predominant paradigm in natural language processing (NLP) and computational linguistics (CL). Their success stems from the fact that they can be seen as highlevel declarative programming languages for linguists, which allow them to express linguistic knowledge in a monotonic fashion. Moreover, such formalisms can be given a precise, settheoretical semantics. This paper presents TDL, a typed featurebased language and inference system, which is specifically designed to support highly lexicalized grammar theories like HPSG, FUG, or CUG. TDL allows the user to define (possibly recursive) hierarchicallyordered types, consisting of type constraints and feature constraints over the boolean connectives , , and :. TDL distinguishes between avm types (openworld reasoning), sort types (closedworld reasoning), builtin types and atoms, and allows the declaration of partitions and incompatible types. Working with partially as ...
Evaluating complex constraints in linguistic formalisms
 IN PROCEEDINGS OF WORKSHOP W2 AT THE 10TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE: COPING
, 1992
"... In this paper we consider the problem of incorporating mechanisms for expressing abstractions and generalisations into constraintbased formalisms for linguistic description. Much recent work has been done on the denotational semantics of these languages, rather less on their suitability for the ta ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we consider the problem of incorporating mechanisms for expressing abstractions and generalisations into constraintbased formalisms for linguistic description. Much recent work has been done on the denotational semantics of these languages, rather less on their suitability for the task of producing realistically large linguistic descriptions (their "phenomenological" semantics) and on the desiderata for their empirical computational behaviour (their operational semantics). In essence, an adequate formalism should have the properties both of a good programming language and of a support for theory construction.
clauses and featurestructure logic: Principles and unification algorithms, LLI
, 1993
"... The desirability of Horn clauses in logical deductive systems has long been recognized. The reasons are at least threefold. Firstly, while inference algorithms for full logics of any reasonable extent are typically intractable, for systems restricted to Horn clauses the picture is much better. (For ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The desirability of Horn clauses in logical deductive systems has long been recognized. The reasons are at least threefold. Firstly, while inference algorithms for full logics of any reasonable extent are typically intractable, for systems restricted to Horn clauses the picture is much better. (For example, in ordinary propositional logic, while the full satisfiability problem is NPcomplete, a lineartime algorithm exists for Horn clauses.) Secondly, the knowledgerepresentation capabilities of Horn clauses, while weaker than those of the full logic, remain remarkably rich; indeed, far richer than that of simple conjunctive logic alone. Thirdly, Horn clauses define the maximal subset of a full logic which has the property of admitting generic models, which roughly means that for any set of Horn clauses, there is a least model of the clauses in that set. It is the purpose of this paper to initiate an investigation of Horn clause logic for an extended class of feature structures. After laying the groundwork for this context, we provide two key results. In the first, we show how the property of admitting
Grammars, Deductive Systems, and Parsing
 Invited talk at the ESF Conference on Logic, Language and Information, Autrans
, 1992
"... Many theories of grammar and styles of grammar specification have stemmed from mathematical logic, computer science, and computational linguistics, and have been used for describing natural languages. By a series of constructions, we relate categorial, attribute and logic grammars via (axiomatic) la ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Many theories of grammar and styles of grammar specification have stemmed from mathematical logic, computer science, and computational linguistics, and have been used for describing natural languages. By a series of constructions, we relate categorial, attribute and logic grammars via (axiomatic) labelled deductive systems, and extend this relation to accommodate unificationbased grammars and socalled Montague Grammar. The axioms of a labelled deductive system can also be used to constrain the proof search by automatically generating an LR parser from them; we describe the implementation of such a parsergenerator. Furthermore, we show how a modification of the LR parsing algorithm, plus the (metalevel) information contained in the axioms, can be used to parse a grammar specification which is based on procedural rather than combinatorial properties of the language. 1 Introduction Many theories of grammar have been proposed in theoretical linguistics, computational linguistics, com...
Suggestions for a Nonmonotonic Feature Logic
, 1995
"... We use Scott's domain theory and methods from Reiter's default logic to suggest some ways of modelling default constraints in feature logic. We show how default feature rules, derived from default constraints, can be used to give ways to augment strict feature structures with default info ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We use Scott's domain theory and methods from Reiter's default logic to suggest some ways of modelling default constraints in feature logic. We show how default feature rules, derived from default constraints, can be used to give ways to augment strict feature structures with default information.
Logic Journal of the IGPL 8:3
, 2000
"... Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm ..."
Abstract
 Add to MetaCart
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm that decides satisfiability of the DL ALC extended with transitive and inverse roles and functional restrictions with respect to general concept inclusion axioms and role hierarchies; early experiments indicate that this algorithm is wellsuited for implementation. Additionally, we show that ALC extended with just transitive and inverse roles is still in PSpace.We investigate the limits of decidability for this family of DLs, showing that relaxing the constraints placed on the kinds of roles used in number restrictions leads to the undecidability of all inference problems. Finally, we describe a number of optimisation techniques that are crucial in obtaining implementations of the decis...