In this section
@inbook{Huth:2019:10.1007/978-3-030-22348-9_18,
author = {Huth, M},
booktitle = {Lecture Notes in Computer Science},
doi = {10.1007/978-3-030-22348-9_18},
pages = {297--309},
publisher = {Springer International Publishing},
title = {The merits of compositional abstraction: A case study in propositional logic},
url = {http://dx.doi.org/10.1007/978-3-030-22348-9_18},
year = {2019}
}
TY - CHAP
AB - We revisit a well-established and old topic in computational logic: algorithms – such as the one by Quine-McCluskey – that convert a formula of propositional logic into a semantically equivalent disjunctive normal form whose clauses are all prime implicants of that formula. This exercise in education is meant to honor Bernhard Steffen, who made important contributions in formal verification and its use of compositional abstraction, and who is a role model in transferring research insights into teaching addressed at students with varying skill levels. The algorithm we propose here is indeed compositional and can teach students about the value of compositional abstractions – making use of simple lattice-theoretic and semantic concepts.
AU - Huth,M
DO - 10.1007/978-3-030-22348-9_18
EP - 309
PB - Springer International Publishing
PY - 2019///
SN - 9783030223472
SP - 297
TI - The merits of compositional abstraction: A case study in propositional logic
T1 - Lecture Notes in Computer Science
UR - http://dx.doi.org/10.1007/978-3-030-22348-9_18
UR - https://link.springer.com/chapter/10.1007%2F978-3-030-22348-9_18
ER -