Second-order quantifier elimination in modal contexts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2424, Issue , 2002, Pages 223-232

  Szalas, Andrzej ^a,b  

^a TWP   (Poland)

^b LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION;

APPROXIMATE REASONING; CLASSICAL LOGIC; COMMONSENSE REASONING; KNOWLEDGE DATABASE; MODAL OPERATORS; QUANTIFIER ELIMINATION; RELATIONAL DATABASE; SECOND ORDERS;

ARTIFICIAL INTELLIGENCE;

EID: 77952027460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (24)

1. M. Cadoli. Tractable Reasoning in Artificial Intelligence, volume 941 of LNAI. Springer-Verlag, Berlin Heidelberg, 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.
6. P. Doherty, W. Łukaszewicz, and A. Szałas. General domain circumscription and its effective reductions. Fundamenta Informaticae, 36(1):23-55, 1998.
7. P. Doherty, W. Łukaszewicz, and A. Szałas. Declarative PTIME queries for relational databases using quantifier elimination. Journal of Logic and Computation, 9(5):739-761, 1999.
8. P. Doherty, W. Łukaszewicz, and A. Szałas. Efficient reasoning using the local closed-world assumption. In A. Cerri and D. Dochev, editors, Proc. 9th Int. Conference AIMSA 2000, volume 1904 of LNAI, pages 49-58. Springer-Verlag, 2000.
9. P. Doherty, W. Łukaszewicz, and A. Szałas. Computing strongest necessary and weakest sufficient conditions of first-order formulas. International Joint Conference on AI (IJCAI'2001), pages 145-151, 2001.
10. D. M. Gabbay and H. J. Ohlbach. Quantifier elimination in second-order predicate logic. In B. Nebel, C. Rich, and W. Swartout, editors, Principles of Knowledge representation and reasoning, KR 92, pages 425-435. Morgan Kauffman, 1992.
11. J.W. Garson. Quantification in modal logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 249-307. D. Reidel Pub. Co., 1984.
12. J. Kachniarz and A. Szałas. On a static approach to verification of integrity constraints in relational databases. In E. Orłowska and A. Szałas, editors, Relational Methods for Computer Science Applications, pages 97-109. Springer Physica-Verlag, 2001.
13. H. Kautz and B. Selman. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224, 1996.
14. V. Lifschitz. Computing circumscription. In Proc. 9th IJCAI, pages 229-235, Palo Alto, CA, 1985. Morgan Kaufmann.
15. V. Lifschitz. Circumscription. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Artificial Intelligence and Logic Programming, volume 3, pages 297-352. Oxford University Press, 1991.
16. F. Lin. On strongest necessary and weakest sufficient conditions. In A.G. Cohn, F. Giunchiglia, and B. Selman, editors, Proc. 7th International Conf. on Principles of Knowledge Representation and Reasoning, KR2000, pages 167-175, San Francisco, Ca., 2000. Morgan Kaufmann Pub., Inc.
17. J. McCarthy. Approximate objects and approximate theories. In A.G. Cohn, F. Giunchiglia, and B. Selman, editors, Proc. 7th International Conf. on Principles of Knowledge Representation and Reasoning, KR2000, pages 519-526, San Francisco, Ca., 2000. Morgan Kaufmann Pub., Inc.
18. A. Nonnengart, H.J. Ohlbach, and A. Szałas. Elimination of predicate quantifiers. In H.J. Ohlbach and U. Reyle, editors, Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I, pages 159-181. Kluwer, 1999.
19. A. Nonnengart and A. Szałas. A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In E. Orłowska, editor, Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, volume 24 of Studies in Fuzziness and Soft Computing, pages 307-328. Springer Physica-Verlag, 1998.
20. H. Simmons. The monotonous elimination of predicate variables. Journal of Logic and Computation, 4:23-68, 1994. (special issue).
21. A. Szałas. On the correspondence between modal and classical logic: An automated approach. Journal of Logic and Computation, 3:605-620, 1993.
22. A. Szałas. On an automated translation of modal proof rules into formulas of the classical logic. Journal of Applied Non-Classical Logics, 4:119-127, 1994.
23. J. van Benthem. Modal Logic and Classical Logic. Bibliopolis, Naples, 1983.
24. J. van Benthem. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 167-247. D. Reidel Pub. Co., 1984.