English
Related papers

Related papers: Deontic modality based on preference

200 papers

We introduce a new formulation of the axiom of dependent choice that can be viewed as an abstract termination principle, which generalises the recursive path orderings used to establish termination of rewrite systems. We consider several…

Logic in Computer Science · Computer Science 2019-02-28 Thomas Powell

In \cite{Lyon24} the question of the decidability of quasi-dense modal logics is answered, and an upper bound in $\EXPSPACE$ is given. Unfortunately, authors' intricate proof seems to contain a major flaw that cannot be fixed, leaving the…

Logic in Computer Science · Computer Science 2025-08-11 Olivier Gasquet

A methodology for defining variational principles for a class of PDE models from continuum mechanics is demonstrated, and some of its features explored. The scheme is applied to quasi-static and dynamic models of rate-independent and…

Analysis of PDEs · Mathematics 2024-07-02 Amit Acharya

We present a STIT ('see to it that') logic with discrete temporal operators and deontic operators in which we can formalize and reason about legal concepts such as persistent duty and the dynamic concept of power from Hohfeld. As our main…

Logic · Mathematics 2025-11-13 Shuge Rong , Yifeng Ding

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

This paper from 2008 is the first in a series of three related papers on modal methods in interpretability logics and applications. In this first paper the foundations are laid for later results. These foundations consist of a thorough…

Logic · Mathematics 2020-04-16 Evan Goris , Joost J. Joosten

User preference integration is of great importance in multi-objective optimization, in particular in many objective optimization. Preferences have long been considered in traditional multicriteria decision making (MCDM) which is based on…

Neural and Evolutionary Computing · Computer Science 2017-03-13 Longmei Li , Iryna Yevseyeva , Vitor Basto-Fernandes , Heike Trautmann , Ning Jing , Michael Emmerich

A critical note on some of the existing proposals for performing the "delayed choice" experiment is placed. By abandoning the original idea and intention, some modern theoretical proposals and experimental evidence are simply incorrectly…

Quantum Physics · Physics 2012-11-08 M. Dugic

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler

This paper develops some mathematical models arising in behavioral sciences, particularly in psychology, which are formalized via general preferences with variable ordering structures. Our considerations are based on the recent variational…

Optimization and Control · Mathematics 2013-11-26 T. Q. Bao , B. S. Mordukhovich , A. Soubeyran

This paper is based on my talks (`Skein modules with a cubic skein relation: properties and speculations' and `Symplectic structure on colorings, Lagrangian tangles and its applications') given in Kyoto (RIMS), September 11 and September 18…

Geometric Topology · Mathematics 2007-05-23 Jozef H Przytycki

In this paper, we explore how, and if, free choice permission (FCP) can be accepted when we consider deontic conflicts between certain types of permissions and obligations. As is well known, FCP can license, under some minimal conditions,…

Logic in Computer Science · Computer Science 2019-06-11 Guido Governatori , Antonino Rotolo

In this paper we use display calculus to show the decidability for normal modal logic K and some of its extensions.

Logic · Mathematics 2023-12-27 Jinsheng Chen

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

Logic · Mathematics 2020-03-12 Lars Kristiansen , Juvenal Murwanashyaka

An extension of order theory is presented that serves as a formalism for the study of dendroidal sets analogously to way the formalism of order theory is used in the study of simplicial sets.

Algebraic Topology · Mathematics 2012-01-20 Ittay Weiss

Creating a new Ontology: a Modular Approach

Artificial Intelligence · Computer Science 2015-03-17 Julia Dmitrieva , Fons J. Verbeek

Following ideas from a preprint of the second author, see [2], we investigate relations of dynamical Teichmuller spaces with dynamical objects. We also establish some connections with the theory of deformations of inverse limits and…

Dynamical Systems · Mathematics 2009-12-01 Carlos Cabrera , Peter Makienko

We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…

Logic in Computer Science · Computer Science 2020-06-17 Harley Eades , Dominic Orchard

This paper studies how violations of structural assumptions like expected utility and exponential discounting can be connected to basic rationality violations, even though these assumptions are typically regarded as independent building…

Theoretical Economics · Economics 2024-02-20 Xi Zhi Lim

An algebraic deformation theory of module-algebras over a bialgebra is constructed. The cases of module-coalgebras, comodule-algebras, and comodule-coalgebras are also considered.

Rings and Algebras · Mathematics 2007-05-23 Donald Yau
‹ Prev 1 8 9 10 Next ›