Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling and evaluating argumentation allowing general logical satisfaction conditions. Different criteria used to settle the acceptance of arguments are called semantics. Semantics ADFs so far mainly defined based on concept admissibility. Recently, notion strong admissibility has ADFs. In current work we study comp...

The class of first-order Hereditary Harrop formulas (fohh) is a well-established extension of first-order Horn clauses. Its operational semantics is based on intuitionistic provability. We propose another operational semantics for fohh which is based on game semantics. This new semantics has several interesting aspects: in particular, it gives a logical status to the read predicate. keywords: i...

We outline a vision for computational semantics in which formal compositional semantics is combined with a powerful, structured lexical semantics derived from distributional statistics. We consider how existing work (Lewis and Steedman, 2013) could be extended with a much richer lexical semantics using recent techniques for modelling processes (Scaria et al., 2013)—for example, learning that vi...

Computability Logic (CoL), introduced by Japaridze in [2003; 2009a], is a research program for developing logic as a formal theory of interactive computability. Formulas in it are understood as (interactive) computational problems and logical operators represent operations on such entities. The goal of this program is to define a systematic way to answer the question “what can be computed?” wit...

/ Motivation Though possible worlds semantics has long been established as the dominant research tradition in philosophical logic and its applications, its various theories, background assumptions, and norms have seldom been systematically investigated from a methodological point of view. By way of illustration, consider the matter of semantic adequacy. When a new or revised logical system is p...

We introduce a new semantics for logic programming languages. It generalises the traditional Herbrand universe semantics, and specialises the semantics of logical relations, as used in analysing parametricity in functional and imperative programming languages. We outline a typed logic programming language, give it this semantics, and show how it supports structured development of logic programs...

In classical logic, the proposition expressed by a sentence is construed as a set of possible worlds, capturing the informative content of the sentence. However, sentences in natural language are not only used to provide information, but also to request information. Thus, natural language semantics requires a logical framework whose notion of meaning does not only embody informative content, bu...

In [WF97, WFF98a, WFF98b] we describe the language ULTRA that has been designed for the speci cation of database updates in a modular, rule-based fashion. We provide a model-theoretic semantics based on deferred updates, which means that update requests are determined and collected in an evaluation phase without changing the database state and the corresponding updates are performed in a subseq...

Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically based on intuitionistic provability. We extend the operational semantics of these languages with game semantics. This extended semantics has several interesti...

We generalise the notion of pre-logical predicates [HS02] to arbitrary simply typed formal systems and their categorical models. We establish the basic lemma of pre-logical predicates and composability of binary pre-logical relations in this generalised setting. This generalisation takes place in a categorical framework for typed higher-order abstract syntax and semantics [Fio02,MS03].