Abstract Adding multi-modalities (called subexponentials ) to linear logic enhances its power as a logical framework, which has been extensively used in the specification of e.g. proof systems, programming languages and bigraphs. Initially, allowed for classical, linear, affine or relevant behaviors. Recently, this framework was enhanced so allow commutativity well. In work, we close cycle by c...

A disjunctive temporal logic programming language, called Disjunctive Chronolog is presented in this paper. Disjunctive Chronolog combines the ideas of both temporal logic programming and disjunctive logic programming. The new language is capable of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. Minimal model semantics, model ...

A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neural-like implementation of its fix-point semantics to the more general biresiduated multi-adjoint logic programming and its relationship with other approa...

Preferences for objects are commonly derived from ranked sets of properties or multiple attributes associated with these objects. There are several options or strategies to qualitatively derive a preference for one object over another from a property ranking. We introduce a modal logic, called multi-attribute preference logic, that provides a language for expressing such strategies. The logic p...

this paper examines critically the contributions of cournot, jevons and walras as the founders of classical mathematical economics from a methodological standpoint. advances in different economic schools and doctrines in the 19th century produced an environment of multi-dimensionality in economic analysis which was regarded by the pioneers of classical mathematical economists as a chaotic state...

This paper presents a first-order branching time temporal logic that is suitable for describing and reasoning about a wide class of computational multi-agent systems. The logic is novel in that it supports reasoning about the beliefs, actions, goals, abilities and structure of groups of agents. A sound proof system for the logic is presented, and some short examples are given, showing how the l...

Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In this article we propose a labelled tableau calculus for this logic, and show that it decides satisfiability of formulas in deterministic polynomial space. Since this problem is known to be PSPACE-complete, it follows that...

Abstract Some find it plausible that a sufficiently long duration of torture is worse than any mild headaches. Similarly, has been claimed million humans living great lives better number worm-like creatures feeling few seconds pleasure each. have related bad things to good along the same lines. For example, one may hold future in which sufficient beings experience lifetime bad, regardless what ...