English
Related papers

Related papers: The lexicographic closure as a revision process

200 papers

This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…

Logic in Computer Science · Computer Science 2020-08-04 Michael J. Maher

We present a semantics for adding uncertainty to conditional logics for default reasoning and belief revision. We are able to treat conditional sentences as statements of conditional probability, and express rules for revision such as "If A…

Artificial Intelligence · Computer Science 2013-03-08 Craig Boutilier

This paper develops a Reasoning about Actions and Change framework integrated with Default Reasoning, suitable as a Knowledge Representation and Reasoning framework for Story Comprehension. The proposed framework, which is guided strongly…

Artificial Intelligence · Computer Science 2014-07-16 Irene-Anna Diakidoy , Antonis Kakas , Loizos Michael , Rob Miller

We seek to find normative criteria of adequacy for nonmonotonic logic similar to the criterion of validity for deductive logic. Rather than stipulating that the conclusion of an inference be true in all models in which the premises are…

Artificial Intelligence · Computer Science 2007-05-23 Henry E. Kyburg , Choh Man Teng

The AGM recovery postulate says: assume a set of propositions X; assume that it is consistent and that it is closed under logical consequences; remove a belief P from the set minimally, but make sure that the resultant set is again some set…

Artificial Intelligence · Computer Science 2016-01-28 Ryuta Arisaka

Results about the redundancy of circumscriptive and default theories are presented. In particular, the complexity of establishing whether a given theory is redundant is establihsed.

Logic in Computer Science · Computer Science 2021-04-12 Paolo Liberatore

We start by defining an approach to non-monotonic probabilistic reasoning in terms of non-monotonic categorical (true-false) reasoning. We identify a type of non-monotonic probabilistic reasoning, akin to default inheritance, that is…

Artificial Intelligence · Computer Science 2013-04-12 Benjamin N. Grosof

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

In ASPIC-style structured argumentation an argument can rebut another argument by attacking its conclusion. Two ways of formalizing rebuttal have been proposed: In restricted rebuttal, the attacked conclusion must have been arrived at with…

Artificial Intelligence · Computer Science 2020-07-10 Marcos Cramer , Meghna Bhadra

Description logic programs (dl-programs) under the answer set semantics formulated by Eiter {\em et al.} have been considered as a prominent formalism for integrating rules and ontology knowledge bases. A question of interest has been…

Artificial Intelligence · Computer Science 2011-11-08 Yisong Wang , Jia-Huai You , Li Yan Yuan , Yi-Dong Shen , Thomas Eiter

Text entailment, the task of determining whether a piece of text logically follows from another piece of text, is a key component in NLP, providing input for many semantic applications such as question answering, text summarization,…

Computation and Language · Computer Science 2020-09-29 Vivian S. Silva , André Freitas , Siegfried Handschuh

A common assumption in belief revision is that the reliability of the information sources is either given, derived from temporal information, or the same for all. This article does not describe a new semantics for integration but the…

Artificial Intelligence · Computer Science 2021-04-09 Paolo Liberatore

A general method is given for revising degrees of belief and arriving at consistent decisions about a system of logically constrained issues. In contrast to other works about belief revision, here the constraints are assumed to be fixed.…

Artificial Intelligence · Computer Science 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

Artificial Intelligence · Computer Science 2019-04-17 Katarina Britz , Giovanni Casini , Thomas Meyer , Kody Moodley , Uli Sattler , Ivan Varzinczak

The downward closure of a word language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of any language is regular. While the downward closure appears to be a powerful…

Formal Languages and Automata Theory · Computer Science 2015-06-02 Georg Zetzsche

A growing body of work studies how to answer a question or verify a claim by generating a natural language "proof": a chain of deductive inferences yielding the answer based on a set of premises. However, these methods can only make sound…

Computation and Language · Computer Science 2022-11-02 Zayne Sprague , Kaj Bostrom , Swarat Chaudhuri , Greg Durrett

We study here preference revision, considering both the monotonic case where the original preferences are preserved and the nonmonotonic case where the new preferences may override the original ones. We use a relational framework in which…

Databases · Computer Science 2007-05-23 Jan Chomicki , Joyce Song

Negations are key to determining sentence meaning, making them essential for logical reasoning. Despite their importance, negations pose a substantial challenge for large language models (LLMs) and remain underexplored. We constructed and…

Computation and Language · Computer Science 2025-06-04 Tereza Vrabcová , Marek Kadlčík , Petr Sojka , Michal Štefánik , Michal Spiegel

Framing involves the positive or negative presentation of an argument or issue depending on the audience and goal of the speaker (Entman 1983). Differences in lexical framing, the focus of our work, can have large effects on peoples'…

Computation and Language · Computer Science 2021-04-13 Tuhin Chakrabarty , Christopher Hidey , Smaranda Muresan

In this article, we study translations between variants of defaults logics such that the extensions of the theories that are the input and the output of the translation are in a bijective correspondence. We assume that a translation can…

Artificial Intelligence · Computer Science 2021-04-12 Paolo Liberatore