Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic for Programming Artificial Intelligence and Reasoning

LPAR 1993: Logic Programming and Automated Reasoning pp 241–252Cite as

Generic resolution in propositional modal systems

  • Conference paper
  • First Online:

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

Abstract

We present a generic method to obtain resolution systems for modal propositional logics. The rules of a resolution system for a modal logic can be derived from the frame properties that characterize the logic. We characterize the set of frame properties for which our method works.

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. L. Catach, TABLEAUX, a general theorem prover for modal logics, Journal of automated reasoning 7, pp. 489–510, 1991.

    Google Scholar 

  2. P. Enjalbert, L. Fariñas del Cerro, Modal resolution in clausal form, Theoretical Computer Science 65, 1989.

    Google Scholar 

  3. L. Fariñas del Cerro and A. Herzig, linear modal deductions, CADE '88, pp. 487–499, 1988.

    Google Scholar 

  4. M. Fitting, First-order modal tableaux, Journal of automated resoning 4, pp. 191–213, 1991.

    Google Scholar 

  5. M. Fitting, Destructive Modal Resolution, Journal of Logic and Computation, volume 1, pp. 83–97, 1990.

    Google Scholar 

  6. A. Foret, Rewrite rule systems for modal propositional logic, Journal of logic programming 12, pp. 281–298, 1992.

    Article  Google Scholar 

  7. R. Goldblatt, Logics of Time and Computation, CSLI Stanford/Palo Alto/Menlo Park, 1987.

    Google Scholar 

  8. G.E. Hughes, M.J. Cresswell, A companion to modal logic, Methuen and Co, London, New York, 1984.

    Google Scholar 

  9. R.E. Ladner, The computational complexity of provability in systems of modal propositional logic, SIAM Journal on Computing 6, pp 467–480, 1977.

    Article  Google Scholar 

  10. H. de Nivelle, Generic modal resolution, Technical Report 92-90, Delft University of Technology, fac. TWI, 1992.

    Google Scholar 

  11. H.J. Ohlbach, A resolution calculus for modal logics, PhD thesis, Universität Kaiserslautern, 1988.

    Google Scholar 

  12. H.J. Ohlbach, A resolution calculus for modal logics, CADE '88, pp. 500–516, 1988.

    Google Scholar 

  13. R. Sommerhalder, S.C. van Westrhenen, Resolution in modal propositional logic. Technical Report 91-59, Delft University of Technology, fac TWI, 1991.

    Google Scholar 

  14. R. Sommerhaider, A resolution method for some systems of modal logic, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of mathematics and computer science, Delft University of Technology, Julianalaan 132, 2628BL, Delft, Netherlands

    H. de Nivelle

Authors
  1. H. de Nivelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Nivelle, H. (1993). Generic resolution in propositional modal systems. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-56944-8_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56944-2

  • Online ISBN: 978-3-540-47830-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation