SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation

DOI10.1080/11663081.2000.10510994zbMath1033.03500OpenAlexW1992640528MaRDI QIDQ4443408

Roberto Sebastiani, Enrico Giunchiglia, Armando Tacchella, Fausto Giunchiglia

Publication date: 11 January 2004

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2000.10510994

zbMATH Keywords

experimental analysispropositional satisfiabilitydecision procedures

Mathematics Subject Classification ID

Related Items (4)

Unnamed Item ⋮ A rigorous methodology for specification and verification of business processes ⋮ EXPtime tableaux for ALC ⋮ Modal Logic S5 Satisfiability in Answer Set Programming

Uses Software

• FaCT++

Cites Work

• Proof methods for modal and intuitionistic logics
• Complexity results for classes of quantificational formulas
• A guide to completeness and complexity for modal logics of knowledge and belief
• Exploiting the deep structure of constraint problems
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• Semantics-Based Translation Methods for Modal Logics
• Resolution Strategies as Decision Procedures
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• A Computing Procedure for Quantification Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation