Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering.
Simon HalfonPhilippe SchnoebelenGeorg ZetzschePublished in: CoRR (2017)
Keyphrases
- first order logic
- expressive power
- theorem proving
- propositional logic
- computational properties
- inductive logic programming
- inference rules
- representation language
- markov networks
- probabilistic graphical models
- knowledge representation
- probabilistic reasoning
- transitive closure
- relational algebra
- computational complexity
- data complexity
- theorem prover
- incomplete information
- horn clauses
- decision procedures
- exptime complete
- description logics
- monadic second order logic
- quantifier elimination
- quantifier free
- expert systems
- machine learning
- constraint databases
- combined complexity