메뉴 건너뛰기




Volumn 5214 LNCS, Issue , 2008, Pages 289-304

Resolution-like theorem proving for high-level conditions

Author keywords

First order tautology problem; High level conditions; Resolution; Theorem proving; Weak adhesive HLR categories

Indexed keywords

DIFFERENTIATION (CALCULUS); GRAPH THEORY; MARINE BIOLOGY; MATHEMATICAL TECHNIQUES;

EID: 56449102590     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87405-8_20     Document Type: Conference Paper
Times cited : (38)

References (20)
  • 2
    • 0000809609 scopus 로고
    • Graph rewriting: An algebraic and logical approach
    • Elsevier, Amsterdam
    • Courcelle, B.: Graph rewriting: An algebraic and logical approach. In: Handbook of Theoretical Computer Science, vol. B, pp. 193-242. Elsevier, Amsterdam (1990)
    • (1990) Handbook of Theoretical Computer Science , vol.B , pp. 193-242
    • Courcelle, B.1
  • 4
    • 37849186024 scopus 로고    scopus 로고
    • Theory of constraints and application conditions: From graphs to high-level structures
    • 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)
    • (2006) Fundamenta Informaticae , vol.74 , pp. 135-166
    • Ehrig, H.1    Ehrig, K.2    Habel, A.3    Pennemann, K.-H.4
  • 6
    • 84945253209 scopus 로고    scopus 로고
    • Computational completeness of programming languages based on graph transformation
    • Honsell, F, Miculan, M, eds, FOSSACS 2001, Springer, Heidelberg
    • 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)
    • (2001) LNCS , vol.2030 , pp. 230-245
    • Habel, A.1    Plump, D.2
  • 7
    • 36849040453 scopus 로고    scopus 로고
    • Nested constraints and application conditions for high-level structures
    • Kreowski, H.-J, Montanari, U, Orejas, F, Rozenberg, G, Taentzer, G, eds, Formal Methods in Software and Systems Modeling, Springer, Heidelberg
    • 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)
    • (2005) LNCS , vol.3393 , pp. 293-308
    • Habel, A.1    Pennemann, K.-H.2
  • 8
    • 56449101052 scopus 로고    scopus 로고
    • Correctness of high-level transformation systems relative to nested conditions
    • Accepted for publication
    • Habel, A., Pennemann, K.-H.: Correctness of high-level transformation systems relative to nested conditions. In: MSCS 2008 (Accepted for publication, 2008)
    • (2008) MSCS
    • Habel, A.1    Pennemann, K.-H.2
  • 9
    • 33750254180 scopus 로고    scopus 로고
    • Habel, A., Pennemann, K.-H., Rensink, A.: Weakest preconditions for highlevel programs. in: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, 4178, pp. 445-460. Springer, Heidelberg (2006)
    • Habel, A., Pennemann, K.-H., Rensink, A.: Weakest preconditions for highlevel programs. in: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 445-460. Springer, Heidelberg (2006)
  • 10
    • 56449117905 scopus 로고    scopus 로고
    • Heckel, R., Wagner, A.: Ensuring consistency of conditional graph grammars. in: SEGRAGRA 1995. ENTCS, 2, pp. 95-104 (1995)
    • Heckel, R., Wagner, A.: Ensuring consistency of conditional graph grammars. in: SEGRAGRA 1995. ENTCS, vol. 2, pp. 95-104 (1995)
  • 11
    • 18444367403 scopus 로고    scopus 로고
    • Graph-based specification of access control policies
    • Koch, M., Mancini, L.V., Parisi-Presicce, F.: Graph-based specification of access control policies. JCSS 71, 1-33 (2005)
    • (2005) JCSS , vol.71 , pp. 1-33
    • Koch, M.1    Mancini, L.V.2    Parisi-Presicce, F.3
  • 13
    • 47249099893 scopus 로고    scopus 로고
    • Orejas, F., Ehrig, H., Prange, U.: A logic of graph constraints. in: Fiadeiro, J.L., Inverardi, P. (eds.) EASE 2008. LNCS, 4961, pp. 179-199. Springer, Heidelberg (2008)
    • Orejas, F., Ehrig, H., Prange, U.: A logic of graph constraints. in: Fiadeiro, J.L., Inverardi, P. (eds.) EASE 2008. LNCS, vol. 4961, pp. 179-199. Springer, Heidelberg (2008)
  • 14
    • 56449102070 scopus 로고    scopus 로고
    • Attributed graph constraints
    • Ehrig, H, et al, eds, Proc. ICGT, Springer, Heidelberg
    • Orejas, F.: Attributed graph constraints. In: Ehrig, H., et al. (eds.) Proc. ICGT 2008. LNCS, vol. 5214, Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5214
    • Orejas, F.1
  • 16
    • 43549124542 scopus 로고    scopus 로고
    • An algorithm for approximating the satisfiability problem of high-level conditions
    • Elsevier, Amsterdam
    • 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)
    • (2008) Proc. GT-VC 2007. ENTCS , vol.213 , pp. 75-94
    • Pennemann, K.-H.1
  • 17
    • 34548487973 scopus 로고    scopus 로고
    • Rensink, A.: Representing first-order logic by graphs. in: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, 3256, pp. 319-335. Springer, Heidelberg (2004)
    • 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)
  • 18
    • 84918983692 scopus 로고
    • A machine-oriented logic based on the resolution principle
    • Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM 12, 23-41 (1965)
    • (1965) Journal of the ACM , vol.12 , pp. 23-41
    • Robinson, J.A.1
  • 19
    • 0036327027 scopus 로고    scopus 로고
    • The design and implementation of VAMPIRE
    • Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. Ai Communications 15(2-3), 91-110 (2002)
    • (2002) Ai Communications , vol.15 , Issue.2-3 , pp. 91-110
    • Riazanov, A.1    Voronkov, A.2
  • 20
    • 40949125146 scopus 로고    scopus 로고
    • Modeling and verifying graph transformations in proof assistants
    • Elsevier, Amsterdam
    • Strecker, M.: Modeling and verifying graph transformations in proof assistants. In: Proc. Termgraph 2007. ENTCS, vol. 203, pp. 135-148. Elsevier, Amsterdam (2008)
    • (2008) Proc. Termgraph 2007. ENTCS , vol.203 , pp. 135-148
    • Strecker, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.