English
Related papers

Related papers: Denial Logic

200 papers

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

We address the problem of compiling defeasible theories to Datalog$^\neg$ programs. We prove the correctness of this compilation, for the defeasible logic $DL(\partial_{||})$, but the techniques we use apply to many other defeasible logics.…

Logic in Computer Science · Computer Science 2024-08-28 Michael J. Maher

Standard epistemic logic is concerned with describing agents' epistemic attitudes given the current set of alternatives the agents consider possible. While distributed systems can (and often are) discussed without mentioning epistemics, it…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-12 Giorgio Cignarale , Roman Kuznets

Negation as failure and incomplete information in logic programs have been studied by many researchers In order to explains HOW a negated conclusion was reached, we introduce and proof a different way for negating facts to overcoming…

Artificial Intelligence · Computer Science 2013-03-06 M. A. El-Dosuky , T. T. Hamza , M. Z. Rashad , A. H. Naguib

Logical reasoning is central to human cognition and intelligence. It includes deductive, inductive, and abductive reasoning. Past research of logical reasoning within AI uses formal language as knowledge representation and symbolic…

Computation and Language · Computer Science 2024-02-19 Zonglin Yang , Xinya Du , Rui Mao , Jinjie Ni , Erik Cambria

Proof-theoretic semantics (P-tS) is the paradigm of semantics in which meaning in logic is based on proof (as opposed to truth). A particular instance of P-tS for intuitionistic propositional logic (IPL) is its base-extension semantics…

Logic in Computer Science · Computer Science 2023-03-30 Alexander V. Gheorghiu , David J. Pym

To appear in Theory and Practice of Logic Programming (TPLP). In this paper we propose an extension of logic programming (LP) where each default literal derived from the well-founded model is associated to a justification represented as an…

Logic in Computer Science · Computer Science 2016-05-11 Pedro Cabalar , Jorge Fandinno

Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias normal or conventional) situations in which a given sentence…

Artificial Intelligence · Computer Science 2020-02-05 Richard Booth , Giovanni Casini , Thomas Meyer , Ivan Varzinczak

We introduce a temporal logic to reason on global applications in an asynchronous setting. First, we define the Distributed States Logic (DSL), a modal logic for localities that embeds the local theories of each component into a theory of…

Logic in Computer Science · Computer Science 2016-08-31 Carlo Montangero , Laura Semini

Reasoning on defeasible knowledge is a topic of interest in the area of description logics, as it is related to the need of representing exceptional instances in knowledge bases. In this direction, in our previous works we presented a…

Artificial Intelligence · Computer Science 2021-08-10 Loris Bozzato , Thomas Eiter , Luciano Serafini

CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, both of these logics adhere to a Tarskian informal semantics, in which interpretations represent objective states-of-affairs. In other words, these logics lack the…

Artificial Intelligence · Computer Science 2013-12-24 Joost Vennekens

Plausible reasoning concerns situations whose inherent lack of precision is not quantified; that is, there are no degrees or levels of precision, and hence no use of numbers like probabilities. A hopefully comprehensive set of principles…

Artificial Intelligence · Computer Science 2017-04-05 David Billington

Defeasible rules are used in providing computable representations of legal documents and, more recently, have been suggested as a basis for explainable AI. Such applications draw attention to the scalability of implementations. The…

Artificial Intelligence · Computer Science 2021-08-12 Michael J. Maher

The rising popularity of neural networks (NNs) in recent years and their increasing prevalence in real-world applications have drawn attention to the importance of their verification. While verification is known to be computationally…

Artificial Intelligence · Computer Science 2022-07-15 Natalia Slusarz , Ekaterina Komendantskaya , Matthew L. Daggitt , Robert Stewart

Epistemic logics model how agents reason about their beliefs and the beliefs of other agents. Existing logics typically assume the ability of agents to reason perfectly about propositions of unbounded modal depth. We present DBEL, an…

Logic in Computer Science · Computer Science 2023-05-16 Farid Arthaud , Martin Rinard

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

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…

Artificial Intelligence · Computer Science 2015-09-30 Stefan Borgwardt , Rafael Peñaloza

In many situations humans have to reason with inconsistent knowledge. These inconsistencies may occur due to not fully reliable sources of information. In order to reason with inconsistent knowledge, it is not possible to view a set of…

Artificial Intelligence · Computer Science 2024-12-16 Nico Roos

The introduction of explicit notions of rejection, or disbelief, into logics for knowledge representation can be justified in a number of ways. Motivations range from the need for versions of negation weaker than classical negation, to the…

Artificial Intelligence · Computer Science 2007-05-23 Samir Chopra , Johannes Heidema , Thomas Meyer

Description logics are a powerful tool for describing ontological knowledge bases. That is, they give a factual account of the world in terms of individuals, concepts and relations. In the presence of uncertainty, such factual accounts are…

Artificial Intelligence · Computer Science 2021-08-31 Tim French , Tom Smoker