Evaluation of an MSO-Solver

DOI10.1137/1.9781611972924.5zbMath1430.68415OpenAlexW4206392861MaRDI QIDQ5233717

Felix Reidl, Somnath Sikdar, Alexander Langer, Peter Rossmanith

Publication date: 12 September 2019

Published in: 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972924.5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Higher-order logic (03B16) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams, Exploiting Database Management Systems and Treewidth for Counting, Unnamed Item, Practical algorithms for MSO model-checking on tree-decomposable graphs, Parameterized shifted combinatorial optimization, Uniformly Automatic Classes of Finite Structures, Methods for solving reasoning problems in abstract argumentation -- a survey

Uses Software

• CPLEX
• MONA