메뉴 건너뛰기




Volumn 213, Issue 1, 2008, Pages 75-94

An Algorithm for Approximating the Satisfiability Problem of High-level Conditions

Author keywords

first order satisfiability problem; graph transformation; high level conditions; high level programs; weak adhesive HLR categories

Indexed keywords

ALGORITHMS; GRAPH THEORY; NUMERICAL METHODS; PROBLEM SOLVING;

EID: 43549124542     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.04.075     Document Type: Article
Times cited : (10)

References (24)
  • 1
    • 43549121286 scopus 로고    scopus 로고
    • http://formale-sprachen.informatik.uni-oldenburg.de/pub/eindex.html
  • 3
    • 7044247195 scopus 로고    scopus 로고
    • The model evolution calculus
    • Proc. 19th International Conference on Automated Deduction. (CADE)
    • Baumgartner P., and Tinelli C. The model evolution calculus. Proc. 19th International Conference on Automated Deduction. (CADE). LNAI (LNCS) 2741 (2003) 350-364
    • (2003) LNAI (LNCS) , vol.2741 , pp. 350-364
    • Baumgartner, P.1    Tinelli, C.2
  • 4
    • 43549086460 scopus 로고    scopus 로고
    • Claessen, K. and N. Sörensson, New techniques that improve MACE-style finite model finding, in: Proc. CADE-19 Workshop on Model Computation (MODEL), 2003
    • Claessen, K. and N. Sörensson, New techniques that improve MACE-style finite model finding, in: Proc. CADE-19 Workshop on Model Computation (MODEL), 2003
  • 6
    • 84919401135 scopus 로고
    • A machine program for theorem-proving
    • Davis M., Logemann G., and Loveland D. A machine program for theorem-proving. Commun. ACM 5 (1962) 394-397
    • (1962) Commun. ACM , vol.5 , pp. 394-397
    • Davis, M.1    Logemann, G.2    Loveland, D.3
  • 7
    • 37849186024 scopus 로고    scopus 로고
    • Theory of constraints and application conditions: From graphs to high-level structures
    • Ehrig H., Ehrig K., Habel A., and Pennemann K.-H. Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae 74 (2006) 135-166
    • (2006) Fundamenta Informaticae , vol.74 , pp. 135-166
    • Ehrig, H.1    Ehrig, K.2    Habel, A.3    Pennemann, K.-H.4
  • 9
    • 37849185656 scopus 로고    scopus 로고
    • Adhesive high-level replacement systems: A new categorical framework for graph transformation
    • Ehrig H., Habel A., Padberg J., and Prange U. Adhesive high-level replacement systems: A new categorical framework for graph transformation. Fundamenta Informaticae 74 (2006) 1-29
    • (2006) Fundamenta Informaticae , vol.74 , pp. 1-29
    • Ehrig, H.1    Habel, A.2    Padberg, J.3    Prange, U.4
  • 10
    • 33750275273 scopus 로고    scopus 로고
    • Satisfiability of high-level conditions
    • Graph Transformations. (ICGT'06)
    • Habel A., and Pennemann K.-H. Satisfiability of high-level conditions. Graph Transformations. (ICGT'06). LNCS 4178 (2006) 430-444
    • (2006) LNCS , vol.4178 , pp. 430-444
    • Habel, A.1    Pennemann, K.-H.2
  • 11
    • 43549110319 scopus 로고    scopus 로고
    • A. and K.-H. Pennemann, Correctness of high-level transformation systems relative to nested conditions, 2008, submitted
    • A. and K.-H. Pennemann, Correctness of high-level transformation systems relative to nested conditions, 2008, submitted
  • 12
    • 33750254180 scopus 로고    scopus 로고
    • Weakest preconditions for high-level programs
    • Graph Transformations. (ICGT'06) a long version is available as technical report
    • Habel A., Pennemann K.-H., and Rensink A. Weakest preconditions for high-level programs. Graph Transformations. (ICGT'06). LNCS 4178 (2006) 445-460 a long version is available as technical report
    • (2006) LNCS , vol.4178 , pp. 445-460
    • Habel, A.1    Pennemann, K.-H.2    Rensink, A.3
  • 13
    • 84945253209 scopus 로고    scopus 로고
    • Computational completeness of programming languages based on graph transformation
    • Proc. Foundations of Software Science and Computation Structures
    • Habel A., and Plump D. Computational completeness of programming languages based on graph transformation. Proc. Foundations of Software Science and Computation Structures. LNCS 2030 (2001) 230-245
    • (2001) LNCS , vol.2030 , pp. 230-245
    • Habel, A.1    Plump, D.2
  • 14
    • 18944376711 scopus 로고
    • Ensuring consistency of conditional graph grammars
    • SEGRAGRA'95
    • Heckel R., and Wagner A. Ensuring consistency of conditional graph grammars. SEGRAGRA'95. ENTCS 2 (1995) 95-104
    • (1995) ENTCS , vol.2 , pp. 95-104
    • Heckel, R.1    Wagner, A.2
  • 15
    • 0002514541 scopus 로고
    • Algorithms for constraint satisfaction problems: A survey
    • Kumar V. Algorithms for constraint satisfaction problems: A survey. AI Magazine 13 (1992) 32-44
    • (1992) AI Magazine , vol.13 , pp. 32-44
    • Kumar, V.1
  • 16
    • 43549095978 scopus 로고    scopus 로고
    • McCune, W., MACE 2.0 reference manual and guide, Tech. Memo ANL/MCS-TM-249, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2001)
    • McCune, W., MACE 2.0 reference manual and guide, Tech. Memo ANL/MCS-TM-249, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2001)
  • 17
    • 43549086925 scopus 로고    scopus 로고
    • McCune, W., Mace4 reference manual and guide, Tech. Memo ANL/MCS-TM-264, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2003)
    • McCune, W., Mace4 reference manual and guide, Tech. Memo ANL/MCS-TM-264, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2003)
  • 18
    • 43549119583 scopus 로고    scopus 로고
    • Pfenning F. (Ed), Springer
    • In: Pfenning F. (Ed). Proc. 21th International Conference on Automated Deduction (CADE). LNAI (LNCS) 4603 (2007), Springer
    • (2007) LNAI (LNCS) , vol.4603
  • 19
    • 34248557712 scopus 로고    scopus 로고
    • Towards graph programs for graph algorithms
    • Graph Transformations. (ICGT'04)
    • Plump D., and Steinert S. Towards graph programs for graph algorithms. Graph Transformations. (ICGT'04). LNCS 3256 (2004) 128-143
    • (2004) LNCS , vol.3256 , pp. 128-143
    • Plump, D.1    Steinert, S.2
  • 20
    • 34548487973 scopus 로고    scopus 로고
    • Representing first-order logic by graphs
    • Graph Transformations. (ICGT'04)
    • Rensink A. Representing first-order logic by graphs. Graph Transformations. (ICGT'04). LNCS 3256 (2004) 319-335
    • (2004) LNCS , vol.3256 , pp. 319-335
    • Rensink, A.1
  • 21
    • 0000680026 scopus 로고
    • The impossibility of an algorithm for the decision problem on finite classes (In Russian)
    • Trakhtenbrot B.A. The impossibility of an algorithm for the decision problem on finite classes (In Russian). Doklady Akademii Nauk SSSR 70 (1950) 569-572
    • (1950) Doklady Akademii Nauk SSSR , vol.70 , pp. 569-572
    • Trakhtenbrot, B.A.1
  • 22
    • 33750723217 scopus 로고
    • Nine Papers on Logic and Quantum Electrodynamics
    • english translation in:
    • english translation in:. Nine Papers on Logic and Quantum Electrodynamics. AMS Transl. Ser. 2 23 (1963) 1-5
    • (1963) AMS Transl. Ser. 2 , vol.23 , pp. 1-5
  • 23
    • 0030212141 scopus 로고    scopus 로고
    • Constructing finite algebras with FALCON
    • Zhang J. Constructing finite algebras with FALCON. Journal of Automated Reasoning 17 (1996) 1-22
    • (1996) Journal of Automated Reasoning , vol.17 , pp. 1-22
    • Zhang, J.1
  • 24
    • 43549095018 scopus 로고    scopus 로고
    • Zhang, J. and H. Zhang, SEM: A system for enumerating models, in: Proc. International Joint Conferences on Artificial Intelligence (IJCAI), 1 (1995), pp. 298-303
    • Zhang, J. and H. Zhang, SEM: A system for enumerating models, in: Proc. International Joint Conferences on Artificial Intelligence (IJCAI), 1 (1995), pp. 298-303


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