Theorem Proving Based on the Extension Rule

Journal of Automated Reasoning

Volumn 31, Issue 1, 2003, Pages 11-21

  Hai, Lin ^a   Jigui, Sun ^a   Yimin, Zhang ^a  

^a JUIN UNIVERSITY   (China)

Author keywords

Complementary factor; Extension rule; Inclusion exclusion principle; Theorem proving

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; PROBLEM SOLVING;

EXTENSION RULE; INCLUSION-EXCLUSION PRINCIPLE;

THEOREM PROVING;

EID: 0344927110     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1027339205632     Document Type: Article

References (7)

1. del Val, A.: On some tractable classes in deduction and abduction, Artificial Intelligence 116 (2000), 297-313.
2. Hooker, J. N., Rago, G., Chandru, V. and Shrivastava, A.: Partial instantiation methods for inference in first-order logic, J. Automated Reasoning 28(4) (2002), 371-396.
3. Selman, B. and Kautz, H. A.: Knowledge compilation using Horn approximation, in Proc. of AMI-1991, 1991, pp. 904-909.
4. Dechter, R. and Rish, I.: Directional resolution: The Davis-Putnam procedure, revisited, in Proc. of the 4th International Conference on Principles of KR&R, 1994, pp. 134-145.
5. del Val, A.: Tractable classes for directional resolution, in AAAI'2000, Proc. 17th Nat. Conf. on Artificial Intelligence, 2000, pp. 343-348.
6. Rish, I. and Dechter, R.: Resolution versus search: Two strategies for SAT, in Frontiers in Artificial Intelligence and Applications, IOS Press, 2000, pp. 215-259.
7. Dechter, R.: Bucket elimination: A unifying framework for structure-driven inference, in Learning and Inference in Graphical Models, 1998.