The SAT-Based Approach for Classical Modal Logics-Reference-Cited by-同舟云学术

The SAT-Based Approach for Classical Modal Logics

Published:2000 Issue: Volume: Page:95-106
ISSN:0302-9743
Container-title:AI*IA 99: Advances in Artificial Intelligence
language:
Short-container-title:

Author:

Giunchiglia Enrico,Giunchiglia Fausto,Tacchella Armando

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46238-4_9

Reference21 articles.

1. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchella. More evaluation of decision procedures for modal logics. In Proc. KR’98, Trento, Italy, June 1998.

2. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures-the case study of modal K. In Proc. CADE-96, LNAI. Springer Verlag.

3. F. Giunchiglia and R. Sebastiani. A SAT-based decision procedure for ALC. In Proc. of KR’96, Cambridge, MA, USA, November 1996.

4. H. Zhang. SATO: An efficient propositional prover. In William McCune, editor, Proc. CADE-14, volume 1249 of LNAI, pages 272–275, 1997. Springer.

5. E. Giunchiglia, F. Giunchiglia, and A. Tacchella. *SAT, KSATC, DLP and TA: a comparative analysis. In Collected Papers from the International Description Logics Workshop (DL’99). CEUR, July 1999.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SAT-Based Decision Procedures for Automated Reasoning: A Unifying Perspective;Lecture Notes in Computer Science;2005

2. ERA: An Algorithm for Reducing the Epistasis of SAT Problems;Genetic and Evolutionary Computation — GECCO 2003;2003

3. A New System and Methodology for Generating Random Modal Formulae;Automated Reasoning;2001

4. Evaluating *SAT on TANCS 2000 Benchmarks;Lecture Notes in Computer Science;2000

5. A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics;Lecture Notes in Computer Science;2000