Search Results for author:
Found 10 papers, 0 papers with code
Belief Change based on Knowledge Measures
On the other hand, Belief Change (BC) is the process of changing beliefs (in our case, in terms of contraction, expansion and revision) taking into account a new piece of knowledge, which possibly may be in contradiction with the current belief.
A General Framework for Modelling Conditional Reasoning -- Preliminary Report
We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems.
A Minimal Deductive System for RDFS with Negative Statements
The triple language RDFS is designed to represent and reason with \emph{positive} statements only (e. g."antipyretics are drugs").
Situated Conditional Reasoning
With the semantics in place, we proceed to define a form of entailment for situated conditional knowledge bases, which we refer to as minimal closure.
A Rational Entailment for Expressive Description Logics via Description Logic Programs
Lehmann and Magidor's rational closure is acknowledged as a landmark in the field of non-monotonic logics and it has also been re-formulated in the context of Description Logics (DLs).
Defeasible RDFS via Rational Closure
In this work, we show how to integrate RC within the triple language RDFS, which together with OWL2 are the two major standard semantic web ontology languages.
Theoretical Foundations of Defeasible Description Logics
Besides showing that our semantics is appropriate, these results pave the way for more effective decision procedures for defeasible reasoning in DLs.
On Rational Entailment for Propositional Typicality Logic
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 holds.
A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure
We then also adapt the method to one of the known extensions of RC for DLs, namely Defeasible Inheritance-based DLs without losing the computational tractability.
Revising Incompletely Specified Convex Probabilistic Belief Bases
In this work, an agent's beliefs are represented by a set of probabilistic formulae -- a belief base.
