English
Related papers

Related papers: Defeasible Conditional Obligation in a Two-tiered …

200 papers

Supervenience is an important philosophical concept. In this paper, inspired by the supervenience-determined consequence relation and the semantics of agreement operator, we introduce a modal logic of supervenience, which has a dyadic…

Logic · Mathematics 2019-09-18 Jie Fan

This paper provides a set of cut-free complete sequent-style calculi for deontic STIT ('See To It That') logics used to formally reason about choice-making, obligations, and norms in a multi-agent setting. We leverage these calculi to write…

Logic in Computer Science · Computer Science 2024-10-07 Tim S. Lyon , Kees van Berkel

Qualitative and quantitative approaches to reasoning about uncertainty can lead to different logical systems for formalizing such reasoning, even when the language for expressing uncertainty is the same. In the case of reasoning about…

Artificial Intelligence · Computer Science 2021-04-07 Matthew Harrison-Trainor , Wesley H. Holliday , Thomas F. Icard

We propose a formalization of the three-tier causal hierarchy of association, intervention, and counterfactuals as a series of probabilistic logical languages. Our languages are of strictly increasing expressivity, the first capable of…

Logic in Computer Science · Computer Science 2021-06-03 Duligur Ibeling , Thomas Icard

We study an extension of FO^2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, `the letter a appears between…

Logic in Computer Science · Computer Science 2016-03-18 Andreas Krebs , Kamal Lodaya , Paritosh Pandya , Howard Straubing

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

Programming Languages · Computer Science 2025-10-08 Qiancheng Fu , Hongwei Xi

The present paper investigates consequence relations that are both non-monotonic and paraconsistent. More precisely, we put the focus on preferential consequence relations, i.e. those relations that can be defined by a binary preference…

Artificial Intelligence · Computer Science 2007-05-23 Jonathan Ben-Naim

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

Logic · Mathematics 2025-01-22 Wesley H. Holliday

In logic programming under the answer set semantics, preferences on rules are used to choose which of the conflicting rules are applied. Many interesting semantics have been proposed. Brewka and Eiter's Principle I expresses the basic…

Logic in Computer Science · Computer Science 2014-04-29 Alexander Šimko

Faroldi argues that deontic modals are hyperintensional and thus traditional modal logic cannot provide an appropriate formalization of deontic situations. To overcome this issue, we introduce novel justification logics as hyperintensional…

Logic in Computer Science · Computer Science 2023-08-14 Atefeh Rohani , Thomas Studer

DL^N is a recent approach that extends description logics with defeasible reasoning capabilities. In this paper we provide an overview on DL^N, illustrating the underlying knowledge engineering requirements as well as the characteristic…

Artificial Intelligence · Computer Science 2020-09-18 Piero A. Bonatti , Iliana M. Petrova , Luigi Sauro

We seek to find normative criteria of adequacy for nonmonotonic logic similar to the criterion of validity for deductive logic. Rather than stipulating that the conclusion of an inference be true in all models in which the premises are…

Artificial Intelligence · Computer Science 2007-05-23 Henry E. Kyburg , Choh Man Teng

G\"odel's Dialectica interpretation was designed to obtain a relative consistency proof for Heyting arithmetic, to be used in conjunction with the double negation interpretation to obtain the consistency of Peano arithmetic. In recent…

Category Theory · Mathematics 2021-09-17 Davide Trotta , Matteo Spadetto , Valeria de Paiva

There is much interest in providing probabilistic semantics for defaults but most approaches seem to suffer from one of two problems: either they require numbers, a problem defaults were intended to avoid, or they generate peculiar side…

Artificial Intelligence · Computer Science 2013-04-10 Eric Neufeld , David L Poole

Classical Decision Theory provides a normative framework for representing and reasoning about complex preferences. Straightforward application of this theory to automate decision making is difficult due to high elicitation cost. In response…

Artificial Intelligence · Computer Science 2013-01-30 Vu A. Ha , Peter Haddawy

Human knowledge is subject to uncertainties, imprecision, incompleteness and inconsistencies. Moreover, the meaning of many everyday terms is dependent on the context. That poses a huge challenge for the Semantic Web. This paper introduces…

Artificial Intelligence · Computer Science 2023-09-25 Dave Raggett

Often, we assume that an action is permitted simply because it is not explicitly forbidden; or, similarly, that an action is forbidden simply because it is not explicitly permitted. This kind of assumptions appear, e.g., in autonomous…

Logic in Computer Science · Computer Science 2019-07-23 Pablo F. Castro , Valentin Cassano , Raul Fervari , Carlos Areces

We present a non-deterministic semantic framework for all modal logics in the modal cube, extending prior works by Kearns and others. Our approach introduces modular and uniform multi-valued non-deterministic matrices (Nmatrices) for each…

Logic in Computer Science · Computer Science 2025-07-16 Renato Leme , Carlos Olarte , Elaine Pimentel , Marcelo E. Coniglio

We introduce the notion of a multidimensional hybrid preference domain on a (finite) set of alternatives that is a Cartesian product of finitely many components. We demonstrate that in a model of public goods provision, multidimensional…

Theoretical Economics · Economics 2023-11-17 Shurojit Chatterji , Huaxia Zeng