2026-08-17T03:26:01Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10961 2024-03-06T10:46:55Z ddc:004 open_access

Finite Satisfiability of Unary Negation Fragment with Transitivity Danielski, Daniel Kieroński, Emanuel unary negation fragment transitivity finite satisfiability finite open-world query answering description logics We show that the finite satisfiability problem for the unary negation fragment with an arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require that some binary symbols are interpreted as arbitrary transitive relations, some as partial orders and some as equivalences. We also consider finite satisfiability of various extensions of our primary logic, in particular capturing the concepts of nominals and role hierarchies known from description logic. As the unary negation fragment can express unions of conjunctive queries, our results have interesting implications for the problem of finite query answering, both in the classical scenario and in the description logics setting. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Daniel Danielski and Emanuel Kieroński 2019 Is Part Of LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2019.17 urn:nbn:de:0030-drops-109612 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.17 eng https://creativecommons.org/licenses/by/3.0/legalcode