A Finite-Model-Theoretic View on Propositional Proof Complexity.
Erich GrädelMartin GroheBenedikt PagoWied PakusaPublished in: CoRR (2018)
Keyphrases
- model theoretic
- proof procedure
- proof theoretic
- decision procedures
- deductive databases
- description logics
- theorem proving
- operational semantics
- default reasoning
- logic programs
- propositional logic
- autoepistemic logic
- presburger arithmetic
- fixpoint
- first order logic
- computational complexity
- nonmonotonic reasoning
- default logic
- proof theory
- linear logic
- theorem prover
- horn clauses
- integrity constraints
- minimal models