On the complexity of entailment in existential conjunctive first-order logic with atomic negation.
Marie-Laure MugnierGeneviève SimonetMichaël ThomazoPublished in: Inf. Comput. (2012)
Keyphrases
- first order logic
- horn clauses
- dl lite
- polynomial hierarchy
- expressive power
- propositional logic
- theorem proving
- logic programming
- inference rules
- knowledge representation
- inductive logic programming
- markov networks
- probabilistic reasoning
- representation language
- theorem prover
- probabilistic graphical models
- transitive closure
- relational algebra
- incomplete information
- markov logic networks
- logic programs
- probabilistic logic
- markov logic
- computational complexity
- description logics
- constraint databases
- quantifier free
- mazurkiewicz traces
- fixpoint
- temporal logic
- np complete
- graphical models
- artificial intelligence