English
Related papers

Related papers: Classification and deontic explosion for contrary-…

200 papers

Deontic logic is shown to be applicable for modelling human reasoning. For this the Wason selection task and the suppression task are discussed in detail. Different versions of modelling norms with deontic logic are introduced and in the…

Artificial Intelligence · Computer Science 2014-09-19 Ulrich Furbach , Claudia Schon

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

We discuss conditionalisation for Accept-Desirability models in an abstract decision-making framework, where uncertain rewards live in a general linear space, and events are special projection operators on that linear space. This abstract…

Artificial Intelligence · Computer Science 2025-12-23 Kathelijne Coussement , Gert de Cooman , Keano De Vos

The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…

Artificial Intelligence · Computer Science 2022-09-27 Francesco Olivieri , Guido Governatori , Matteo Cristani , Antonino Rotolo , Abdul Sattar

We introduce A-ranked preferential structures and combine them with an accessibility relation. This framework allows us to formalize contrary to duty obligations. Representation results are proved.

Logic · Mathematics 2008-08-25 Dov Gabbay , Karl Schlechta

A foundational problem in reinforcement learning and interactive decision making is to understand what modeling assumptions lead to sample-efficient learning guarantees, and what algorithm design principles achieve optimal sample…

Machine Learning · Computer Science 2023-01-20 Dylan J. Foster , Noah Golowich , Yanjun Han

We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined…

Logic in Computer Science · Computer Science 2011-01-25 Antonio Bucciarelli

Query answering under existential rules -- implications with existential quantifiers in the head -- is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [BLM10, BLMS11]. Query answering is also…

Databases · Computer Science 2019-08-28 Antoine Amarilli , Michael Benedikt

Current debiasing approaches often result a degradation in model capabilities such as factual accuracy and knowledge retention. Through systematic evaluation across multiple benchmarks, we demonstrate that existing debiasing methods face…

Machine Learning · Computer Science 2025-05-27 Buse Sibel Korkmaz , Rahul Nair , Elizabeth M. Daly , Antonio del Rio Chanona

Contingency and accident are two important notions in philosophy and philosophical logic. Their meanings are so close that they are mixed sometimes, in both everyday discourse and academic research. This indicates that it is necessary to…

Logic · Mathematics 2018-02-13 Jie Fan

CP violating phenomena and rare decays of $B_s$ mesons offer interesting probes to test the quark-flavor sector of the Standard Model. In view of plenty of data reported in particular from the Large Hadron Collider, this topic has received…

High Energy Physics - Phenomenology · Physics 2015-06-15 Guennadi Borissov , Robert Fleischer , Marie-Hélène Schune

Recently there has been much interest and progress in extending the definition of contextuality to systems with disturbance. We prove that such an endeavor cannot simultaneously satisfy the following principles: (1) any deterministic system…

Quantum Physics · Physics 2025-11-13 Alisson Tezzin , Elie Wolfe , Barbara Amaral , Matt Jones

Selective classifiers improve model reliability by abstaining on inputs the model deems uncertain. However, few practical approaches achieve the gold-standard performance of a perfect-ordering oracle that accepts examples exactly in order…

Machine Learning · Computer Science 2025-10-27 Stephan Rabanser , Nicolas Papernot

Deontic logics are formalisms for reasoning over norms, obligations, permissions and prohibitions. Input/Output (I/O) Logics are a particular family of so-called norm-based deontic logics that formalize conditional norms outside of the…

Logic in Computer Science · Computer Science 2026-03-02 Alexander Steen

With the rapid advancement of neural language models, the deployment of over-parameterized models has surged, increasing the need for interpretable explanations comprehensible to human inspectors. Existing post-hoc interpretability methods,…

Artificial Intelligence · Computer Science 2024-11-08 Zijian Zhang , Vinay Setty , Yumeng Wang , Avishek Anand

For an explanation of a deep learning model to be effective, it must provide both insight into a model and suggest a corresponding action in order to achieve some objective. Too often, the litany of proposed explainable deep learning…

Machine Learning · Computer Science 2020-10-09 Laura Rieger , Chandan Singh , W. James Murdoch , Bin Yu

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 study the decoherence properties of a certain class of Markovian quantum open systems from both the Decohering Histories and Environment Induced Superselection paradigms. The class studied includes many familiar quantum optical cases.…

General Relativity and Quantum Cosmology · Physics 2007-05-23 J. Twamley

We introduce enhanced Constitutional Classifiers that deliver production-grade jailbreak robustness with dramatically reduced computational costs and refusal rates compared to previous-generation defenses. Our system combines several key…

In this paper, we consider combining the ideas of forbidden random context grammars as well as of ordered grammars with cooperating distributed grammar systems (CDGS). We focus on investigating their generative capacities. Both ideas can be…

Formal Languages and Automata Theory · Computer Science 2026-04-23 Henning Fernau , Lakshmanan Kuppusamy , Jana Schulz