A resolution principle for a logic with restricted quantifiers
From MaRDI portal
Publication:1596540
zbMath0985.03517MaRDI QIDQ1596540
Publication date: 22 May 2002
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
A resolution principle for constrained logics ⋮ Refutational theorem proving for hierarchic first-order theories ⋮ On the complexity of Boolean unification ⋮ Combination of constraint solving techniques: An algebraic point of view ⋮ Linear and unit-resulting refutations for Horn theories ⋮ Combination of constraint solvers for free and quasi-free structures ⋮ Programming in metric temporal logic ⋮ Theorem proving modulo ⋮ Theorem proving in cancellative abelian monoids (extended abstract) ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ A hybrid reasoning system for terminologies and first-order clauses in knowledge bases ⋮ A practical integration of first-order reasoning and decision procedures ⋮ A typed resolution principle for deduction with conditional typing theory
This page was built for publication: A resolution principle for a logic with restricted quantifiers
