NDLI: Outlier detection by logic programming

Content Provider	ACM Digital Library
Author	Greco, Gianluigi Angiulli, Fabrizio Palopoli, Luigi
Copyright Year	2007
Abstract	The development of effective knowledge discovery techniques has become a very active research area in recent years due to the important impact it has had in several relevant application domains. One interesting task therein is that of singling out anomalous individuals from a given population, for example, to detect rare events in time-series analysis settings, or to identify objects whose behavior is deviant w.r.t. a codified standard set of rules. Such exceptional individuals are usually referred to as outliers in the literature. In this article, the concept of outlier is formally stated in the context of knowledge-based systems, by generalizing that originally proposed in Angiulli et al. [2003] in the context of default theories. The chosen formal framework here is that of logic programming, wherein potential applications of techniques for outlier detection are thoroughly discussed. The proposed formalization is a novel one and helps to shed light on the nature of outliers occurring in logic bases. Also the exploitation of minimality criteria in outlier detection is illustrated. The computational complexity of outlier detection problems arising in this novel setting is also thoroughly investigated and accounted for in the paper. Finally, rewriting algorithms are proposed that transform any outlier detection problem into an equivalent inference problem under stable model semantics, thereby making outlier computation effective and realizable on top of any stable model solver.
File Format	PDF
ISSN	15293785
e-ISSN	1557945X
DOI	10.1145/1297658.1297665
Volume Number	9
Issue Number	1
Journal	ACM Transactions on Computational Logic (TOCL)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-12-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Outlier detection Computational complexity Logic programming Nonmonotonic reasoning
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Logic Computational Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The Complexity of Reasoning for Fragments of Autoepistemic Logic

FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols

Proof-complexity results for nonmonotonic reasoning

Reasoning about evolving nonmonotonic knowledge bases

Dynamic Reasoning Systems

Analytic tableaux calculi for KLM logics of nonmonotonic reasoning

The DLV system for knowledge representation and reasoning

Complexity of propositional nested circumscription and nested abnormality theories

Preferred First-Order Answer Set Programs

Outlier detection by logic programming

Similar Documents

The Complexity of Reasoning for Fragments of Autoepistemic Logic

FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols

Proof-complexity results for nonmonotonic reasoning

Reasoning about evolving nonmonotonic knowledge bases

Dynamic Reasoning Systems

Analytic tableaux calculi for KLM logics of nonmonotonic reasoning

The DLV system for knowledge representation and reasoning

Complexity of propositional nested circumscription and nested abnormality theories

Preferred First-Order Answer Set Programs

Outlier detection by logic programming