A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
[chapter]
2005
Lecture Notes in Computer Science
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. basic superposition, a calculus highly optimized for theorem proving with equality. However, even such an advanced calculus does not restrict inferences enough to obtain decision procedures for complex logics, such as SHIQ. In this paper, we present a new decomposition inference rule, which can be combined with any
doi:10.1007/978-3-540-32275-7_2
fatcat:vm25lzogenbudij2knpbvhkf7u