arXiv AI
Jul 24
A New Well-Supported Semantics for Description Logic Programs
arXiv:2607. 21203v1 Announce Type: new Abstract: Description logic programs are a powerful formalism for combining rules with ontologies.
A New Well-Supported Semantics for Description Logic Programs
Description logic programs are a powerful formalism for combining rules with ontologies. The well-supported semantics for description logic programs ensures that no answer sets rely on cyclic dependencies.
Related stories
Hugging Face Trending Papers
Jun 23
Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure
In Description Logics (DLs), reasoning under Rational Closure (RC) is a well-known and widely accepted non-monotonic formalism to handle defeasible knowledge. In this paper, we study the application of RC to the core and horn variants of the DL-Lite family of lightweight description logics.
arXiv AI
Jun 24
Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure
arXiv:2606. 24279v1 Announce Type: new Abstract: In Description Logics (DLs), reasoning under Rational Closure (RC) is a well-known and widely accepted non-monotonic formalism to handle defeasible knowledge.
arXiv AI
Jul 21
Tractable Query Answering under Epistemic Confidentiality Policies in DL Ontologies (extended version)
arXiv:2607. 16715v1 Announce Type: new Abstract: We study Controlled Query Evaluation (CQE), a declarative approach to confidentiality-preserving data access, in the context of Description Logic (DL) ontologies, and for confidentiality policies expressed through Epistemic Dependencies (EDs).
arXiv AI
Jun 29
Robustness of Constraint Automata for Description Logics with Concrete Domains
arXiv:2601. 19644v2 Announce Type: replace-cross Abstract: Decidability or complexity issues about the consistency problem for description logics with concrete domains have already been analysed with tableaux-based or type elimination methods.
arXiv AI
Aug 20
Syntactic Simplification of OWL Class Expressions
The paper introduces Class Expression Simplifier (CES), an algorithm that syntactically simplifies OWL class expressions in Description Logics. CES preserves formal semantics by applying rewriting rules to remove redundancies and produce simpler, equivalent expressions, resulting in more compact and human-readable representations. Experiments on two medium-sized ontologies show that CES improves reasoning efficiency and reduces verbosity, and the tool is available as an open-source Python package within OWLAPY.
arXiv AI
Jun 3
Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic
arXiv:2606. 03655v1 Announce Type: new Abstract: Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al.
arXiv AI
Jul 24
Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report
arXiv:2607. 21201v1 Announce Type: new Abstract: While the integration of linear constraints has significantly expanded the reach of Answer Set Programming (ASP), existing hybrid solvers often rely on disparate semantic underpinnings that lack a unified logical foundation.
arXiv AI
Aug 6
A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL
arXiv:2608. 04945v1 Announce Type: cross Abstract: The emergence of the ISO standard GQL introduces a powerful query language extending first-order logic with controlled recursion, raising the question of its applicability to evaluation of ontology-mediated queries (OMQs).
Hugging Face Trending Papers
Jun 2
Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic
Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al. applied to modal logics.
arXiv AI
Jun 9
Standpoint Logics with Defeasible Beliefs
arXiv:2606. 08503v1 Announce Type: new Abstract: In this paper, we integrate the defeasible logic of Kraus, Lehmann and Magidor (KLM) with the standpoint logic framework of G\'omez \'Alvarez and Rudolph.
Hugging Face Trending Papers
Aug 5
A General Sufficient Condition for Rewriting Horn-ALCHI Atomic Queries into GQL
The emergence of the ISO standard GQL introduces a powerful query language extending first-order logic with controlled recursion, raising the question of its applicability to evaluation of ontology-mediated queries (OMQs). We focus on OMQs consisting of atomic queries over ontologies expressed in Horn-ALCHI, an expressive Description Logic that is not, in general, first-order rewritable.