{"type":"ScholarlyArticle","title":"Computing Circumscription Revisited: Preliminary Report","authors":[{"name":"Patrick Doherty","slug":"patrick-doherty","given":"Patrick","family":"Doherty","affiliation":"Dept. of Computer Science Linkoping University S-581 83 Linkoping , Sweden"},{"name":"Witold Lukaszewicz","slug":"witold-lukaszewicz","given":"Witold","family":"Lukaszewicz","affiliation":"t Institute of Informatics Warsaw University 00-913 Warsaw 59 , Poland"},{"name":"Andrzej Szalas","slug":"andrzej-szalas","given":"Andrzej","family":"Szalas","affiliation":"t Institute of Informatics Warsaw University 00-913 Warsaw 59 , Poland"}],"abstract":"We provide a general method which can be used in an algorithmic manner to reduce certain classes of 2nd-order circumscription axioms to logically equivalent 1st-order formulas. The algorithm takes as input an arbitrary 2nd-or~er formula and either returns as output an eqmvalent 1st-order formula, or terminates with failure. In addition to demonstrating the algorithm by applying it to various circumscriptive theories, we analyze its strength and provi~e formal subsumption results based on comparison with existing approaches.","doi":null,"url":"https://ijcai.org/proceedings/1995/194","pdf":"https://ijcai.org/proceedings/1995/0194.pdf","markdown":"https://ijcai.org/proceedings/1995/194.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/194","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Non-monotonic Reasoning","track":"Non-monotonic Reasoning","number":194,"pages":{"first":1502,"last":1507},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Ackermann, 1935] W. Ackermann. Untersuchungen iiber das eliminationsproblem der mathematischen logik. Mathematische Annalen, 110:39o-413, 1935.","title":"Untersuchungen iiber das eliminationsproblem der mathematischen logik","authors":"W Ackermann","year":"1935","venue":"Mathematische Annalen","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ackermann, 1954] W. Ackermann. Solvable Cases of the Decision Problem. North-Holland, Amsterdam, 1954.","title":"Solvable Cases of the Decision Problem","authors":"W Ackermann","year":"1954","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Benthem, 1983] J. Van Benthem. Modal Logic and Classical Logic. Bibliopolis, Napoli, 1983.","title":"Modal Logic and Classical Logic","authors":"J Van Benthem","year":"1983","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Benthem, 1984] J. Van Benthem. Correspondence the- ory. In D. Gabbay and F. Guenthner, editors, Hand- book of Philosophical Logic, volume 2, pages 167-247.","title":"Correspondence theory","authors":"J Van Benthem","year":null,"venue":"Handbook of Philosophical Logic","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"D. Reidel Pub. Co., 1984.","title":null,"authors":"D Reidel Pub, Co","year":"1984","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Doherty et al., 1994] P. Doherty, W. Luk.aszewicz, and A. Szalas. Computing circumscription revisited: A reduction algorithm. Technical Report LiTH- IDA-R-94-42, Linkoping University, 1994. URL: http:/ fwww.ida.liu.seflabs/rkllabfpeoplefpatdo/.","title":"Computing circumscription revisited: A reduction algorithm","authors":"P Doherty, W Luk, A Szalas","year":"1994","venue":null,"doi":null,"url":"http:/fwww.ida.liu.seflabs/rkllabfpeoplefpatdo/","internal_url":null},{"position":7,"raw":"[Gabbay and Ohlbach, 1992] D. Gabbay and H. J. Ohlbach. Quantifier elimination in second-order pred- icate logic. Technical Report MPI-I-92-231, Max- Planck Institut fiir Informatik, 1992.","title":"Quantifier elimination in second-order predicate logic","authors":"D Gabbay, H J Ohlbach","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gelfond and Lifschitz, 1989] M. Gelfond and V. Lifs- chitz. Compiling circumscriptive theories into logic programs. In Proc. 2nd Int'l Workshop on Non- Monotonic Reasoning, volume 346 of Lecture Notes in Artificial Intelligence, pages 74-99, 1989.","title":"Compiling circumscriptive theories into logic programs","authors":"M Gelfond, V Lifschitz","year":"1989","venue":"Proc. 2nd Int'l Workshop on Non-Monotonic Reasoning","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Ginsberg, 1989] M. L. Ginsberg. A circumscriptive the- orem prover. Artificial Intelligence, 39:209-230, 1989.","title":"A circumscriptive theorem prover","authors":"M L Ginsberg","year":"1989","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Kolaitis and Papadimitriou, 1988] P. Kolaitis and C. Papadimitriou. Some computational aspects of circumscription. In Proc. AAAI-88, St. Paul, MN, pages 465-469, 1988.","title":"Some computational aspects of circumscription","authors":"P Kolaitis, C Papadimitriou","year":"1988","venue":"Proc. AAAI-88","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lifschitz, 1985] V. Lifschitz. Computing circumscrip- tion. In Proc. 9th IJCAI, Los Angeles, CA , pages 121-127, 1985.","title":"Computing circumscription","authors":"V Lifschitz","year":"1985","venue":"Proc. 9th IJCAI","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Lifschitz, 1988] V. Lifschitz. Pointwise circumscription. In M. Ginsberg, editor, Readings in Non-Monotonic Reasoning, pages 179-193.","title":"Pointwise circumscription","authors":"V Lifschitz","year":null,"venue":"Readings in Non-Monotonic Reasoning","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Lifschitz, 1994] V. Lifschitz. Circumscription. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 3, pages 297-352. Clarendon Press, Oxford, 1994.","title":"Circumscription","authors":"V Lifschitz","year":"1994","venue":"Handbook of Logic in Artificial Intelligence and Logic Programming","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Przymusinski, 1991] T . Przymusinski. An algorithm to compute circumscription. Artificial Intelligence, 38:49-73, 1991.","title":"An algorithm to compute circumscription","authors":"T Przymusinski","year":"1991","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Rabinov, 1989] A. Rabinov. A generalization of col- lapsible cases of circumscription. Artificial Intelli- gence, 38:111-117, 1989.","title":"A generalization of collapsible cases of circumscription","authors":"A Rabinov","year":"1989","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Szalas, 1993] A. Szalas. On the correspondence between modal and classical logic: an automated approach. Journal of Logic and Computation, pages 605-620, 1993.","title":"On the correspondence between modal and classical logic: an automated approach","authors":"A Szalas","year":"1993","venue":"Journal of Logic and Computation","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}