Normal form transformations
From MaRDI portal
Recommendations
Cited in
(22)- Combinations of Theories for Decidable Fragments of First-Order Logic
- Role of normal logical form in decision-making and knowledge management
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Quantifier simplification by unification in SMT
- Scalable fine-grained proofs for formula processing
- Canonical signed calculi with multi-ary quantifiers
- A note on the size of prenex normal forms
- Deciding expressive description logics in the framework of resolution
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments
- Combining decision procedures by (model-)equality propagation
- Inductive reasoning with equality predicates, contextual rewriting and variant-based simplification
- scientific article; zbMATH DE number 67125 (Why is no real title available?)
- Semantic forgetting in expressive description logics
- Translation of resolution proofs into short first-order proofs without choice axioms
- Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
- Finding connections via satisfiability solving
- Proof Transformations and Structural Invariance
- The problem of \(\Pi_{2}\)-cut-introduction
- Reasoning in description logics by a reduction to disjunctive datalog
- On Stronger Calculi for QBFs
- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
- Unification and anti-unification in applicative matching logic
This page was built for publication: Normal form transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2751356)
