Skip to main content
SpringerLink
Log in

Resolution-Like Theorem Proving for High-Level Conditions

  • Conference paper
Graph Transformations (ICGT 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5214))

Included in the following conference series:

Abstract

The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its soundness, investigate the necessity of each deduction rule, and discuss practical aspects concerning an implementation. As we use the framework of weak adhesive HLR categories, the calculus is applicable to a number of replacement capable structures, such as Petri-Nets, graphs or hypergraphs.

This work is supported by the German Research Foundation (DFG), grants GRK 1076/1 (Graduate School on Trustworthy Software Systems) and HA 2936/2 (Development of Correct Graph Transformation Systems).

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. Baumgartner, P., Fuchs, A., Tinelli, C.: Implementing the model evolution calculus. Int. Journal on Artificial Intelligence Tools 15(1), 21–52 (2006)

    Article  Google Scholar 

  2. Courcelle, B.: Graph rewriting: An algebraic and logical approach. In: Handbook of Theoretical Computer Science, vol. B, pp. 193–242. Elsevier, Amsterdam (1990)

    Google Scholar 

  3. Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, Heidelberg (1989)

    Google Scholar 

  4. Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.-H.: Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae 74, 135–166 (2006)

    MATH  MathSciNet  Google Scholar 

  5. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs of Theoretical Computer Science. Springer, Berlin (2006)

    MATH  Google Scholar 

  6. Habel, A., Plump, D.: Computational completeness of programming languages based on graph transformation. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 230–245. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Habel, A., Pennemann, K.-H.: Nested constraints and application conditions for high-level structures. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 293–308. Springer, Heidelberg (2005)

    Google Scholar 

  8. Habel, A., Pennemann, K.-H.: Correctness of high-level transformation systems relative to nested conditions. In: MSCS 2008 (Accepted for publication, 2008)

    Google Scholar 

  9. Habel, A., Pennemann, K.-H., Rensink, A.: Weakest preconditions for high-level programs. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 445–460. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Heckel, R., Wagner, A.: Ensuring consistency of conditional graph grammars. In: SEGRAGRA 1995. ENTCS, vol. 2, pp. 95–104 (1995)

    Google Scholar 

  11. Koch, M., Mancini, L.V., Parisi-Presicce, F.: Graph-based specification of access control policies. JCSS 71, 1–33 (2005)

    MATH  MathSciNet  Google Scholar 

  12. McCune, W.: Homepage of Prover9 (2008), http://www.prover9.org/

  13. Orejas, F., Ehrig, H., Prange, U.: A logic of graph constraints. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 179–199. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Orejas, F.: Attributed graph constraints. In: Ehrig, H., et al. (eds.) Proc. ICGT 2008. LNCS, vol. 5214, Springer, Heidelberg (2008)

    Google Scholar 

  15. Pennemann, K.-H.: Generalized constraints and application conditions for graph transformation systems. Master’s thesis, Department of Computing Science, University of Oldenburg, Oldenburg (2004)

    Google Scholar 

  16. Pennemann, K.-H.: An algorithm for approximating the satisfiability problem of high-level conditions. In: Proc. GT-VC 2007. ENTCS, vol. 213, pp. 75–94. Elsevier, Amsterdam (2008)

    Google Scholar 

  17. Rensink, A.: Representing first-order logic by graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319–335. Springer, Heidelberg (2004)

    Google Scholar 

  18. Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM 12, 23–41 (1965)

    Article  MATH  Google Scholar 

  19. Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Communications 15(2-3), 91–110 (2002)

    MATH  Google Scholar 

  20. Strecker, M.: Modeling and verifying graph transformations in proof assistants. In: Proc. Termgraph 2007. ENTCS, vol. 203, pp. 135–148. Elsevier, Amsterdam (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Oldenburg, Germany

    Karl-Heinz Pennemann

Authors
  1. Karl-Heinz Pennemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Hartmut Ehrig

  2. Department of Computer Science, University of Leicester, Leicester, UK

    Reiko Heckel

  3. Leiden Center for Natural Computing, Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  4. Department of Mathematics and Computer Science, Philipps-University Marburg, Marburg, Germany

    Gabriele Taentzer

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pennemann, KH. (2008). Resolution-Like Theorem Proving for High-Level Conditions. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87405-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87404-1

  • Online ISBN: 978-3-540-87405-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation