CoReS: a tool for computing core graphs via SAT/SMT solvers

DOI10.1016/j.jlamp.2019.100484zbMath1435.68174OpenAlexW4251426583MaRDI QIDQ5918209

Maxime Nederkorn, Dennis Nolte, Barbara König

Publication date: 28 November 2019

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2019.100484

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Computational aspects of satisfiability (68R07)

Related Items

Unification and combination of a class of traversal strategies made with pattern matching and fixed-points ⋮ Preface to the special issue on the 11th international conference on graph transformation ⋮ CoReS ⋮ SemidefiniteProgramming

Uses Software

• SMT-LIB
• z3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The core of a graph
• Attributed graph transformation with node type inheritance
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Specifying graph languages with type graphs
• Fundamentals of algebraic graph transformation
• Emergence of Scaling in Random Networks
• Data exchange: getting to the core
• Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
• Graph Transformation Units Guided by a SAT Solver
• Graphical Conjunctive Queries.
• Random Graphs
• CoReS: a tool for computing core graphs via SAT/SMT solvers