The Complexity of Positive First-Order Logic without Equality.
Florent R. MadelaineBarnaby MartinPublished in: ACM Trans. Comput. Log. (2012)
Keyphrases
- first order logic
- expressive power
- theorem proving
- propositional logic
- function symbols
- inference rules
- probabilistic reasoning
- probabilistic graphical models
- markov networks
- inductive logic programming
- theorem prover
- knowledge representation
- transitive closure
- relational algebra
- predicate calculus
- horn clauses
- markov logic
- representation language
- constraint databases
- database query languages
- quantifier free
- dl lite
- markov logic networks
- proof procedure
- data complexity
- higher order