Modular programs are built as a combination of separate modules, which may be developed and veriied separately. Therefore, in order to reason over such programs, compositionality plays a crucial role: the semantics of the whole program must be obtainable as a simple function from the semantics of its individual modules. In the eld of logic programming, the need for a compositional semantics has...

It is well known that big-step semantics not able to distinguish stuck and non-terminating computations. This a strong limitation as it makes very difficult reason about properties involving infinite computations, such type soundness, which cannot even be expressed. We show this issue only apparent: the distinction between diverging computations implicit in any just needs uncovered. To achieve ...

Learning from interpretation transition (LFIT) automatically constructs a model of the dynamics system observation its state transitions. So far systems that LFIT handled were mainly restricted to synchronous deterministic dynamics. However, other exist in field logical modeling, particular asynchronous semantics which is widely used biological systems. In this paper, we propose modeling discre...

The logic of bunched implications, BI, provides a logical analysis of a basic notion of resource rich enough, for example, to form the logical basis for “pointer logic” and “separation logic” semantics for programs which manipulate mutable data structures. We develop a theory of semantic tableaux for BI, so providing an elegant basis for efficient theorem proving tools for BI. It is based on th...

Abstract Argumentation problems are concerned with determining the acceptability of a set arguments from their relational structure. When available information is uncertain, probabilistic argumentation frameworks provide modeling tools to account for it. The first contribution this paper novel interpretation as logic programs. Probabilistic programs in which some facts annotated probabilities. ...

We propose a denotational semantics for logic programming based on a classical notion of logical consequence which is apt to capture the main proposed semantics of logic programs. In other words, we show that any of those semantics can be viewed as a relation of the form T |=? X where T is a theory which naturally represents the logic program under consideration together with a set of formulas ...

Dung’s argumentation frameworks are formalisms widely used to model interaction among arguments. Although their study has been profusely developed in the field of Artificial Intelligence, it is not common see its treatment those less connected computer science within logical-philosophical community. In this paper we propose bring that audience a proof-theory for argument justification based on ...

We show that the operational semantics for HOPLA is in strong correspondence with its presheaf semantics [2, 1]. The proof is a fairly standard logical relations proof, exploiting the path semantics of the language [3, 4]. Strong correspondence can be proved for full HOPLA by making use of the path semantics to get a logical relations proof off the ground. We’ll use the notation J−K for the pat...

“Flat pre-semantics” lets each parameter of truth (etc.) be considered separately and equally, and without worrying about grammatical complications. This allows one to become a little clearer on a variety of philosophical-logical points, such as the usefulness of Carnapian tolerance and the deep relativity of truth. A more definite result of thinking in terms of flat pre-semantics lies in the a...

We introduce a unified logical theory, based on signed theories and Quantified Boolean Formulas (QBFs) that can serve as the basis for representing and computing various argumentationbased decision problems. It is shown that within our framework we are able to model, in a simple and modular way, a wide range of semantics for abstract argumentation theory. This includes complete, grounded, prefe...