Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster.
Carsten LutzQuentin ManièrePublished in: CoRR (2024)
Keyphrases
- first order logic
- theorem prover
- propositional logic
- expressive power
- theorem proving
- guarded fragment
- probabilistic reasoning
- knowledge representation
- inference rules
- inductive logic programming
- transitive closure
- probabilistic graphical models
- markov networks
- horn clauses
- representation language
- function symbols
- relational algebra
- logic programming
- mazurkiewicz traces
- quantifier elimination
- exptime complete
- logic programs
- markov logic
- markov logic networks
- belief revision
- special case
- answer sets