English
Related papers

Related papers: The lexicographic closure as a revision process

200 papers

Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and…

Artificial Intelligence · Computer Science 2013-04-15 Marvin S. Cohen

Understanding how humans revise their beliefs in light of new information is crucial for developing AI systems which can effectively model, and thus align with, human reasoning. While theoretical belief revision frameworks rely on a set of…

Artificial Intelligence · Computer Science 2025-06-12 Stylianos Loukas Vasileiou , Antonio Rago , Maria Vanina Martinez , William Yeoh

The connections among natural language processing and argumentation theory are becoming stronger in the latest years, with a growing amount of works going in this direction, in different scenarios and applying heterogeneous techniques. In…

Artificial Intelligence · Computer Science 2014-05-06 Elena Cabrio , Serena Villata

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 (extended) AGM postulates for belief revision seem to deal with the revision of a given theory K by an arbitrary formula, but not to constrain the revisions of two different theories by the same formula. A new postulate is proposed and…

Artificial Intelligence · Computer Science 2007-05-23 Michael Freund , Daniel Lehmann

We propose a norm of consistency for a mixed set of defeasible and strict sentences, based on a probabilistic semantics. This norm establishes a clear distinction between knowledge bases depicting exceptions and those containing outright…

Artificial Intelligence · Computer Science 2013-04-08 Moises Goldszmidt , Judea Pearl

I review evidence for the claim that syntactic ambiguities are resolved on the basis of the meaning of the competing analyses, not their structure. I identify a collection of ambiguities that do not yet have a meaning-based account and…

cmp-lg · Computer Science 2008-02-03 Michael Niv

The multiple extension problem arises frequently in diagnostic and default inference. That is, we can often use any of a number of sets of defaults or possible hypotheses to explain observations or make Predictions. In default inference,…

Artificial Intelligence · Computer Science 2013-04-11 Eric Neufeld , David L Poole

There has been a growing interest in explaining entailments over description logic (DL) knowledge bases. The existing explanation formalisms focus on justifications to explain true axioms, and abductive reasoning to explain missing axioms…

Artificial Intelligence · Computer Science 2026-05-05 Yasir Mahmood , Arnab Sharma , Axel-Cyrille Ngonga Ngomo , Balram Tiwari

We present the architecture and the evaluation of a new system for recognizing textual entailment (RTE). In RTE we want to identify automatically the type of a logical relation between two input texts. In particular, we are interested in…

Computation and Language · Computer Science 2013-10-21 Andreas Wotzlaw , Ravi Coote

Revision programming is a formalism to describe and enforce updates of belief sets and databases. That formalism was extended by Fitting who assigned annotations to revision atoms. Annotations provide a way to quantify the confidence…

Artificial Intelligence · Computer Science 2007-05-23 Victor Marek , Inna Pivkina , Miroslaw Truszczynski

We consider entailment problems involving powerful constraint languages such as frontier-guarded existential rules in which we impose additional semantic restrictions on a set of distinguished relations. We consider restricting a relation…

Logic in Computer Science · Computer Science 2022-02-18 Antoine Amarilli , Michael Benedikt , Pierre Bourhis , Michael Vanden Boom

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

Computational Complexity · Computer Science 2010-06-29 Nadia Creignou , Johannes Schmidt , Michael Thomas

Extensive research has recently shown that recurrent neural language models are able to process a wide range of grammatical phenomena. How these models are able to perform these remarkable feats so well, however, is still an open question.…

Computation and Language · Computer Science 2019-09-20 Jaap Jumelet , Willem Zuidema , Dieuwke Hupkes

The dynamics of belief and knowledge is one of the major components of any autonomous system that should be able to incorporate new pieces of information. In this paper, we argue that to apply rationality result of belief dynamics theory to…

Logic in Computer Science · Computer Science 2014-07-22 Radhakrishnan Delhibabu , Gerhard Lakemeyer

We consider entailment problems involving powerful constraint languages such as guarded existential rules, in which additional semantic restrictions are put on a set of distinguished relations. We consider restricting a relation to be…

Databases · Computer Science 2019-03-21 Antoine Amarilli , Michael Benedikt , Pierre Bourhis , Michael Vanden Boom

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of…

Logic in Computer Science · Computer Science 2007-05-23 Victor Marek , Jan Treur , Miroslaw Truszczynski

We examine carefully the rationale underlying the approaches to belief change taken in the literature, and highlight what we view as methodological problems. We argue that to study belief change carefully, we must be quite explicit about…

Artificial Intelligence · Computer Science 2007-05-23 Nir Friedman , Joseph Y. Halpern

We consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under answer set semantics. New information is incorporated into the current knowledge base subject to a causal rejection principle…

Artificial Intelligence · Computer Science 2007-05-23 T. Eiter , M. Fink , G. Sabbatini , H. Tompits

The axiom of recovery, while capturing a central intuition regarding belief change, has been the source of much controversy. We argue briefly against putative counterexamples to the axiom--while agreeing that some of their insight deserves…

Artificial Intelligence · Computer Science 2007-05-23 Samir Chopra , Aditya Ghose , Thomas Meyer
‹ Prev 1 3 4 5 6 7 10 Next ›