scientific article
From MaRDI portal
Publication:3142019
zbMath0789.03016MaRDI QIDQ3142019
Publication date: 14 June 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Logic programming (68N17)
Related Items (8)
Representing and building models for decidable subclasses of equational clausal logic ⋮ Some techniques for proving termination of the hyperresolution calculus ⋮ Extracting models from clause sets saturated under semantic refinements of the resolution rule. ⋮ Hyperresolution for guarded formulae ⋮ Simplifying and generalizing formulae in tableaux. Pruning the search space and building models ⋮ Deciding expressive description logics in the framework of resolution ⋮ A resolution-based decision procedure for \({\mathcal{SHOIQ}}\). ⋮ A Resolution-based Model Building Algorithm for a Fragment of OCC1N =
This page was built for publication:
