Skip to main content
SpringerLink
Log in

Improved Propositional Extension Rule

  • Conference paper
Book cover Rough Sets and Knowledge Technology (RSKT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4062))

Included in the following conference series:

Abstract

Method based on extension rule is a new method for theorem proving, whether or not it will behave well in theorem proving depends on the efficiency. Moreover, the efficiency of propositional extension rule will affect that of first order extension rule directly. Thus the efficiency of the propositional extension rule is very important. ER and IER are two extension rule methods Lin gave. We have improved the ER method before. In order to increase the efficiency of IER, this paper improves IER by some reduction rules. And then the soundness and completeness of it is proved. We also report some preliminary computational results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Robinson, J.A., et al. (eds.): Handbook of Automated Reasoning. Elsevier Science Publishers, Amsterdam (2002)

    Google Scholar 

  2. Fenkam, P., Jazayeri, M., Reif, G.: On methodologies for constructing correct event-based applications. In: Proc. of 3rd International Workshop on Distributed Event-Based Systems, Edinburgh, UK, pp. 38–43 (2004)

    Google Scholar 

  3. Kubica, J., Rieffel, E.G.: Collaborating with a genetic programming system to generate modular robotic code. In: Proc. of Genetic and Evolutionary Computation Conference, New York, USA, pp. 804–811 (2002)

    Google Scholar 

  4. Lin, H., Sun, J.G., Zhang, Y.M.: Theorem proving based on extension rule. Journal of Automated Reasoning 31, 11–21 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Wu, X., Sun, J.G., Lu, S., Yin, M.H.: Propositional extension rule with reduction. IJCSNS International Journal of Computer Science and Network Security 6, 190–195 (2006)

    Google Scholar 

  6. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201–215 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  7. Liu, X.H.: The theorem proof based on resolution (in Chinese). Science Press, Beijing (1994)

    Google Scholar 

  8. Dechter, R., Rish, I.: Directional resolution: The Davis-Putnam procedure, revisited. In: Proc. of 4th International Conference on Principles of KR&R, Bonn, Germany, pp. 134–145 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Jilin University, 130012, Changchun, China

    Xia Wu, Jigui Sun, Shuai Lu, Ying Li & Wei Meng

  2. Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education, 130012, Changchun, China

    Xia Wu, Jigui Sun, Shuai Lu, Ying Li & Wei Meng

  3. College of Computer, Northeast Normal University, 130017, Changchun, China

    Minghao Yin

Authors
  1. Xia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jigui Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shuai Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ying Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wei Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Minghao Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computer Science and Technology, Chongqing, University of Posts and Telecommunication, 400065, Chongqing, P.R. China

    Guo-Ying Wang

  2. Department of Electrical and Computer Engineering, University of Manitoba, R3T 5V6, Winnipeg, Manitoba, Canada

    James F. Peters

  3. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

  4. Department of Computer Science, University of Regina, Regina,, S4S 0A2, Saskatchewan, Canada

    Yiyu Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, X., Sun, J., Lu, S., Li, Y., Meng, W., Yin, M. (2006). Improved Propositional Extension Rule. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_86

Download citation

  • DOI: https://doi.org/10.1007/11795131_86

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36297-5

  • Online ISBN: 978-3-540-36299-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation