This paper reports on an approach to model generalized implicatures using nonmonotonic logics. The approach, called compositional, is based on the idea of compositional semantics, where the implicatures carried by a sentence are constructed from the implicatures carried by its constituents, but it also includes some aspects nonmonotonic logics in order to model the defeasibility of generalized implicatures.

The idea that natural language grammar and planned action are relatedsystems has been implicit in psychological theory for more than acentury. However, formal theories in the two domains have tendedto look very different. This article argues that both faculties sharethe formal character of applicative systems based on operationscorresponding to the same two combinatory operations, namely functional composition and type-raising. Viewing them in thisway suggests simpler and more cognitively plausible accounts of bothsystems, and suggests that the language faculty evolved in the (...) speciesand develops in children by a rather direct adaptation of a moreprimitive apparatus for planning purposive action in the world bycomposing affordances of objects or tools. Theknowledge representation that underlies such planning is alsoreflected in the natural language semantics of tense, mood, andaspect, which the paper begins by arguing provides the key tounderstanding both systems. (shrink)

In the present study, using event-related functional magnetic resonance imaging, we investigated a group of participants on a grammaticality classification task after they had been exposed to well-formed consonant strings generated from an artificial regular grammar. We used an implicit acquisition paradigm in which the participants were exposed to positive examples. The objective of this studywas to investigate whether brain regions related to language processing overlap with the brain regions activated by the grammaticality classification task used in the present study. (...) Recent meta-analyses of functional neuroimaging studies indicate that syntactic processing is related to the left inferior frontal gyrus (Brodmann's areas 44 and 45) or Broca's region. In the present study, we observed that artificial grammaticality violations activated Broca's region in all participants. This observation lends some support to the suggestions that artificial grammar learning represents a model for investigating aspects of language learning in infants [TICS 4 (2000) 178] and adults [Proceedings of the National Academy of Sciences of United States of America 99 (2002) 529]. (shrink)

In the present study, using event-related functional magnetic resonance imaging, we investigated a group of participants on a grammaticality classification task after they had been exposed to well-formed consonant strings generated from an artificial regular grammar. We used an implicit acquisition paradigm in which the participants were exposed to positive examples. The objective of this studywas to investigate whether brain regions related to language processing overlap with the brain regions activated by the grammaticality classification task used in the present study. (...) Recent meta-analyses of functional neuroimaging studies indicate that syntactic processing is related to the left inferior frontal gyrus (Brodmann's areas 44 and 45) or Broca's region. In the present study, we observed that artificial grammaticality violations activated Broca's region in all participants. This observation lends some support to the suggestions that artificial grammar learning represents a model for investigating aspects of language learning in infants [TICS 4 (2000) 178] and adults [Proceedings of the National Academy of Sciences of United States of America 99 (2002) 529]. (shrink)

This paper presents a new language for isomorphic representations of legalknowledge in feature structures. The language includes predefinedstructures based on situation theory for common-sense categories, andpredefined structures based on Van Kralingens frame-based conceptualmodelling language for legal rules. It is shown that the flexibility of thefeature-structure formalism can exploited to allow for structure-preservingrepresentations of non-primitive concepts, and to enable various types ofinteraction and cross- reference between language elements. A fragment of theDutch Opium Act is used to illustrate how modelling and reasoning (...) proceed in practice. (shrink)

This article will provide a unifying perspective on perception and cognition via the route of linguistic representations of emotion. Linguistic representations of emotions provide a fertile ground for explorations into the nature and form of integration of perception and cognition because emotion has facets of both perceptual and cognitive processes. In particular, this article shows that certain types of linguistic representations of emotion allow for the integration of perception and cognition through a series of steps and operations in cognitive systems, (...) whereas certain other linguistic representations of emotion are not so representationally structured as to permit the unity of perception and cognition. It turns out that the types of linguistic representations of emotion that readily permit the desired unity of perception and cognition are exactly those that are linguistically encoded emotive representations of everyday objects, events, and things around us. It is these ordinary objects, events and things that provide the scaffolding for task-dependent or goal-oriented activities of cognitive systems including autonomous systems. In this way, cognitive systems can be saliently tuned to the outer world by being motivated and also subtly governed by emotion-driven representations. This helps not only tie together perceptual and cognitive processes via the interface between language and emotive representations, but also reveal the limits of emotive representations in amalgamating perceptual and cognitive processes in cognitive systems. (shrink)

We define an order independent version of default unification on typed feature structures. The operation is one where default information in a feature structure typed with a more specific type, will override default information in a feature structure typed with a more general type, where specificity is defined by the subtyping relation in the type hierarchy. The operation is also able to handle feature structures where reentrancies are default. We provide a formal semantics, prove order independence and demonstrate the utility (...) of this version of default unification in several linguistic applications. First, we show how it can be used to define multiple orthogonal default inheritance in the lexicon in a fully declarative fashion. Secondly, we show how default lexical specifications (introduced via default lexical inheritance) can be made to usefully persist beyond the lexicon and interact with syntagmatic rules. Finally, we outline how persistent default unification might underpin default feature propagation principles and a more restrictive and constraint-based approach to lexical rules. (shrink)

This paper investigates whether the fundamental linguistic insights and intuitions of Lexical Functional Grammar, which is usually presented as a constraint-based linguistic theory, can be reformulated in a resource sensitive framework using a substructural modal logic. In the approach investigated here, LFG's f-descriptions are replaced with expressions from a multi-modal propositional logic. In effect, the feature structure unification basis of LFG's f-structures is replaced with a very different resource based mechanism. It turns out that some linguistic analyses that required non-monotonic (...) devices in LFG analysis of Icelandic) can be straightforwardly expressed in the framework presented here. Moreover, a Curry– Howard correspondence between proofs in this logic and -terms provides a semantic interpretation as a by-product of the process of showing syntactic well-formedness. (shrink)

Unification grammars are known to be Turing-equivalent; given a grammar G and a word w, it is undecidable whether w L(G). In order to ensure decidability, several constraints on grammars, commonly known as off-line parsability (OLP), were suggested, such that the recognition problem is decidable for grammars which satisfy OLP. An open question is whether it is decidable if a given grammar satisfies OLP. In this paper we investigate various definitions of OLP and discuss their interrelations, proving that some of (...) the OLP variants are indeed undecidable. We then present a novel, decidable OLP constraint which is more liberal than the existing decidable ones. (shrink)

Framed in psychological terms, the basic question of linguistic theory is what is stored in memory, and in what form. Traditionally, what is stored is divided into grammar and lexicon, where grammar contains the rules and the lexicon is an unstructured list of exceptions. We develop an alternative view in which rules of grammar are simply lexical items that contain variables, and in which rules have two functions. In their generative function, they are used to build novel structures, just as (...) in traditional generative linguistics. In their relational function, they capture generalizations over stored items in the lexicon, a role not seriously explored in traditional linguistic theory. The result is a highly structured lexicon with rich patterns among stored items. We further explore the possibility that this sort of structuring is not specific to language, but appears in other cognitive domains as well, such as the structure of physical objects, of music, and of geographical and social knowledge. The differences among cognitive domains do not lie in this overall texture, but in the materials over which stored relations are defined. The challenge is to develop theories of representation in these other domains comparable to that for language. (shrink)

The theory of frames has recently been proposed as a universal format for knowledge representation in language, cognition and science. Frames represent categories as well as individual objects and events in terms of recursive attribute-value structures. In this paper, we would like to explore the potential ontological commitments of frame-based knowledge representations, with particular emphasis on the ontological status of the possessors of quality attributes in individual object frames. While not strictly incompatible with nominalistic, bundle- or substratum-theoretic approaches to the (...) metaphysics of particular objects, it will be argued that representing objects in terms of attribute-value structures is more in accordance with a tradition that can be traced back to Aristotle’s doctrine of physical substances. Attributes appear to describe primary potentialities of objects, which, in the Aristotelian view, are the unchangeable nature or essence, hence substance, of any separate object. (shrink)

This article presents a detailed formal approach to concepts and concept combination. Sense generation is a competence‐level theory that attempts to respect constraints from the various cognitive sciences, and postulates “quasi‐classical” conceptual structures where attributes receive only one value (but are defeasible and so do not represent necessary and sufficient conditions on category membership) and where classification is binary (but explicitly context‐sensitive). It is also argued that any general theory of concepts must account for “privative” combinations (e.g., stone lion, fake (...) gun, apparent friend) as extreme test‐cases of representational and classificatory flexibility. The approach presented therefore provides a treatment of these combinations. The approach differentiates between the “lexical concept” (the stable information represented in a mental lexicon) which acts as a base from which the various “senses” (flexible contents associated with words and phrases in context, and used in classification) are “generated.” Generation allows nonmonotonicity, so that in different circumstances, different attributes may be defeated or modified. Classification is treated as relative to the perspective adopted, so that a classification acceptable from one perspective may be unacceptable from another, without contradiction. The result is a view that assumes bottom‐up priority in concept combination, where the range of senses generated by bottom‐up rules of combination is tempered by pragmatic‐communicative constraints on classification. An account of the representational and classification behavior of privative combinations is outlined, and the article concludes with a discussion of some of the implications of the approach. (shrink)

Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unification grammars. Even with restricted variants of the formalism, off-line parsable grammars, the problem is computationally hard. We present two natural constraints on unification grammars which limit their expressivity and allow for efficient processing. We first show that non-reentrant unification grammars generate exactly the class of context-free languages. We then relax the constraint and show that one-reentrant (...) unification grammars generate exactly the class of mildly context-sensitive languages. We thus relate the commonly used and linguistically motivated formalism of unification grammars to more restricted, computationally tractable classes of languages. (shrink)

Many of the formalisms used in Attribute Value grammar are notational variants of languages of propositional modal logic, and testing whether two Attribute Value Structures 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 re-entrancy, the ability to express generalisations, and the ability to express recursive constraints. Two main (...) techniques are 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. (shrink)

Paulina Sliwa (2015) argues that knowing why p is necessary and sufficient for understanding why p. She tries to rebut recent attacks against the necessity and sufficiency claims, and explains the gradability of understanding why in terms of knowledge. I argue that her attempts do not succeed, but I indicate more promising ways to defend reductionism about understanding why throughout the discussion.

Ambiguities in natural language can multiply so fast that no person or machine can be expected to process a text of even moderate length by enumerating all possible disambiguations. A sentence containing $n$ scope bearing elements which are freely permutable will have $n!$ readings, if there are no other, say lexical or syntactic, sources of ambiguity. A series of $m$ such sentences would lead to $(n!)^m$ possibilities. All in all the growth of possibilities will be so fast that generating readings (...) first and testing their acceptability afterwards will not be feasible. -/- This insight has led a series of researchers to adopt a level of representation at which ambiguities remain unresolved. The idea here is not to generate and test many possible interpretations but to first generate one `underspecified' representation which in a sense represents all its complete specifications and then use whatever information is available to further specify the result. -/- One central hypothesis in the paper will be that the relation between an underspecified representation and its full representations is not so much the relation between one structure and a set of other structures but is in fact the relation between a description (a set of logical sentences) and its models. (shrink)