A subset-matching size-bounded cache for satisfiability in modal logics

DOI10.1007/10722086_20MaRDI QIDQ2721199zbMATH OpenFDO

Authors Enrico Giunchiglia, Armando Tacchella

Publication date 1 July 2001

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

Full work available at URL https://doi.org/10.1007/10722086_20

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Recommendations

• A subset-matching size-bounded cache for testing satisfiability in modal logics
• Cache conscious data structures for Boolean satisfiability solvers
• scientific article; zbMATH DE number 2196594
• A new method for bounding the complexity of modal logics
• A framework for satisfiability modulo theories
• Computer Aided Verification
• Optimising propositional modal satisfiability for description logic subsumption
• An instantiation scheme for satisfiability modulo theories
• A Progressive Simplifier for Satisfiability Modulo Theories

Cited in

(4)

• EXPtime tableaux for ALC
• A subset-matching size-bounded cache for testing satisfiability in modal logics
• Optimizing terminological reasoning for expressive description logics
• Towards an efficient library for SAT: A manifesto

This page was built for publication: A subset-matching size-bounded cache for satisfiability in modal logics

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