Inference with path resolution and semantic graphs
Journal of the ACM (JACM)
Resolution for intuitionistic logic
Proceedings of the Second International Symposium on Methodologies for intelligent systems
HARP: a tableau-based theorem prover
Journal of Automated Reasoning
Journal of Automated Reasoning
The semantics of non-monotonic entailment defined using partial interpretations
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Note on theorem proving strategies for resolution counterparts of non-classical logics
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Employing path dissolution to shorten tableaux proofs
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Automatic theorem proving in paraconsistent logics: theory and implementation
CADE-10 Proceedings of the tenth international conference on Automated deduction
A tableaux-based theorem prover for a decidable subset of default logic
CADE-10 Proceedings of the tenth international conference on Automated deduction
Dissolution: making paths vanish
Journal of the ACM (JACM)
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
Journal of the ACM (JACM)
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
Resolution and Path Dissolution in Multi-Valued Logics
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics
CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
On the refutational completeness of signed binary resolution and hyperresolution
Fuzzy Sets and Systems
Hi-index | 0.00 |
We consider means for adapting classical deduction techniques to multiple-valued logics. Some recent work in this area, including our own, utilizes signs (subsets of the set of truth values). In this paper we develop a language of signed formulas that may be interpreted as a meta-level logic. Questions not expressible in the underlying logic are easily expressed in this meta-logic, and they may be answered with classical techniques because the logic is classical in nature. We illustrate the applicability of classical techniques by adapting resolution, path resolution, and path dissolution to signed formulas. The meta-logic admits a version of Herbrand's Theorem, so that these results extend naturally to the first order case. The fact that annotated logics are a special case of signed formulas is briefly illustrated.