{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:39:59Z","timestamp":1725493199396},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441908"},{"type":"electronic","value":"9783540457572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45757-7_19","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T13:50:39Z","timestamp":1192888239000},"page":"223-232","source":"Crossref","is-referenced-by-count":2,"title":["Second-Order Quantifier Elimination in Modal Contexts"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Szalas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"19_CR1","series-title":"LNAI","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60058-2","volume-title":"Tractable Reasoning in Artificial Intelligence","author":"M. Cadoli","year":"1995","unstructured":"M. Cadoli. Tractable Reasoning in Artificial Intelligence, volume 941 of LNAI. Springer-Verlag, Berlin Heidelberg, 1995."},{"issue":"1","key":"19_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.3233\/FI-1999-40102","volume":"40","author":"P. Doherty","year":"1999","unstructured":"P. Doherty, J. Kachniarz, and A. Sza\u0142as. Meta-queries on deductive databases. Fundamenta Informaticae, 40(1):17\u201330, 1999.","journal-title":"Fundamenta Informaticae"},{"key":"19_CR3","unstructured":"P. Doherty, J. Kachniarz, and A. Sza\u0142as. 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\u2013248. Springer-Verlag, 2002."},{"key":"19_CR4","unstructured":"P. Doherty, W. \u0141ukaszewicz, A. Skowron, and A. Sza\u0142as. 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\u2013216. Springer-Verlag, 2002."},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1005722130532","volume":"18","author":"P. Doherty","year":"1997","unstructured":"P. Doherty, W. \u0141ukaszewicz, and A. Sza\u0142as. Computing circumscription revisited. Journal of Automated Reasoning, 18(3):297\u2013336, 1997.","journal-title":"Journal of Automated Reasoning"},{"issue":"1","key":"19_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.3233\/FI-1998-3612","volume":"36","author":"P. Doherty","year":"1998","unstructured":"P. Doherty, W. \u0141ukaszewicz, and A. Sza\u0142as. General domain circumscription and its effective reductions. Fundamenta Informaticae, 36(1):23\u201355, 1998.","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1093\/logcom\/9.5.737","volume":"9","author":"P. Doherty","year":"1999","unstructured":"P. Doherty, W. \u0141ukaszewicz, and A. Sza\u0142as. Declarative PTIME queries for relational databases using quantifier elimination. Journal of Logic and Computation, 9(5):739\u2013761, 1999.","journal-title":"Journal of Logic and Computation"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"P. Doherty, W. \u0141ukaszewicz, and A. Sza\u0142as. 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\u201358. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-45331-8_5"},{"key":"19_CR9","unstructured":"P. Doherty, W. \u0141ukaszewicz, and A. Sza\u0142as. Computing strongest necessary and weakest suficient conditions of first-order formulas. International Joint Conference on AI (IJCAI\u20192001), pages 145\u2013151, 2001."},{"key":"19_CR10","unstructured":"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\u2013435. Morgan Kauffman, 1992."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"J.W. Garson. Quantification in modal logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 249\u2013307. D. Reidel Pub. Co., 1984.","DOI":"10.1007\/978-94-009-6259-0_5"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"J. Kachniarz and A. Sza\u0142as. On a static approach to verification of integrity constraints in relational databases. In E. Or\u0142owska and A. Sza\u0142as, editors, Relational Methods for Computer Science Applications, pages 97\u2013109. Springer Physica-Verlag, 2001.","DOI":"10.1007\/978-3-7908-1828-4_6"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/226643.226644","volume":"43","author":"H. Kautz","year":"1996","unstructured":"H. Kautz and B. Selman. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193\u2013224, 1996.","journal-title":"Journal of the ACM"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"V. Lifschitz. Computing circumscription. In Proc. 9th IJCAI, pages 229\u2013235, Palo Alto, CA, 1985. Morgan Kaufmann.","DOI":"10.1016\/0004-3702(85)90055-4"},{"key":"19_CR15","unstructured":"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\u2013352. Oxford University Press, 1991."},{"key":"19_CR16","unstructured":"F. Lin. On strongest necessary and weakest suficient 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\u2013175, San Francisco, Ca., 2000. Morgan Kaufmann Pub., Inc."},{"key":"19_CR17","unstructured":"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\u2013526, San Francisco, Ca., 2000. Morgan Kaufmann Pub., Inc."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"A. Nonnengart, H.J. Ohlbach, and A. Sza\u0142as. 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\u2013181. Kluwer, 1999.","DOI":"10.1007\/978-94-011-4574-9_9"},{"key":"19_CR19","unstructured":"A. Nonnengart and A. Sza\u0142as. A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In E. Or\u0142owska, editor, Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, volume 24 of Studies in Fuzziness and Soft Computing, pages 307\u2013328. Springer Physica-Verlag, 1998."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/logcom\/4.1.23","volume":"4","author":"H. Simmons","year":"1994","unstructured":"H. Simmons. The monotonous elimination of predicate variables. Journal of Logic and Computation, 4:23\u201368, 1994. (special issue).","journal-title":"Journal of Logic and Computation"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1093\/logcom\/3.6.605","volume":"3","author":"A. Sza\u0142as","year":"1993","unstructured":"A. Sza\u0142as. On the correspondence between modal and classical logic: An automated approach. Journal of Logic and Computation, 3:605\u2013620, 1993.","journal-title":"Journal of Logic and Computation"},{"key":"19_CR22","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1080\/11663081.1994.10510828","volume":"4","author":"A. Sza\u0142as","year":"1994","unstructured":"A. Sza\u0142as. On an automated translation of modal proof rules into formulas of the classical logic. Journal of Applied Non-Classical Logics, 4:119\u2013127, 1994.","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"19_CR23","unstructured":"J. van Benthem. Modal Logic and Classical Logic. Bibliopolis, Naples, 1983."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"J. van Benthem. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 167\u2013247. D. Reidel Pub. Co., 1984.","DOI":"10.1007\/978-94-009-6259-0_4"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45757-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T04:44:41Z","timestamp":1587962681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45757-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441908","9783540457572"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45757-7_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}