Well-Behaved Inference Rules for First-Order Theorem Proving

Authors:
Jinzhao Wu;Zhuojun Liu
Affiliations:
Department of Mathematics, Peking University, Beijing 100871, China;Institute of Systems Science, Academia Sinica, Beijing 100080, China
Venue:
Journal of Automated Reasoning
Year:
1998

Citing 7
Cited 0

Refutational theorem proving using term-rewriting systems

Artificial Intelligence
Automated reasoning: 33 BASIC research problems

Automated reasoning: 33 BASIC research problems
A new method for the Boolean ring based theorem proving

Journal of Symbolic Computation
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
On the Unnecessity of Multiple Overlaps in Completion Theorem Proving

Künstliche Intelligenz, GWAI-88, 12. Jahrestagung
Topics in automated theorem proving and program generation

Topics in automated theorem proving and program generation
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of well-behaved inference rules is developed in first-orderpolynomial-based theorem proving. It is shown that well-behaved inferencerules are complete for both the set of support strategy and the linearstrategy. Furthermore, two concrete inference rules that are well behavedare presented, and two other strategies for them are described.