An assumption-based approach for solving the minimal S5-satisfiability problem

DOI10.1007/978-3-319-94205-6_1OpenAlexW2810892201MaRDI QIDQ1799062

Daniel Le Berre, Jean-Marie Lagniez, Valentin Montmirail, Tiago de Lima

Publication date: 18 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94205-6_1

zbMATH Keywords

modal logicminimisationincremental SATS5

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

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

Uses Software

• MiniSat
• SCIP
• SPASS
• Sat4j
• E Theorem Prover
• Spartacus
• LMHS
• MSPASS
• InKreSAT