Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic.
Agi KuruczVladislav RyzhikovYury SavateevMichael ZakharyaschevPublished in: CoRR (2022)
Keyphrases
- linear temporal logic
- regular languages
- query language
- conjunctive queries
- expressive power
- description logics
- regular expressions
- query evaluation
- ontology based data access
- equivalence queries
- grammatical inference
- knowledge representation
- first order logic
- knowledge base
- query processing
- temporal logic
- finite automata
- domain specific
- data model
- domain knowledge
- model checking
- positive data
- statistical queries
- data sources
- semantic information
- object oriented
- database
- membership queries
- context free grammars
- domain ontology
- finite state machines
- query answering
- markov chain
- conceptual model
- context free
- decision problems
- integrity constraints
- xml data
- pattern matching