Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ \mathcal{ALC}

DOI10.1007/11814948_15MaRDI QIDQ5756583zbMATH OpenOpenAlexFDO

Authors Roberto Sebastiani, Michele Vescovi

Publication date 4 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11814948_15

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27)

Recommendations

• Automated reasoning in modal and description logics via SAT encoding: the case study of \(K_m/\mathcal{ALC}\)-satisfiability
• Constraint programming for modelling and solving modal satisfiability
• Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
• Modal Satisfiability via SMT Solving
• scientific article; zbMATH DE number 1538057

Cited in

(2)

• Automated reasoning in modal and description logics via SAT encoding: the case study of \(K_m/\mathcal{ALC}\)-satisfiability
• scientific article; zbMATH DE number 1612595 (Why is no real title available?)

This page was built for publication: Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ $\mathcal{ALC}$

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