Investigating and Computing Bipartitions with Algebraic Means

DOI10.1007/978-3-319-24704-5_16zbMath1471.08001OpenAlexW2257625122MaRDI QIDQ3460630

Michael Winter, Rudolf Berghammer, Insa Stucke

Publication date: 8 January 2016

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24704-5_16

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Relational systems, laws of composition (08A02) Other classical set theory (including functions, relations, and set algebra) (03E20) Categories of spans/cospans, relations, or partial maps (18B10) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (3)

Using relation-algebraic means and tool support for investigating and computing bipartitions ⋮ Algebraic Investigation of Connected Components ⋮ Cardinalities of Finite Relations in Coq

Uses Software

• Coq
• RelView
• Isabelle/HOL
• Prover9

This page was built for publication: Investigating and Computing Bipartitions with Algebraic Means