English
Related papers

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

200 papers

Defeasible reasoning is a kind of reasoning where some generalisations may not be valid in all circumstances, that is general conclusions may fail in some cases. Various formalisms have been developed to model this kind of reasoning, which…

Artificial Intelligence · Computer Science 2024-03-06 Gabriele Sacco , Loris Bozzato , Oliver Kutz

We contribute the first denotational semantics of polymorphic dependent type theory extended by an equational theory for general (higher-order) reference types and recursive types, based on a combination of guarded recursion and…

Programming Languages · Computer Science 2023-04-13 Jonathan Sterling , Daniel Gratzer , Lars Birkedal

When deciding how to act, we must consider other agents' norms and values. However, our norms are ever-evolving. We often add exceptions or change our minds, and thus norms can conflict over time. Therefore, to maintain an accurate mental…

Artificial Intelligence · Computer Science 2024-07-09 Taylor Olson , Roberto Salas-Damian , Kenneth D. Forbus

Deontic modalities are here defined in terms of the preference relation explored in our previous work (Osherson and Weinstein, 2012). Some consequences of the system are discussed.

Logic in Computer Science · Computer Science 2014-09-03 Daniel Osherson , Scott Weinstein

Systems of deontic logic suffer either from being too expressive and therefore hard to mechanize, or from being too simple to capture relevant aspects of normative reasoning. In this article we look for a suitable way in between: the…

Artificial Intelligence · Computer Science 2018-10-24 Tomer Libal , Matteo Pascucci

In default reasoning, usually not all possible ways of resolving conflicts between default rules are acceptable. Criteria expressing acceptable ways of resolving the conflicts may be hardwired in the inference mechanism, for example…

Artificial Intelligence · Computer Science 2011-05-30 J. Rintanen

The basic system E of dyadic deontic logic proposed by {\AA}qvist offers a simple solution to contrary-to-duty paradoxes and allows to represent norms with exceptions. We investigate E from a proof-theoretical viewpoint. We propose a…

Logic in Computer Science · Computer Science 2024-06-14 Agata Ciabattoni , Nicola Oliveti , Xavier Parent

This paper considers the complexity and properties of KLM-style preferential reasoning in the setting of propositional logic with team semantics and dependence atoms, also known as propositional dependence logic. Preferential team-based…

Artificial Intelligence · Computer Science 2025-05-14 Kai Sauerwald , Arne Meier , Juha Kontinen

We propose a model of incomplete \textit{twofold multiprior preferences}, in which an act $f$ is ranked above an act $g$ only when $f$ provides higher utility in a worst-case scenario than what $g$ provides in a best-case scenario. The…

Theoretical Economics · Economics 2022-01-14 Federico Echenique , Masaki Miyashita , Yuta Nakamura , Luciano Pomatto , Jamie Vinson

We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…

Logic in Computer Science · Computer Science 2019-04-10 Wiesław Szwast , Lidia Tendera

We investigate properties of ABA+, a formalism that extends the well studied structured argumentation formalism Assumption-Based Argumentation (ABA) with a preference handling mechanism. In particular, we establish desirable properties that…

Artificial Intelligence · Computer Science 2017-11-07 Kristijonas Cyras , Francesca Toni

This paper develops a logic based on causal inferences to formally capture the concept of instrumental obligation. We establish a causal deontic model that extends causal models with priority structures, allowing us to represent both the…

Logic · Mathematics 2025-05-13 Jialiang Yan , Qingyu He

We present SBTrust, a logical framework designed to formalize decision trust. Our logic integrates a doxastic modality with a novel non-monotonic conditional operator that establishes a positive support relation between statements, and is…

Logic in Computer Science · Computer Science 2025-12-03 Alessandro Aldini , Agata Ciabattoni , Dominik Pichler , Mirko Tagliaferri

An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…

Artificial Intelligence · Computer Science 2007-05-23 J. Engelfriet

This paper presents a new ontology that implements the well-known Deontic Traditional Scheme in RDFs and SPARQL, fit to handle irresolvable conflicts, i.e., situations in which two or more statements prescribe conflicting obligations,…

Artificial Intelligence · Computer Science 2025-10-28 Livio Robaldo , Gianluca Pozzato

A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones in classical higher-order logic is presented. This embedding is proven sound and complete, that is, faithful. The work presented here provides the theoretical…

Artificial Intelligence · Computer Science 2018-03-06 Christoph Benzmüller , Ali Farjami , Xavier Parent

As large language models (LLMs) advance in linguistic competence, their reasoning abilities are gaining increasing attention. In humans, reasoning often performs well in domain specific settings, particularly in normative rather than purely…

Computation and Language · Computer Science 2026-03-09 Hirohiko Abe , Kentaro Ozeki , Risako Ando , Takanobu Morishita , Koji Mineshima , Mitsuhiro Okada

We propose a new formalization of legal competences, and in particular for the Hohfeldian categories of power and immunity, through a deontic reinterpretation of dynamic epistemic logic. We argue that this logic explicitly captures the…

Logic in Computer Science · Computer Science 2021-10-12 Huimin Dong , Olivier Roy

The reasoning with qualitative uncertainty measures involves comparative statements about events in terms of their likeliness without necessarily assigning an exact numerical value to these events. The paper is divided into two parts. In…

Logic · Mathematics 2024-03-18 Marta Bilkova , Sabine Frittella , Daniil Kozhemiachenko , Ondrej Majer

We propose two new dependent type systems. The first, is a dependent graded/linear type system where a graded dependent type system is connected via modal operators to a linear type system in the style of Linear/Non-linear logic. We then…

Logic in Computer Science · Computer Science 2023-07-20 Peter Hanukaev , Harley Eades
‹ Prev 1 3 4 5 6 7 10 Next ›