Proof complexity of propositional default logic.
Olaf BeyersdorffArne MeierSebastian MüllerMichael ThomasHeribert VollmerPublished in: Arch. Math. Log. (2011)
Keyphrases
- default logic
- nonmonotonic reasoning
- default theories
- default reasoning
- logic programming
- autoepistemic logic
- nonmonotonic logics
- default rules
- truth maintenance systems
- fixed point
- modal logic
- classical logic
- defeasible logic
- theorem proving
- bayesian networks
- propositional logic
- knowledge representation
- logic programs
- markov random field
- programming language
- higher order