DiMo -- discrete modelling using propositional logic

DOI10.1007/978-3-030-80223-3_17OpenAlexW3186595753MaRDI QIDQ2118304

Norbert Hundeshagen, Martin Lange, Georg Siebert

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• GitHub

Cites Work

• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Bounded model checking using satisfiability solving
• Unnamed Item

This page was built for publication: DiMo -- discrete modelling using propositional logic