DiMo -- discrete modelling using propositional logic

DOI10.1007/978-3-030-80223-3_17MaRDI QIDQ2118304zbMATH OpenOpenAlexFDO

Authors 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) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 4200183
• On models for propositional dynamic logic
• Propositional semantics for disjunctive logic programs
• Disjunction in modal description logics
• Model generation and state generation for disjunctive logic programs
• Disjunctive logic and semantics of disjunctive logic programs
• A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
• scientific article; zbMATH DE number 1114054
• scientific article; zbMATH DE number 1926616

Cites work

• Bounded model checking using satisfiability solving
• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard

Describes a project that uses

Uses Software

• GitHub

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118304)