System description: ∗sat a platform for the development of modal decision procedures

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1831, Issue , 2000, Pages 291-296

  Giunchiglia, Enrico ^a   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER SOFTWARE REUSABILITY; FORMAL LOGIC;

AUTOMATED DEDUCTION; CLASSICAL MODAL LOGIC; DECISION PROCEDURE; EFFICIENT IMPLEMENTATION; MODULAR DESIGNS; SOFTWARE COMPONENT; STATE OF THE ART; SYSTEM DESCRIPTION;

THEOREM PROVING;

EID: 84861144270     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10721959_22     Document Type: Conference Paper

References (10)

1. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal log-ics from propositional decision procedures -The case study of modal K. In Proc. CADE-96, LNAI, 1996.
2. E. Giunchiglia, F. Giunchiglia, and A. Tacchella. SAT-Based Decision Procedures for Classical Modal Logics. To appear in Journal of Automated Reasoning.
3. H. Zhang. SATO: An eficient propositional prover. In Proc. CADE-97, volume 1249 of LNAI, 1997.
4. E. Giunchiglia and A. Tacchella. Subset-matching Size-bounded Caching for Sat-isábility in Modal Logics, 2000. Submitted.
5. VIS-group. VIS: A system for verification and synthesis. In Proc. CAV-96, LNAI, 1996.
6. M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5 (7), 1962.
7. D.A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation. Journal of Symbolic Computation, 2: 293-304, 1986.
8. I. Horrocks. Optimizing Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester, 1997.
9. B. F. Chellas. Modal Logic -An Introduction. Cambridge University Press, 1980.
10. U. Hustadt and R.A. Schmidt. On evaluating decision procedures for modal logic. In Proc. IJCAI-97, 1997.