Second-Order Quantifier Elimination in Modal Contexts-Reference-Cited by-同舟云学术

Second-Order Quantifier Elimination in Modal Contexts

Published:2002 Issue: Volume: Page:223-232
ISSN:0302-9743
Container-title:Logics in Artificial Intelligence
language:
Short-container-title:

Author:

Szalas Andrzej

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45757-7_19

Reference24 articles.

1. LNAI;M. Cadoli,1995

2. P. Doherty, J. Kachniarz, and A. Szałas. Meta-queries on deductive databases. Fundamenta Informaticae, 40(1):17–30, 1999.

3. P. Doherty, J. Kachniarz, and A. Szałas. Using contextually closed queries for local closed-world reasoning in rough knowledge databases. In L. Polkowski and A. Skowron, editors, Rough-Neuro Computing: Techniques for Computing with Words, pages 217–248. Springer-Verlag, 2002.

4. P. Doherty, W. Łukaszewicz, A. Skowron, and A. Szałas. Combining rough and crisp knowledge in deductive databases. In L. Polkowski and A. Skowron, editors, Rough-Neuro Computing: Techniques for Computing with Words, pages 185–216. Springer-Verlag, 2002.

5. P. Doherty, W. Łukaszewicz, and A. Szałas. Computing circumscription revisited. Journal of Automated Reasoning, 18(3):297–336, 1997.

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

1. Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions;FUND INFORM;2009

2. Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA;Journal of Logic and Computation;2006-10-01

3. Elementary canonical formulae: extending Sahlqvist’s theorem;Annals of Pure and Applied Logic;2006-08

4. Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA;Logical Methods in Computer Science;2006-03-07

5. Quantifier Elimination in Elementary Set Theory;Relational Methods in Computer Science;2006