A model-based completeness proof of extended narrowing and resolution
From MaRDI portal
Recommendations
- Model completeness and relative decidability
- Expressive completeness through logically tractable models
- On the relation between resolution based and completion based theorem proving
- A proof theory for model checking: an extended abstract
- On the completeness of model checking
- On the absence of finite approximation relative to model completeness in propositional provability logic
- A finite-model-theoretic view on propositional proof complexity
- Model completeness in o-minimal polynomially bounded structures
Cited in
(11)- Rayleigh fading channel simulator based on inner-outer factorization
- Robust power control of CDMA cellular radio systems with time-varying delays
- Theorem proving modulo
- On the efficient simulation of the left-tail of the sum of correlated log-normal variates
- On the generalization of the hazard rate twisting-based simulation approach
- Differential space-time block-diagonal codes
- Superposition with equivalence reasoning and delayed clause normal form transformation
- An application of model building in a resolution decision procedure for guarded formulas
- Narrowing based inductive proof search
- On narrowing, refutation proofs and constraints
- Resolution is cut-free
This page was built for publication: A model-based completeness proof of extended narrowing and resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539606)
