First steps towards taming description logics with strings

DOI10.1007/978-3-031-43619-2_23MaRDI QIDQ6545544FDOQ6545544

Authors: Stéphane Demri, Karin Quaas 

Publication date: 29 May 2024

Recommendations

• NExpTime-complete description logics with concrete domains
• PSpace Reasoning with the Description Logic ALCF(D)
• scientific article; zbMATH DE number 1765661
• Temporal logics on strings with prefix relation
• scientific article; zbMATH DE number 2196595

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Satisfiability of word equations with constants is in PSPACE
• An automata-theoretic approach to constraint LTL
• Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
• Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
• Temporal logics on strings with prefix relation
• Title not available (Why is that?)
• Deciding properties of integral relational automata
• An automata-based approach for \(\text{CTL}^{*}\) with constraints
• NExpTime-complete description logics with concrete domains
• Title not available (Why is that?)
• A tableau algorithm for description logics with concrete domains and general TBoxes
• Title not available (Why is that?)
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Automata-theoretic techniques for modal logics of programs
• Concatenation as a basis for arithmetic
• Counting in trees
• Title not available (Why is that?)
• Introduction to constraint databases
• The existential theory of equations with rational constraints in free groups is PSPACE-complete
• Title not available (Why is that?)
• An introduction to description logic
• Description Logics
• An algebraic view on p-admissible concrete domains for lightweight description logics
• Using model theory to find decidable and tractable description logics with concrete domains
• Title not available (Why is that?)
• Automata based verification over linearly ordered data domains
• Title not available (Why is that?)
• Presburger Büchi tree automata with applications to logics with expressive counting
• Deciding emptiness for constraint automata on strings with the prefix and suffix order

This page was built for publication: First steps towards taming description logics with strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545544)