Towards the integration of functions, relations and types in an AI programming language

This paper describes the design and implementation of the programming language PC-Life. This language integrates the functional and the Logic-oriented programming style and feature types supporting inheritance. This combination yields a language particularly suited to knowledge representation, especially for application in computational linguistics

TDL--- A Type Description Language for Constraint-Based Grammars

This paper presents \tdl, a typed feature-based representation language and inference system. Type definitions in \tdl\ consist of type and feature constraints over the boolean connectives. \tdl\ supports open- and closed-world reasoning over types and allows for partitions and incompatible types. Working with partially as well as with fully expanded types is possible. Efficient reasoning in \tdl\ is accomplished through specialized modules.Comment: Will Appear in Proc. COLING-9

Bounded Modality

What does 'might' mean? One hypothesis is that 'It might be raining' is essentially an avowal of ignorance like 'For all I know, it's raining'. But it turns out these two constructions embed in different ways, in particular as parts of larger constructions like Wittgenstein's 'It might be raining and it's not' and Moore's 'It's raining and I don't know it', respectively. A variety of approaches have been developed to account for those differences. All approaches agree that both Moore sentences and Wittgenstein sentences are classically consistent. In this paper I argue against this consensus. I adduce a variety of new data which I argue can best be accounted for if we treat Wittgenstein sentences as being classically inconsistent. This creates a puzzle, since there is decisive reason to think that 'Might p' is classically consistent with 'Not p'. How can it also be that 'Might p and not p' and 'Not p and might p' are classically inconsistent? To make sense of this situation, I propose a new theory of epistemic modals and their interaction with embedding operators. This account makes sense of the subtle embedding behavior of epistemic modals, shedding new light on their meaning and, more broadly, the dynamics of information in natural language

Comparing Tag Scheme Variations Using an Abstract Machine Generator

In this paper we study, in the context of a WAM-based abstract machine for Prolog, how variations in the encoding of type information in tagged words and in their associated basic operations impact performance and memory usage. We use a high-level language to specify encodings and the associated operations. An automatic generator constructs both the abstract machine using this encoding and the associated Prolog-to-byte code compiler. Annotations in this language make it possible to impose constraints on the final representation of tagged words, such as the effectively addressable space (fixing, for example, the word size of the target processor /architecture), the layout of the tag and value bits inside the tagged word, and how the basic operations are implemented. We evaluate large number of combinations of the different parameters in two scenarios: a) trying to obtain an optimal general-purpose abstract machine and b) automatically generating a specially-tuned abstract machine for a particular program. We conclude that we are able to automatically generate code featuring all the optimizations present in a hand-written, highly-optimized abstract machine and we canal so obtain emulators with larger addressable space and better performance

TDL : a type description language for HPSG. - Part 1: Overview

Unification-based 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 high-level declarative programming languages for linguists, which allow them to express linguistic knowledge in a monotonic fashion. More over, such formalisms can be given a precise set theoretical semantics. This paper presents mathcal{TDL}, a typed featurebased language and inference system, which is specically designed to support highly lexicalized grammar theories like HPSG, FUG, or CUG. mathcal{TDL} allows the user to define possibly recursive hierarchically ordered types consisting of type constraints and feature constraints over the boolean connectives wedge, vee, and neg. mathcal{TDL} distinguishes between avm types (open-world reasoning), sort types (closed-world reasoning), built-in types and atoms, and allows the declaration of partitions and incompatible types. Working with partially as well as with fully expanded types is possible, both at definition time and at run time. mathcal{TDL} is incremental, i.e., it allows the redefinition of types and the use of undefined types. Efficient reasoning is accomplished through four specialized reasoners