Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees.
Jelle HellingsMarc GyssensJan Van den BusscheDirk Van GuchtPublished in: LICS (2023)
Keyphrases
- first order logic
- monadic second order logic
- expressive power
- propositional logic
- probabilistic reasoning
- theorem proving
- constraint databases
- representation language
- inference rules
- inductive logic programming
- theorem prover
- knowledge representation
- probabilistic graphical models
- tree automata
- highly expressive
- markov logic networks
- data complexity
- markov networks
- query language
- query processing
- transitive closure
- horn clauses
- relational algebra
- query evaluation
- relational structures
- markov logic
- quantifier elimination
- tree patterns
- machine learning
- range queries
- integrity constraints
- relational calculus
- xml documents