A complete axiomatisation for the inclusion of series-parallel partial orders
From MaRDI portal
Publication:4594231
DOI10.1007/3-540-62950-5_74zbMath1379.06001OpenAlexW1563008855MaRDI QIDQ4594231
Philippe de Groote, Christian Retoré, Denis Béchet
Publication date: 17 November 2017
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-62950-5_74
Related Items
Computing directed Steiner path covers ⋮ Ranking chain sum orders ⋮ Poset loops ⋮ Non-normal modalities in variants of linear logic ⋮ Handsome proof-nets: Perfect matchings and cographs ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Comparability digraphs: an analogue of comparability graphs ⋮ Directed NLC-width ⋮ Solutions for subset sum problems with special digraph constraints ⋮ How to compute digraph width measures on directed co-graphs ⋮ Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ A mixed \(\lambda\)-calculus ⋮ Oriented coloring on recursively defined digraphs ⋮ On characterizations for subclasses of directed co-graphs ⋮ Confluence by critical pair analysis revisited ⋮ Comparing linear width parameters for directed graphs ⋮ Miscellaneous Digraph Classes ⋮ Pomset Logic
This page was built for publication: A complete axiomatisation for the inclusion of series-parallel partial orders
