| SPASS Version 1.0.3. URL: http://spass.mpi-sb.mpg.de/. Accessed Apr. 8, 2001. 21 |
.... for modal logics, one translates modal languages into a large background language (typically rst order logic) and devises strategies that guarantee termination for the fragment corresponding to the original modal language [22, 29, 17, 5] First order resolution provers like bliksem [12] or spass [38] handle modal formulas in this way, in some cases using extremely optimized translations like those investigated in [32, 37] This approach has both advantages and disadvantages with respect to the tableau approach. On the one hand we can translate many systems into the same background language ....
SPASS Version 1.0.3. URL: http://spass.mpi-sb.mpg.de/. Accessed Apr. 8, 2001. 21
.... for modal logics, one translates modal languages into a large background language (typically rst order logic) and devises strategies that guarantee termination for the fragment corresponding to the original modal language [22, 29, 17, 5] First order resolution provers like bliksem [12] or spass [38] handle modal formulas in this way, in some cases using extremely optimized translations like those investigated in [32, 37] This approach has both advantages and disadvantages with respect to the tableau approach. On the one hand we can translate many systems into the same background language ....
SPASS Version 1.0.3. URL: http://spass.mpi-sb.mpg.de/. Accessed Apr. 8, 2001. 21
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.