Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
A machine program for theorem-proving
Communications of the ACM
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
SEM: a system for enumerating models
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Satisfiability of high-level conditions
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Weakest preconditions for high-level programs
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Resolution-Like Theorem Proving for High-Level Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Development of Correct Graph Transformation Systems
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
Local confluence for rules with nested application conditions
ICGT'10 Proceedings of the 5th international conference on Graph transformations
| Hi-index | 0.00 |
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, we present a non-deterministic, monotone algorithm for this undecidable problem on graphical conditions that is both correct and complete, but in general not guaranteed to terminate. For a fragment of high-level conditions, the algorithm terminates, hence it is able to decide. Instead of enumerating all possible objects of a category to approach the problem, the algorithm uses the input condition in a constructive way to progress towards a solution. To this aim, programs over transformation rules with external interfaces are considered. We use the framework of weak adhesive HLR categories. Consequently, the algorithm is applicable to a number of replacement capable structures, such as Petri-Nets, graphs or hypergraphs.