Reconsideration of circumscriptive induction with pointwise circumscription

Clark, 1978, Negation as failure, 119 De Raedt, 2001, Three companions for data mining in first order logic, 105 L. De Raedt, A logical database mining query language, in: Proc. of Inductive Logic Programming (ILP2000), in: Lecture Notes in Artificial Intelligence, vol. 1866, 2000, pp. 78–92 Y. Dimopoulos, S. Dz̆eroski, A. Kakas, Integrating explanatory and descriptive learning in ILP, in: Proc. of International Joint Conference on Artificial Intelligence (IJCAI '97), 1997, pp. 900–907 P. Doherty, W. Łukaszewicz, A. Szałas, Computing circumscription revisited: Preliminary report, in: Proc. of International Joint Conference on Artificial Intelligence (IJCAI '95), 1995, pp. 1502–1507 Etherington, 1988 P.A. Flach, N. Lachiche, Cooking up integrity constraints with PRIMUS (preliminary report), Technical Report CSTR-97-009, Department of Computer Science, University of Bristol, December 1997 N. Heft, Induction as nonmonotonic inference, in: Proc. of Knowledge Representation and Reasoning (KR '89), 1989, pp. 149–156 Inoue, 1992, Linear resolution for consequence finding, Artificial Intelligence, 56, 301, 10.1016/0004-3702(92)90030-2 K. Inoue, H. Saito, Circumscription polices for induction, in: Proc. of the 14th International Conference on Inductive Logic Programming (ILP), in: Lecture Notes in Artificial Intelligence. vol. 3194, 2004, pp. 164–179 Inoue, 2004, Induction as consequence finding, Machine Learning, 55, 109, 10.1023/B:MACH.0000023149.72125.e2 K. Iwanuma, M. Harao, S. Noguchi, Reconsideration of pointwise circumscription, in: Proc. of International Conference on Information Technology Harmonizing with Society (InfoJapan'90) 1990, pp. 147–154 K. Iwanuma, Conservative query normalization on parallel circumscription, in: Proc. of 12th International Conference on Automated Deduction (CADE-12), in: Lecture Notes in Artificial Intelligence, vol. 814, 1994, pp. 296–310 Iwanuma, 1996, An extension of pointwise circumscription, Artificial Intelligence, 86, 291, 10.1016/S0004-3702(96)00028-8 Kolaitis, 1990, Some computational aspects of circumscription, Journal of the ACM, 37, 1, 10.1145/78935.78936 Lachiche, 2000, Abduction and induction form a non-monotonic reasoning perspective V. Lifschitz, Computing circumscription, in: Proc. of the 9th International Joint Conference on Artificial Intelligence, 1985, pp. 122–127 V. Lifschitz, Pointwise circumscription: preliminary report, in: Proc. of National Conference on Artificial Intelligence (AAAI-86), 1986, pp. 406–410 Lifschitz, 1988, Pointwise circumscription, 179 Lifschitz, 1994, Circumscription, vol. 3, 298 McCarthy, 1986, Applications of circumscription to formalizing common-sense knowledge, Artificial Intelligence, 28, 89, 10.1016/0004-3702(86)90032-9 Y. Moinard, R. Rolland, Circumscription and definability, in: Proc, of International Joint Conference on Artificial Intelligence (IJCAI '91), 1991, pp. 432–437 Muggleton, 1995, Inverse entailment and Progol, New Generation Computing, 13, 245, 10.1007/BF03037227 O. Ray, K. Inoue, Mode-directed inverse entailment for full clausal theories, in: Inductive Logic Programming: Revised and Selected Papers from the 17th International Conference (ILP 2007), in: Lecture Notes in Artificial Intelligence, vol. 4894, 2008, pp. 225–238 Ray, 2004, A hybrid abductive inductive proof procedure, Logic Journal of the IGPL, 12, 371, 10.1093/jigpal/12.5.371 H.J. Ohlbach, SCAN—elimination of predicate quantifies, in: Proc. of the 13th International Conference on Automated Deduction (CADE'1996), in: Lecture Notes in Artificial Intelligence, vol. 1104, 1996, pp. 161–165 Przymusinski, 1989, An algorithm to compute circumscription, Artificial Intelligence, 38, 49, 10.1016/0004-3702(89)90067-2