Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q64360035, #quickstatements; #temporary_batch_1707252663060
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SPARQL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPath / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2014.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092103258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Complexity in the $\mathcal{EL}$ Family of Description Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable reasoning and efficient query answering in description logics: The DL-Lite family / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data complexity of query answering in expressive description logics via tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting of regular expressions and regular path queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of Datalog queries is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Horn rules and description logics in CARIN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular path queries with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE Reasoning for Graded Modal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-theoretic techniques for modal logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enriched Mu-Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive query containment and answering under description logic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cheap Boolean Role Constructors for Description Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of SHIQ with complex role inclusion axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tableau decision procedure for \(\mathcal{SHOIQ}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning in description logics by a reduction to disjunctive datalog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query Answering in Description Logics: The Knots Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata theoretic decision procedure for the propositional mu- calculus / rank
 
Normal rank

Latest revision as of 19:12, 8 July 2024

scientific article
Language Label Description Also known as
English
Answering regular path queries in expressive description logics via alternating tree-automata
scientific article

    Statements

    Answering regular path queries in expressive description logics via alternating tree-automata (English)
    0 references
    0 references
    0 references
    0 references
    18 July 2014
    0 references
    expressive description logics
    0 references
    query answering
    0 references
    computational complexity
    0 references
    automata on infinite trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references