{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:28:19Z","timestamp":1747805299585},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"4-6","license":[{"start":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T00:00:00Z","timestamp":1278633600000},"content-version":"unspecified","delay-in-days":8,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Plagiarism detection is a growing need among educational institutions and solutions for different purposes exist. An important field in this direction is detecting cases of <jats:italic>source-code plagiarism<\/jats:italic>. In this paper, we present the tool <jats:monospace>Kato<\/jats:monospace> for supporting the detection of this kind of plagiarism in the area of answer-set programming (ASP). Currently, the tool is implemented for <jats:monospace>DLV<\/jats:monospace> programs but it is designed to handle other logic-programming dialects as well. We review the basic features of <jats:monospace>Kato<\/jats:monospace>, introduce its theoretical underpinnings, and discuss an application of <jats:monospace>Kato<\/jats:monospace> for plagiarism detection in the context of courses on logic programming at the Vienna University of Technology.<\/jats:p>","DOI":"10.1017\/s1471068410000402","type":"journal-article","created":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T08:44:40Z","timestamp":1278665080000},"page":"759-775","source":"Crossref","is-referenced-by-count":8,"title":["The system Kato: Detecting cases of plagiarism for answer-set programs"],"prefix":"10.1017","volume":"10","author":[{"given":"JOHANNES","family":"OETSCH","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00d6RG","family":"P\u00dcHRER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARTIN","family":"SCHWENGERER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HANS","family":"TOMPITS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2010,7,9]]},"reference":[{"key":"S1471068410000402_ref22","first-page":"130","volume-title":"Proceedings of the Twenty-Seventh SIGCSE Technical Symposium on Computer Science Education (SIGCSE 1996)","author":"Verco","year":"1996"},{"key":"S1471068410000402_ref21","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/39.9.741"},{"key":"S1471068410000402_ref20","unstructured":"Serebrenik A. and Vanhoof W. 2007. Fingerprinting logic programs. CoRR abs\/cs\/0701081."},{"key":"S1471068410000402_ref19","volume-title":"JPlag: Finding Plagiarisms Among a Set of Programs","author":"Prechelt","year":"2000"},{"key":"S1471068410000402_ref17","volume-title":"Enhancing Computer-Aided Plagiarism Detection","author":"Mozgovoy","year":"2008"},{"key":"S1471068410000402_ref14","unstructured":"Luk\u00e1csy G. and Szeredi P. 2005. A generic framework for plagiarism detection in programs. In Proceedings of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications. 189\u2013198."},{"key":"S1471068410000402_ref13","unstructured":"Loose F. , Becker S. , Potthast M. and Stein B. 2008. Retrieval-Technologien f\u00fcr die Plagiaterkennung in Programmen. Tech. rep., University of W\u00fcrzburg, Germany."},{"key":"S1471068410000402_ref12","doi-asserted-by":"publisher","DOI":"10.11120\/ital.2005.04020006"},{"key":"S1471068410000402_ref11","first-page":"253","article-title":"Metrics based plagiarism monitoring.","volume":"16","author":"Jones","year":"2001","journal-title":"Journal of Computing Sciences in Colleges"},{"key":"S1471068410000402_ref10","volume-title":"Elements of Software Science","author":"Halstead","year":"1977"},{"key":"S1471068410000402_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068410000402_ref7","volume-title":"Analyzing for Authorship: A Guide to the Cusum Technique","author":"Farringdon","year":"1996"},{"key":"S1471068410000402_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_75"},{"key":"S1471068410000402_ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"S1471068410000402_ref1","first-page":"277","volume-title":"Proceedings of the Twenty-Ninth Australasian Computer Science Conference (ACSC 2006)","author":"Arwin","year":"2006"},{"key":"S1471068410000402_ref18","doi-asserted-by":"publisher","DOI":"10.1145\/382222.382462"},{"key":"S1471068410000402_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00367-3"},{"key":"S1471068410000402_ref4","unstructured":"Clough P. 2000. Plagiarism in Natural and Programming Languages: An Overview of Current Tools and Technologies. Technical Report CS-00-05, Department of Computer Science, University of Sheffield, UK."},{"key":"S1471068410000402_ref16","first-page":"1050","article-title":"Plagiarism: A survey.","volume":"12","author":"Maurer","year":"2006","journal-title":"Journal of Universal Computer Science"},{"key":"S1471068410000402_ref23","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/33.2.140"},{"key":"S1471068410000402_ref15","doi-asserted-by":"publisher","DOI":"10.14232\/actacyb.19.1.2009.13"},{"key":"S1471068410000402_ref24","unstructured":"Wise M. J. 1993. Running Karp-Rabin Matching and Greedy String Tiling. Technical report, Basser Department of Computer Science, University of Sydney, Australia."},{"key":"S1471068410000402_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S1096-7516(99)00004-4"},{"key":"S1471068410000402_ref9","doi-asserted-by":"publisher","DOI":"10.1145\/299649.299783"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068410000402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:32:46Z","timestamp":1556465566000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068410000402\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":24,"journal-issue":{"issue":"4-6","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["S1471068410000402"],"URL":"https:\/\/doi.org\/10.1017\/s1471068410000402","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}