English
Related papers

Related papers: The Varieties of Ought-Implies-Can and Deontic STI…

200 papers

Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics…

Artificial Intelligence · Computer Science 2024-08-01 Jesse Heyninck

I have argued elsewhere that second order logic provides a foundation for mathematics much in the same way as set theory does, despite the fact that the former is second order and the latter first order, but second order logic is marred by…

Logic · Mathematics 2023-02-14 Jouko Väänänen

This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…

Logic · Mathematics 2026-02-17 Ulf Hlobil

Autonomous agents are supposed to be able to finish tasks or achieve goals that are assigned by their users through performing a sequence of actions. Since there might exist multiple plans that an agent can follow and each plan might…

Artificial Intelligence · Computer Science 2022-04-12 Jieting Luo , Beishui Liao , Dov Gabbay

A modal logic is \emph{non-iterative} if it can be defined by axioms that do not nest modal operators, and \emph{rank-1} if additionally all propositional variables in axioms are in scope of a modal operator. It is known that every…

Logic in Computer Science · Computer Science 2020-08-04 Jonas Forster , Lutz Schröder

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

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

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Logic in Computer Science · Computer Science 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

To formulate a universal framework of information theory is beneficial. This study proves that the sextuple model of the objective information theory (OIT) is a sufficient and necessary condition for discussing information with four basic…

Information Theory · Computer Science 2022-12-13 Jianfeng Xu

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

Artificial Intelligence · Computer Science 2009-09-29 Michael J. Maher

Logical reasoning, i.e., deductively inferring the truth value of a conclusion from a set of premises, is an important task for artificial intelligence with wide potential impacts on science, mathematics, and society. While many…

Computation and Language · Computer Science 2024-02-15 Theo X. Olausson , Alex Gu , Benjamin Lipkin , Cedegao E. Zhang , Armando Solar-Lezama , Joshua B. Tenenbaum , Roger Levy

This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching. Its sentences, the patterns, are constructed using variables, symbols, connectives…

Logic in Computer Science · Computer Science 2019-03-14 Grigore Rosu

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

A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason about policies. Because we use first-order logic, policies…

Logic in Computer Science · Computer Science 2007-05-23 Joseph Y. Halpern , Vicky Weissman

We found in Homotopy Type Theory (HoTT), a way of representing a first order version of intuitionistic logic (ICL), for intuitionistic calculational logic) where, instead of deduction trees, corresponding linear calculational formats are…

Logic · Mathematics 2019-08-01 Ernesto Acosta , Bernarda Aldana , Jaime Bohorquez

In previous work [Lewitzka, Log. J. IGPL 2017], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from G\"odel's interpretation…

Logic in Computer Science · Computer Science 2019-01-01 Steffen Lewitzka

Matching logic is a general formal framework for reasoning about a wide range of theories, with particular emphasis on programming language semantics. Notably, the intermediate language of the K semantics framework is an extension of…

Logic in Computer Science · Computer Science 2025-09-17 Ádám Kurucz , Péter Bereczky , Dániel Horpácsi

The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…

Logic · Mathematics 2017-09-27 Dimitris Tsementzis

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

Intuitionistic Propositional Logic is proved to be an infinitely many valued logic by Kurt G\"odel (1932), and it is proved by Stanis{\l}aw Ja\'skowski (1936) to be a countably many valued logic. In this paper, we provide alternative proofs…

Logic · Mathematics 2021-11-30 Saeed Salehi
‹ Prev 1 4 5 6 7 8 10 Next ›