Skip to main content
SpringerLink
Log in
Book cover

European Workshop on Logics in Artificial Intelligence

JELIA 1994: Logics in Artificial Intelligence pp 217–230Cite as

A unification of ordering refinements of resolution in classical logic

  • Conference paper
  • First Online:

  • 132 Accesses

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

Abstract

We introduce a general notion of resolution calculus. We show that it is possible to obtain a resolution calculus from a semantic tableau calculus that can be described by rules of a certain type. It is also possible to obtain an ordered resolution calculus from a semantic tableau calculus. We apply this to classical logic to obtain simple proofs of the completeness of several refinements of resolution in classical logic.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Baumgartner, An ordered theory resolution calculus, in LPAR92, Springer Verlag, Berlin, 1992.

    Google Scholar 

  2. R. S. Boyer, Locking: A restriction of resolution, Ph. D. Thesis, University of Texas at Austin, Texas 1971.

    Google Scholar 

  3. C-L. Chang, R. C-T Lee, Symbolic logic and mechanical theorem proving, Academic Press, New York, 1973.

    Google Scholar 

  4. P. Enjalbert, L. Fariñas, Modal resolution in clausal form, theoretical computer science 65, 1989.

    Google Scholar 

  5. C. Fermüller, A. Leitsch, T. Tammet, N. Zamov, Resolution Methods for the decision problem, LNAI 679, Springer Verlag, 1993.

    Google Scholar 

  6. W. H. Joyner, Resolution Strategies as Decision Procedures, Journal of the association for computing machinery, vol. 23, 1976.

    Google Scholar 

  7. D. W. Loveland, Automated theorem proving: A logical basis, North Holland Publishing Company, Amsterdam, New York, Oxford 1978.

    Google Scholar 

  8. G. Mints, Gentzen-type systems and resolution rules, Part 1, Propositional logic, in COLOG-88, pp 198–231, Springer Verlag, 1988.

    Google Scholar 

  9. H. de Nivelle, A general resolution scheme, reports of the faculty of technical mathematics and informatics, no. 93–62, Delft, 1993.

    Google Scholar 

  10. H. de Nivelle, Generic resolution in propositional modal systems, in LPAR93, Springer Verlag, Berlin, 1993.

    Google Scholar 

  11. J.A. Robinson, A machine-oriented logic based on the resolution principle, Journal of the ACM, Vol. 12, No. 1, pp 23–41.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Delft University of Technology, Julianalaan 132, 2628, BL Delft, The Netherlands

    Hans de Nivelle

Authors
  1. Hans de Nivelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Craig MacNish David Pearce Luís Moniz Pereira

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Nivelle, H. (1994). A unification of ordering refinements of resolution in classical logic. In: MacNish, C., Pearce, D., Pereira, L.M. (eds) Logics in Artificial Intelligence. JELIA 1994. Lecture Notes in Computer Science, vol 838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021974

Download citation

  • DOI: https://doi.org/10.1007/BFb0021974

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48657-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation