English
Related papers

Related papers: Propositional Abduction via Only-Knowing: A Non-Mo…

200 papers

This note is concerned with a formal analysis of the problem of non-monotonic reasoning in intelligent systems, especially when the uncertainty is taken into account in a quantitative way. A firm connection between logic and probability is…

Artificial Intelligence · Computer Science 2013-04-05 Hung-Trung Nguyen

This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type "if ... then ...",…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann , Menachem Magidor

The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…

Logic in Computer Science · Computer Science 2009-09-25 Marc Denecker

Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job profiles. In such open environments, the…

Artificial Intelligence · Computer Science 2011-10-13 T. Di Noia , E. Di Sciascio , F. M. Donini

We introduce the operation of possibility qualification and show how. this modal-like operator can be used to represent "typical" or default knowledge in a theory of nonmonotonic reasoning. We investigate the representational power of this…

Artificial Intelligence · Computer Science 2013-04-10 Ronald R. Yager

Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not…

Artificial Intelligence · Computer Science 2007-05-23 Sarit Kraus , Daniel Lehmann , Menachem Magidor

Tackling Natural Language Inference with a logic-based method is becoming less and less common. While this might have been counterintuitive several decades ago, nowadays it seems pretty obvious. The main reasons for such a conception are…

Computation and Language · Computer Science 2020-12-02 Lasha Abzianidze

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

The aim of this paper is to introduce a new framework for defining abductive reasoning operators based on a notion of retraction in arbitrary logics defined as satisfaction systems. We show how this framework leads to the design of…

Artificial Intelligence · Computer Science 2018-03-06 Marc Aiguier , Jamal Atif , Isabelle Bloch , Ramón Pino-Pérez

The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…

Computational Complexity · Computer Science 2025-05-16 Victor Lagerkvist , Mohamed Maizia , Johannes Schmidt

Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years. In this paper we study abduction with penalization in the logic programming framework.…

Artificial Intelligence · Computer Science 2007-05-23 Simona Perri , Francesco Scarcello , Nicola Leone

Abductive reasoning - the search for plausible explanations - has long been central to human inquiry, from forensics to medicine and scientific discovery. Yet formal approaches in AI have largely reduced abduction to eliminative search:…

Artificial Intelligence · Computer Science 2025-12-23 Remo Pareschi

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

We observe some puzzling linguistic data concerning ordinary knowledge ascriptions that embed an epistemic (im)possibility claim. We conclude that it is untenable to jointly endorse both classical logic and a pair of intuitively attractive…

Logic in Computer Science · Computer Science 2023-07-12 Peter Hawke

This paper considers KLM-style preferential non-monotonic reasoning in the setting of propositional team semantics. We show that team-based propositional logics naturally give rise to cumulative non-monotonic entailment relations. Motivated…

Artificial Intelligence · Computer Science 2024-05-14 Kai Sauerwald , Juha Kontinen

Abductive reasoning generates explanatory hypotheses for new observations using prior knowledge. This paper investigates the use of forgetting, also known as uniform interpolation, to perform ABox abduction in description logic (ALC)…

Artificial Intelligence · Computer Science 2018-11-14 Warren Del-Pinto , Renate A. Schmidt

Modal dependence logics are modal logics defined on the basis of team semantics and have the downward closure property. In this paper, we introduce sound and complete deduction systems for the major modal dependence logics, especially those…

Logic · Mathematics 2018-12-19 Fan Yang

In order to enrich dynamic semantic theories with a `pragmatic' capacity, we combine dynamic and nonmonotonic (preferential) logics in a modal logic setting. We extend a fragment of Van Benthem and De Rijke's dynamic modal logic with…

cmp-lg · Computer Science 2008-02-03 Jan Jaspars , Megumi Kameyama

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

Standard epistemic logics introduce a modal operator K to represent knowledge, but in doing so they presuppose the logical apparatus they aim to explain. By contrast, this paper explores how logic may be derived from the structure of…

Logic in Computer Science · Computer Science 2025-12-01 Alexader V. Gheorghiu , Tao Gu