Stevenson, LBritz, AAHome, T2009-01-072009-01-072008-12Stevenson, L, Britz, AA and Home T. 2008. KT and S4 satisfiability in a constraint logic environment. Lecture Notes in Computer Science, vol. 5351, pp 370-3810302-9743http://www.springerlink.com/content/t718x882070w/?p=147e8ec915b443a5804d19f04b3a981f&pi=25http://hdl.handle.net/10204/2768Copyright: Springer-verlagThe modal satisfiability problem is solved either by using a specifically designed algorith, or by translating the modal logic formula into an instance of a different class of problem, or, more recently, a constraint satisfaction problem. In the latter approach, the modal formula is translated into layered propositional formulae. Each layer is translated into a constraint satisfaction problem which is solved using a constraint solver. The researchers extend this approach to the modal logics KT and S4 and introduce a range of optimizatins of the basic prototype. The results compare favorably with those of other solvers, and support the adoption of constraint programming as implementation platform for modal and other related satisfiability solvers.enConstraint satisfaction problemConstraint logic environmentLayered propositional formulaeConstraint solverArticleStevenson, L., Britz, A., & Home, T. (2008). KT an S4 satisfiability in a constraint logic environment. http://hdl.handle.net/10204/2768Stevenson, L, AA Britz, and T Home "KT an S4 satisfiability in a constraint logic environment." (2008) http://hdl.handle.net/10204/2768Stevenson L, Britz A, Home T. KT an S4 satisfiability in a constraint logic environment. 2008; http://hdl.handle.net/10204/2768.TY - Article AU - Stevenson, L AU - Britz, AA AU - Home, T AB - The modal satisfiability problem is solved either by using a specifically designed algorith, or by translating the modal logic formula into an instance of a different class of problem, or, more recently, a constraint satisfaction problem. In the latter approach, the modal formula is translated into layered propositional formulae. Each layer is translated into a constraint satisfaction problem which is solved using a constraint solver. The researchers extend this approach to the modal logics KT and S4 and introduce a range of optimizatins of the basic prototype. The results compare favorably with those of other solvers, and support the adoption of constraint programming as implementation platform for modal and other related satisfiability solvers. DA - 2008-12 DB - ResearchSpace DP - CSIR KW - Constraint satisfaction problem KW - Constraint logic environment KW - Layered propositional formulae KW - Constraint solver LK - https://researchspace.csir.co.za PY - 2008 SM - 0302-9743 T1 - KT an S4 satisfiability in a constraint logic environment TI - KT an S4 satisfiability in a constraint logic environment UR - http://hdl.handle.net/10204/2768 ER -