Efficient SAT-based minimal model generation methods for modal logic S5

DOI10.1007/978-3-030-80223-3_16MaRDI QIDQ2118302zbMATH OpenOpenAlexFDO

Authors Pei Huang, Rundong Li, Minghao Liu, Feifei Ma, Jian Zhang

Publication date 22 March 2022

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

zbMATH Keywords

MaxSATminimal modelmodal logic S5SATsymmetry breaking

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)

Cites work

• A benchmark method for the propositional modal logics K, KT, S4
• A simple propositional \(\text{S}5\) tableau system
• A tableau calculus for minimal modal model generation
• An assumption-based approach for solving the minimal S5-satisfiability problem
• scientific article; zbMATH DE number 1612536 (Why is no real title available?)
• scientific article; zbMATH DE number 1946871 (Why is no real title available?)
• scientific article; zbMATH DE number 6863635 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• One-Pass Tableaux for Computation Tree Logic
• Operational semantics and program verification using many-sorted hybrid modal logic
• RC2: an efficient MaxSAT solver
• Terminating minimal model generation procedures for propositional modal logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Three new upper bounds on the chromatic number
• Weak models of distributed computing, with connections to modal logic

Describes a project that uses

Uses Software

• RC2

This page was built for publication: Efficient SAT-based minimal model generation methods for modal logic S5

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