In this work we study a rational extension $SROEL^R T$ of the low complexity
description logic SROEL, which underlies the OWL EL ontology language. The
extension involves a typicality operator T, whose semantics is based on Lehmann
and Magidor's ranked models and allows for the definition of defeasible
inclusions. We consider both rational entailment and minimal entailment. We
show that deciding instance checking under minimal entailment is in general
$\Pi^P_2$-hard, while, under rational entailment, instance checking can be
computed in polynomial time. We develop a Datalog calculus for instance
checking under rational entailment and exploit it, with stratified negation,
for computing the rational closure of simple KBs in polynomial time.Comment: Accepted for publication on Fundamenta Informatica

Dupré, Daniele Theseider

Giordano, Laura

arXiv.org e-Print Archive

Archivio Istituzionale della Ricerca- Università del Piemonte Orientale

English

Defeasible Reasoning in SROEL: from Rational Entailment to Rational
  Closure

Supported by the National Research Fund, Luxembourg (LAAMI project) and by the Engineering and Physical Sciences Research Council (EPSRC, UK), grant ref. EP/J012084/1 (SAsSY project).Peer reviewedPostprin

Arieli, Ofer

Caminada, Martin W.A.

Aberdeen University Research

Online Research @ Cardiff

A general QBF-based framework for formalizing argumentation.

A labelling approach for ideal and stage semantics.

A labelling-based justiﬁcation status of arguments.

A logic for default reasoning.

A logic of abstract argumentation.

A logical account of formal argumentation.

Abstract argumentation via monadic second order logic.

An abstract framework for argumentation with structured arguments.

An abstract, argumentationtheoretic approach to default reasoning.

An algorithm for stage semantics.

An application of model checking games to abstract argumentation.

An argument game of stable semantics.

An equaltional approach to CF2 semantics. In

Answer-set programming encodings for argumentation frameworks.

Applications of circumscription to formalizing common-sense knowledge.

Argument-based extended logic programming with defeasible priorities.

Argumentation and answer set programming.

Argumentation frameworks as constraint satisfaction problems.

Argumentation semantics for defeasible logic.

ASPARTIX: Implementing argumentation frameworks using answer-set programming.

Characterization of semantics for argument systems.

Checking the acceptability of a set of arguments.

Classical negation in logic programs and disjunctive databases.

Cognitive Carpentry. A Blueprint for How to Build a Person.

Comparing two unique extension semantics for formal argumentation: ideal and eager.

Complete extensions in argumentation coincide with 3-valued stable models in logic programming.

Complexity of semi-stable and stage semantics in argumentation frameworks.

Computational complexity of semi-stable semantics in abstract argumentation frameworks.

Computational properties of argument systems satisfying graph-theoretic constraints.

Computing argumentation semantics in answer set programming.

Computing ideal sceptical argumentation.

Conﬂict-tolerant semantics for argumentation frameworks. In

Constructing conditional plans by a theorem-prover.

Dialectic semantics for argumentation frameworks. In

Dialectical argumentation with argumentation schemes: An approach to legal logic.

Equational approach to argumentation networks.

Grounded semantics as persuasion dialogue.

How to reason defeasibly.

Instantiating abstract argumentation with classical logic arguments: Postulates and properties.

Introduction to metamathematics.

Nonmonotonic Reasoning.

On computing belief change operations using quantiﬁed Boolean formulas.

On decision problems related to the preferred semantics for argumentation frameworks.

On judgment aggregation in abstract agumentation.

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games.

On the complexity of computing the justiﬁcation status of an argument.

On the evaluation of argumentation formalisms.

On the existence of semi-stable extensions.

On the limitations of abstract argumentation.

On the logic of argumentation theory.

Paraconsistent reasoning and preferential entailments by signed quantiﬁed Boolean formula.

Paraconsistent reasoning via quantiﬁed boolean formulas, part I: Axiomatizing signed systems.

Paraconsistent reasoning via quantiﬁed boolean formulas, part II: Circumscribing inconsistent theories. In

Parametric properties of ideal semantics.

Preferred semantics as socratic discussion.

QBF-based formal veriﬁcation: experience and perspectives.

Reasoning with logical bilattices.

Reducing preferential paraconsistent reasoning to classical entailment.

Representing paraconsistent reasoning via quantiﬁed propositional logic.

Robust qbf encodings for sequential circuits with applications to veriﬁcation, debug, and test.

Robust semantics for argumentation frameworks.

SCC-recursiveness: a general schema for argumentation semantics.

Semantics for abstract argumentation systems.

Semi-stable extensions for inﬁnite frameworks. In

Semi-stable semantics.

Similarity-based inconsistency-tolerant logics. In

The stable model semantics for logic programming. In

The well-founded semantics for general logic programs.

Two approaches to dialectical argumentation: admissible sets and argumentation stages.

A QBF-based Formalization of Abstract Argumentation Semantics