Hyperresolution for guarded formulae
From MaRDI portal
Recommendations
Cites work
- A structure-preserving clause form translation
- Combining superposition, sorts and splitting
- Computational Space Efficiency and Minimal Model Generation for Guarded Formulae
- Deciding the guarded fragments by resolution
- Decision procedures for guarded logics
- FDPLL -- a first-order Davis-Putnam-Logeman-Loveland procedure
- scientific article; zbMATH DE number 440110 (Why is no real title available?)
- scientific article; zbMATH DE number 517065 (Why is no real title available?)
- scientific article; zbMATH DE number 1531967 (Why is no real title available?)
- scientific article; zbMATH DE number 834561 (Why is no real title available?)
- scientific article; zbMATH DE number 3254919 (Why is no real title available?)
- Hyper tableau -- the next generation
- Hyper tableaux
- Issues of decidability for description logics in the framework of resolution
- Modal languages and bounded fragments of predicate logic
- On the Restraining Power of Guards
- Resolution decision procedures
- Resolution theorem proving
- Resolution-based methods for modal logics
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- Simplification and backjumping in modal tableau
- Soft typing for ordered resolution
- Tableau methods for modal and temporal logics
- Using resolution for testing modal satisfiability and building models
Cited in
(11)- A new methodology for developing deduction methods
- Extracting models from clause sets saturated under semantic refinements of the resolution rule.
- Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \)
- Blocking and other enhancements for bottom-up model generation methods
- Simulation and synthesis of deduction calculi
- Individual Reuse in Description Logic Reasoning
- First-order resolution methods for modal logics
- A resolution-based model building algorithm for a fragment of \(\mathcal{OCC}1\mathcal{N}_{=}\) (extended abstract)
- Simplification of Horn clauses that are clausal forms of guarded formulas
- Representing and building models for decidable subclasses of equational clausal logic
- Some techniques for proving termination of the hyperresolution calculus
This page was built for publication: Hyperresolution for guarded formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404983)