{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:59Z","timestamp":1750306979358,"version":"3.41.0"},"reference-count":10,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Inroads"],"published-print":{"date-parts":[[2013,6]]},"abstract":"<jats:p>This article describes the experience obtained from teaching computational logic in an introductory course for undergraduates. The proposed teaching approach helps students to reach a deeper level of understanding in first order logic representation, computational logic procedures and automated theorem proving. The article includes the description of SLI, a theorem prover with a graphical output, a feature appreciated by students.<\/jats:p>","DOI":"10.1145\/2465085.2465101","type":"journal-article","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T12:33:56Z","timestamp":1369139636000},"page":"53-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["SLI"],"prefix":"10.1145","volume":"4","author":[{"given":"Jos\u00e9 A.","family":"Maestro-Prieto","sequence":"first","affiliation":[{"name":"Universidad de Valladolid"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Ar\u00e1nzazu","family":"Simon-Hurtado","sequence":"additional","affiliation":[{"name":"Universidad de Valladolid"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9070-5"},{"key":"e_1_2_1_2_1","unstructured":"Association for Computing Machinery Computer Science Curriculum 2008: An Interim Revision of the CS 2001 2008. http:\/\/www.acm.org\/\/education\/curricula\/ComputerScience2008.pdf. Accessed 2013 April 1.  Association for Computing Machinery Computer Science Curriculum 2008: An Interim Revision of the CS 2001 2008. http:\/\/www.acm.org\/\/education\/curricula\/ComputerScience2008.pdf. Accessed 2013 April 1."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Clark R.C. and Mayer R.E. e-Learning and the Science of Instruction: Proven Guidelines for Consumers and Designers of Multimedia Learning 3rd edition (San Francisco: Pfeiffer 2011).  Clark R.C. and Mayer R.E. e-Learning and the Science of Instruction: Proven Guidelines for Consumers and Designers of Multimedia Learning 3rd edition (San Francisco: Pfeiffer 2011).","DOI":"10.1002\/9781118255971"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116447"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1207\/S15326985EP3801_6"},{"key":"e_1_2_1_6_1","unstructured":"McCune W. Prover9 and Mace4 http:\/\/www.cs.unm.edu\/~mccune\/prover9\/. Accessed 2013 April 1.  McCune W. Prover9 and Mace4 http:\/\/www.cs.unm.edu\/~mccune\/prover9\/. Accessed 2013 April 1."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869746.1869761"},{"volume-title":"Massachusetts: Morgan Kaufmann Publishers","year":"1998","author":"Nilsson N.J.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","unstructured":"SLI\n\n  \n  : Inference Logic System. http:\/\/www.infor.uva.es\/~arancha\/SLI.html. Accessed 2013 April 11.  SLI: Inference Logic System. http:\/\/www.infor.uva.es\/~arancha\/SLI.html. Accessed 2013 April 11."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/01690969508407099"}],"container-title":["ACM Inroads"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465085.2465101","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465085.2465101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:36Z","timestamp":1750235976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465085.2465101"}},"subtitle":["a tool for easing the understanding of automated proof construction"],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["10.1145\/2465085.2465101"],"URL":"https:\/\/doi.org\/10.1145\/2465085.2465101","relation":{},"ISSN":["2153-2184","2153-2192"],"issn-type":[{"type":"print","value":"2153-2184"},{"type":"electronic","value":"2153-2192"}],"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}