Skip to main content
SpringerLink
Log in

Implicates and Reduction Techniques for Temporal Logics

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 1998)

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

Included in the following conference series:

  • 230 Accesses

Abstract

Reduction strategies are introduced for the future fragment of a temporal propositional logic on linear discrete time, named FNext. These reductions are based in the information collected from the syntactic structure of the formula, which allow the development of efficient strategies to decrease the size of temporal propositional formulas, viz. new criteria to detect the validity or unsatisfiability of subformulas, and a strong generalisation of the pure literal rule. These results, used as a preprocessing step, allow to improve the performance of any automated theorem prover.

Partially supported by Spanish CICYT project TIC97-0579-C02-02 and EC action COST-15: Many-valued logics for computer science applications.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. G. Aguilera, I. P. de Guzmán, and M. Ojeda. Increasing the efficiency of automated theorem proving. Journal of Applied Non-Classical Logics, 5(1):9–29, 1995.

    MATH  MathSciNet  Google Scholar 

  2. R. Ben-Eliyahu and M. Magidor. A temporal logic for proving properties of topologically general executions. Information and Computation 124(2):127–144, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  3. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM 42(4):857–907, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. L. Fix and O. Grumberg. Verification of temporal properties. Journal of Logic and Computation 6(3):343–362, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  5. Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems: specifications. Springer-Verlag, 1992.

    Google Scholar 

  6. Z. Manna and A. Pnueli. Temporal verification of reactive systems: Safety. Springer-Verlag, 1995.

    Google Scholar 

  7. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733–749, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Wolper. The tableaux method for temporal logic: an overview. Logique et Analyse 28 année, 110–111:119–136, 1985.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Matemática Aplicada, Universidad de Málaga, Spain

    Inman P. de Guzmán, Manuel Ojeda-Aciego & Augustín Valverde

Authors
  1. Inman P. de Guzmán
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Ojeda-Aciego
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Augustín Valverde
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, Maryland, 20742, USA

    Jürgen Dix

  2. I.R.I.T. Université Paul Sabatier, 118 route de Narbonne, F-31062, Toulouse Cedex, France

    Luís Fariñas del Cerro

  3. Fachbereich 4: Informatik, Universität Koblenz, Rheinau 1, D-56075, Koblenz, Germany

    Ulrich Furbach

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Guzmán, I.P., Ojeda-Aciego, M., Valverde, A. (1998). Implicates and Reduction Techniques for Temporal Logics. In: Dix, J., del Cerro, L.F., Furbach, U. (eds) Logics in Artificial Intelligence. JELIA 1998. Lecture Notes in Computer Science(), vol 1489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49545-2_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-49545-2_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65141-3

  • Online ISBN: 978-3-540-49545-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation