The following pages link to Normal form transformations (Q2751356):
Displaying 18 items.
- A note on the size of prenex normal forms (Q269710) (← links)
- Canonical signed calculi with multi-ary quantifiers (Q408550) (← links)
- Combining decision procedures by (model-)equality propagation (Q436376) (← links)
- Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction) (Q631075) (← links)
- Semantic forgetting in expressive description logics (Q831928) (← links)
- Quantifier simplification by unification in SMT (Q831945) (← links)
- Deciding expressive description logics in the framework of resolution (Q924723) (← links)
- The problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Reasoning in description logics by a reduction to disjunctive datalog (Q2462648) (← links)
- Translation of resolution proofs into short first-order proofs without choice axioms (Q2486578) (← links)
- On Stronger Calculi for QBFs (Q2818031) (← links)
- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination (Q3605518) (← links)
- Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
- (Q4011818) (← links)
- Proof Transformations and Structural Invariance (Q5426006) (← links)
- Scalable fine-grained proofs for formula processing (Q5919479) (← links)
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments (Q6149592) (← links)
