Decidability, complexity, and expressiveness of first-order logic over the subword ordering.
Simon HalfonPhilippe SchnoebelenGeorg ZetzschePublished in: LICS (2017)
Keyphrases
- first order logic
- expressive power
- propositional logic
- theorem proving
- computational properties
- inference rules
- transitive closure
- inductive logic programming
- knowledge representation
- representation language
- relational algebra
- theorem prover
- incomplete information
- probabilistic reasoning
- data complexity
- horn clauses
- decision procedures
- markov networks
- computational complexity
- quantifier elimination
- probabilistic graphical models
- logical rules
- highly expressive
- markov logic networks
- markov logic
- dl lite
- exptime complete
- description logics
- partial order
- constraint databases
- logical formulas
- query answering
- quantifier free