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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Pennemann, K. H. (2008). Resolution-like theorem proving for high-level conditions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5214 LNCS, pp. 289–304). https://doi.org/10.1007/978-3-540-87405-8_20
Mendeley helps you to discover research relevant for your work.