In this work, paraconsistent answer sets for extended disjunctive logic programs are presented as a fully declarative approach. In order to do so, we introduce a frame-based semantics. Frames are a powerful and elegant tool which have been used to characterise and study substructural logics. Unlike the original definition, no kind of syntactic transformation is employed. Indeed, paraconsistent ...

A machine reader is a tool able to transform natural language text to formal structured knowledge so as the latter can be interpreted by machines, according to a shared semantics. FRED is a machine reader for the semantic web: its output is a RDF/OWL graph, whose design is based on frame semantics. Nevertheless, FRED’s graph are domain and task independent making the tool suitable to be used as...

This paper shows how the semantics of frames with exceptions can be described logically. We define a simple (purely declarative) frame language allowing for mult iple inheritance and meta classes (i.e. the instances of a class may be classes themselves). Expressions of this language are translated into first order formulas. Circumscript ion of a certain predicate in the result ing theory yields...

In this work, paraconsistent answer sets for extended disjunctive logic programs are presented in terms of a fully declarative approach. In order to do that, we introduce a frame-based semantics. It is known frames are a powerful and elegant tool which have been used to characterise and study substructural logics. Unlike the original definition, no kind of syntactic operation (like the program ...

The paper introduces the concept of affordance within frame semantics as a significant factor in the semantics/pragmatics boundary issue. Specifically, it is argued that expansions of literal meanings, which have been argued to be required for the complete interpretation of sentences, are constrained and guided by affordances, in contrast to the generally assumed complete freedom of the pragmat...

This tutorial paper discusses a particular style of operational semantics that enables one to give a ‘syntax-directed’ inductive definition of termination which is very useful for reasoning about operational equivalence of programs. We restrict attention to contextual equivalence of expressions in the ML family of programming languages, concentrating on functions involving local state. A brief ...

Many attempts have been started to combine logic programming and modal logics. Most of them however, do not use classical PROLOG, but extend the PROLOG idea in order to cope with modal logic formulae directly. These approaches have the disadvantage that for each logic new logic programming systems are to be developed and the knowledge and experience gathered from PROLOG can hardly be utilized. ...

Recent years show the development of large scale resources (e.g. FrameNet for the Frame Semantics) that supported the definition of several state-of-the-art approaches in Natural Language Processing. However, the reuse of existing resources in heterogeneous domains such as Human Robot Interaction is not straightforward. The generalization offered by many data driven methods is strongly biased b...

Research results from so-called “classical” separation logics are not easily ported to so-called “intuitionistic” separation logics, and vice versa. Basic questions like, “Can the frame rule be proved independently of whether the programming language is garbage-collected?” “Can amortized resource analysis be ported from one separation logic to another?” should be straightforward. But they are n...

Using the cognitive architecture ACT-R/E, we designed a framework for implementing cognitively plausible spoken language understanding on an embodied agent using incremental frame representations for multiple levels of linguistic knowledge. Emphasis is placed on semantics, pragmatics, and speaker intent.