English
Related papers

Related papers: A Note on Nesting in Dyadic Deontic Logic

200 papers

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

We consider the problem of implementing deontic modal logic. We show how (deontic) modal operators can be elegantly and directly expressed using default negation (negation-as-failure) and strong negation present in answer set programming…

Artificial Intelligence · Computer Science 2026-04-28 Gopal Gupta , Abhiramon Rajasekharan , Alexis R. Tudor , Elmer Salazar , Joaquín Arias

Starting with the deontic principles in M\={\i}m\=a\d{m}s\=a texts we introduce a new deontic logic. We use general proof-theoretic methods to obtain a cut-free sequent calculus for this logic, resulting in decidability, complexity results…

Logic in Computer Science · Computer Science 2017-05-10 Agata Ciabattoni , Elisa Freschi , Francesco A. Genco , Björn Lellmann

In this paper we provide an alternative semantics for Equilibrium Logic and its monotonic basis, the logic of Here-and-There (also known as G\"odel's G3 logic) that relies on the idea of "denotation" of a formula, that is, a function that…

Logic in Computer Science · Computer Science 2020-02-19 Felicidad Aguado , Pedro Cabalar , David Pearce , Gilberto Pérez , Concepción Vidal

In 1988, Ivlev proposed four-valued non-deterministic semantics for modal logics in which the alethic T axiom holds good. Unfortunately, no completeness was proved. In previous work, we proved completeness for some Ivlev systems and…

Logic · Mathematics 2018-08-31 Marcelo E. Coniglio , Luis Fariñas del Cerro , Newton M. Peron

Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential. Nested justification systems, first introduced by Denecker et al. (2015), allow for the composition…

Artificial Intelligence · Computer Science 2022-05-11 Simon Marynissen , Jesse Heyninck , Bart Bogaerts , Marc Denecker

The formalization of action and obligation using logic languages is a topic of increasing relevance in the field of ethics for AI. Having an expressive syntactic and semantic framework to reason about agents' decisions in moral situations…

Logic in Computer Science · Computer Science 2021-06-23 Aldo Iván Ramírez Abarca , Jan Broersen

In our previous research, we provided a reasoning system (called LeSAC) based on argumentation theory to provide legal support to designers during the design process. Building on this, this paper explores how to provide designers with…

Artificial Intelligence · Computer Science 2024-09-19 Zhe Yu , Yiwei Lu

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

In a seminal work, K. Segerberg introduced a deontic logic called DAL to investigate normative reasoning over actions. DAL marked the beginning of a new area of research in Deontic Logic by shifting the focus from deontic operators on…

Logic in Computer Science · Computer Science 2025-02-20 Carlos Areces , Valentin Cassano , Pablo Castro , Raul Fervari

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…

Logic · Mathematics 2023-08-23 Ivan Chajda , Helmut Länger

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

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

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make…

Logic in Computer Science · Computer Science 2024-06-06 Piotr Ostropolski-Nalewaja , Tim S. Lyon

In response to a concern raised by Horty, this paper develops a two-tiered, preference-based semantic framework for modeling defeasible conditional obligations. The paper extends a Hansson-Lewis style preference semantics for dyadic deontic…

Logic in Computer Science · Computer Science 2026-05-01 Xavier Parent

Existential rules form an expressive Datalog-based language to specify ontological knowledge. The presence of existential quantification in rule-heads, however, makes the main reasoning tasks undecidable. To overcome this limitation, in the…

Computational Complexity · Computer Science 2023-07-25 Georg Gottlob , Marco Manna , Cinzia Marte

Generalized orthomodular posets were introduced recently by D. Fazio, A. Ledda and the first author of the present paper in order to establish a useful tool for studying the logic of quantum mechanics. They investigated structural…

Logic · Mathematics 2020-09-14 Ivan Chajda , Helmut Länger

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon
‹ Prev 1 2 3 10 Next ›