scientific article; zbMATH DE number 7561661
From MaRDI portal
Publication:5092376
DOI10.4230/LIPIcs.MFCS.2019.17MaRDI QIDQ5092376
Emanuel Kieroński, Daniel Danielski
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1809.03245
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
transitivitydescription logicsfinite satisfiabilityfinite open-world query answeringunary negation fragment
Related Items (3)
Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies ⋮ A review of SHACL: from data validation to schema reasoning for RDF graphs ⋮ The Fluted Fragment with Transitivity
Cites Work
- On the complexity of the two-variable guarded fragment with transitive guards
- Modal languages and bounded fragments of predicate logic
- Undecidability results on two-variable logics
- The guarded fragment with transitive guards
- Unary negation
- Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
- Querying the Unary Negation Fragment with Regular Path Expressions.
- On the Decision Problem for Two-Variable First-Order Logic
- Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants
- On the Restraining Power of Guards
- Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
- Unary negation fragment with equivalence relations has the finite model property
- THE FLUTED FRAGMENT REVISITED
- Computer Science Logic
- Role Conjunctions in Expressive Description Logics
- Guarded Negation
This page was built for publication:
