{"type":"ScholarlyArticle","title":"Outlier Detection Using Default Logic","authors":[{"name":"Fabrizio Angiulli","slug":"fabrizio-angiulli","given":"Fabrizio","family":"Angiulli","affiliation":"ICAR-CNR c/ o DEIS Univ. della Calabria 87030 Rende (CS) , Italy"},{"name":"Rachel Ben-Eliyahu-Zohary","slug":"rachel-ben-eliyahu-zohary","given":"Rachel","family":"Ben-Eliyahu-Zohary","affiliation":"Comm. Systems Engineering Dept."},{"name":"Luigi Palopoli","slug":"luigi-palopoli","given":"Luigi","family":"Palopoli","affiliation":"DIMET Ben-Gurion Univ. of the Negev Beer-Sheva 84105 , Israel; Univ. di Reggio Calabria Loc. Feo di Vito 89100 Reggio Calabria , Italy"}],"abstract":"Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in an unexpected way or feature abnormal properties. The ability to locate outliers can help to maintain knowledgebase integrity and to single out irregular individuals. We first formally define the notion of an outlier and an outlier witness. We then show that finding outliers is quite complex. Indeed, we show that several versions of the outlier detection problem lie over the second level of the polynomial hierarchy. For example, the question of establishing if at least one outlier can be detected in a given propositional default theory is I:f -complete. Although outlier detection involves heavy computation, the queries involved can frequently be executed offline, thus somewhat alleviating the difficulty of the problem. In addition, we show that outlier detection can be done in polynomial time for both the class of acyclic normal unary defaults and the class of acyclic dual normal unary defaults.","doi":null,"url":"https://ijcai.org/proceedings/2003/120","pdf":"https://ijcai.org/proceedings/2003/0120.pdf","markdown":"https://ijcai.org/proceedings/2003/120.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/120","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":120,"pages":{"first":833,"last":837},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Angiulli et al., 2003] Fabrizio Angiulli, Rachel Ben- Eliyahu-Zohary, and Luigi Palopoli. Outlier detection using default logic, 2003. Full manuscript. [Console et al., 1991] Luca Console, Daniele Theseider Dupre, and Pietro Torasso. On the relationship between abduction and deduction. Journal of Logic and Computa- tion, 1(5):661-690, 1991.","title":"On the relationship between abduction and deduction","authors":"Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Luigi Palopoli, ; Console","year":"1991","venue":"Journal of Logic and Computation","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Eiter and Gottlob, 1995] Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. JACM, 42( 1 ):3- 42, 1995.","title":"The complexity of logic-based abduction","authors":"Thomas Eiter, Georg Gottlob","year":"1995","venue":"JACM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Eiter et al., 1997] Thomas Eiter, Georg Gottlob, and Nicola Leone. Semantics and complexity of abduction from de- fault theories. Artificial Intelligence, 90( 1-2): 177-223, 1997.","title":"Semantics and complexity of abduction from default theories","authors":"Thomas Eiter, Georg Gottlob, Nicola Leone","year":"1997","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/1995/113"},{"position":4,"raw":"[Etherington, 1987] David W. Etherington. Formalizing nonmonotonic reasoning systems. Artificial Intelligence, 31:41-85, 1987.","title":"Formalizing nonmonotonic reasoning systems","authors":"David W Etherington","year":"1987","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Garey and Johnson, 1979] M. R. Garey and D. S. Johnson . Computers and intractability; a guide to the theory of NP- completeness. W.H. Freeman, 1979.","title":"Computers and intractability; a guide to the theory of NPcompleteness","authors":"M R Garey, D S Johnson","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Gel fond and Lifschitz, 1991] Michael Gelfond and Vladimir Lifschitz. Classical negation in logic pro- grams and disjunctive databases. New Generation Computing, 9:365-385, 1991.","title":"Classical negation in logic programs and disjunctive databases","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1991","venue":"New Generation Computing","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gottlob, 1992] George Gottlob. Complexity results for non- monotonic logics. J. Logic Computat., 2(3):397-425, 1992.","title":"Complexity results for nonmonotonic logics","authors":"George Gottlob","year":"1992","venue":"J. Logic Computat","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Kautz and Selman, 1991] Henry A. Kautz and Bart Selman. Hard problems for simple default logics. Artificial Intelli- gence, 49:243-279, 1991.","title":"Hard problems for simple default logics","authors":"Henry A Kautz, Bart Selman","year":"1991","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[McCarthy, 1980] John McCarthy. Circumscription -a form of non-monotonic reasoning. Artificial Intelligence, 13:27-39, 1980.","title":"Circumscription -a form of non-monotonic reasoning","authors":"John Mccarthy","year":"1980","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Pearl, 1990] Judea Pearl. System z: a natural ordering of defaults with tractable applications to nonmonotonic rea- soning. In TARK-90, pages 121-135, Monterey, CA, 1990.","title":"Judea Pearl. System z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning","authors":"Pearl","year":"1990","venue":"TARK-90","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Poole, 1989] David Poole. Normality and faults in logic- based diagnosis. In /JCAI-89, pages 1304-1310, 1989.","title":"Normality and faults in logicbased diagnosis","authors":"David Poole","year":"1989","venue":"JCAI-89","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Reiter, 1980] Raymond Reiter. A logic for default reason- ing. Artificial Intelligence, 13:81-132, 1980.","title":"A logic for default reasoning","authors":"Raymond Reiter","year":"1980","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Stillman, 1992] Jonathan Stillman. The complexity of propositional default logics. In Proceedings of the lOth National Conference on Artificial Intelligence, pages 794- 800, San Jose, CA, July 1992.","title":"The complexity of propositional default logics","authors":"Jonathan Stillman","year":"1992","venue":"Proceedings of the lOth National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Zhang and Marek, 1990] A. Zhang and W. Marek. On the classification and existence of structures in default logic. Fundament a lnformaticae, 13( 4 ):485-499, 1990.","title":"On the classification and existence of structures in default logic","authors":"A Zhang, W Marek","year":"1990","venue":"Fundament a lnformaticae","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Zohary, 2002] Rachel Ben-Eliyahu Zohary. Yet some more complexity results for default logic. Artificial Intelligence, 139(1):1-20, 2002.","title":"Yet some more complexity results for default logic","authors":"Rachel Ben, -Eliyahu Zohary","year":"2002","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}