The complexity of positive first-order logic without equality
Florent R. MadelaineBarnaby MartinPublished in: CoRR (2010)
Keyphrases
- first order logic
- expressive power
- propositional logic
- function symbols
- theorem proving
- inference rules
- probabilistic reasoning
- theorem prover
- markov networks
- horn clauses
- knowledge representation
- inductive logic programming
- probabilistic graphical models
- markov logic
- representation language
- constraint databases
- relational algebra
- transitive closure
- logical rules
- predicate calculus
- database systems
- quantifier elimination
- proof procedure
- computational complexity