{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:33:39Z","timestamp":1767339219563,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031742088"},{"type":"electronic","value":"9783031742095"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74209-5_10","type":"book-chapter","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T06:01:44Z","timestamp":1728626504000},"page":"126-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-paradigm Logic Programming in\u00a0the\u00a0$$\\mathcal{E}$$rgoAI System"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6446-0650","authenticated-orcid":false,"given":"Theresa","family":"Swift","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3177-5792","authenticated-orcid":false,"given":"Michael","family":"Kifer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"key":"10_CR1","unstructured":"Alferes, J., Dam\u00e1sio, C.V., Pereira, L.M.: A top-down query evaluation for well-founded semantics with explicit negation. In: ECAI, pp. 140\u2013144 (1994)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(89)90126-6","volume":"68","author":"H Blair","year":"1989","unstructured":"Blair, H., Subrahmanian, V.S.: Paraconsistent logic programming. Theor. Comput. Sci. 68, 135\u2013154 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR3","unstructured":"Bloomfield, R.: Assuring transformative technologies: assurance 2.0 and clarisssa tool chain. In: High Confidence Software and Systems Conference (2024)"},{"key":"10_CR4","unstructured":"Bloomfield, R., Netkachova, K., Rushby, J.: Defeaters and eliminative argumentation in assurance 2.0 (2024). arXiv:2405.15800"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(94)90190-2","volume":"133","author":"A Bonner","year":"1994","unstructured":"Bonner, A., Kifer, M.: An overview of transaction logic. Theor. Comput. Sci. 133, 205\u2013265 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Brewka, G., Eiter, T.: Prioritizing default logic. In: Intellectics and Computational Logic \u2013 Papers in Honour of Wolfgang Bibel, pp. 27\u201345. Kluwer (2000)","DOI":"10.1007\/978-94-015-9383-0_3"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Cer, D., et al.: Universal sentence encoder for English. In: EMNLP, pp. 169\u2013174 (2018)","DOI":"10.18653\/v1\/D18-2029"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0743-1066(93)90039-J","volume":"15","author":"W Chen","year":"1993","unstructured":"Chen, W., Kifer, M., Warren, D.S.: HiLog: a foundation for higher-order logic programming. JLP 15(3), 187\u2013230 (1993)","journal-title":"JLP"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1017\/S1471068402001539","volume":"2","author":"J Delgrande","year":"2003","unstructured":"Delgrande, J., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory Pract. Log. Program. 2, 129\u2013187 (2003)","journal-title":"Theory Pract. Log. Program."},{"issue":"1\u20132","key":"10_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0004-3702(01)00134-5","volume":"133","author":"P Dung","year":"2001","unstructured":"Dung, P., Son, T.: An argument-based approach to reasoning with specificity. Artif. Intell. 133(1\u20132), 35\u201385 (2001)","journal-title":"Artif. Intell."},{"issue":"4","key":"10_CR11","first-page":"463","volume":"3","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred answer sets by meta-interpretation in answer set programming. TPLP 3(4), 463\u2013498 (2003)","journal-title":"TPLP"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BFb0054795","volume-title":"Logic Programming and Knowledge Representation","author":"M Gelfond","year":"1997","unstructured":"Gelfond, M., Son, T.: Reasoning with prioritized defaults. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds.) LPKR 1997. LNCS, vol. 1471, pp. 164\u2013223. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0054795"},{"key":"10_CR13","unstructured":"Grosof, B.: Prioritized conflict handling for logic programs. In: International Logic Programming Symposium, pp. 197\u2013211 (1997)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-031-35254-6_18","volume-title":"Prolog - The Next 50 Years","author":"B Grosof","year":"2023","unstructured":"Grosof, B., Kifer, M., Swift, T., Fodor, P., Bloomfield, J.: Ergo: a quest for declarativity in logic programming. In: Warren, D.S., Dahl, V., Eiter, T., Hermenegildo, M.V., Kowalski, R., Rossi, F. (eds.) Prolog - The Next 50 Years. LNCS, vol. 13900, pp. 224\u2013236. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35254-6_18"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Grosof, B., Swift, T.: Radial restraint: a semantically clean approach to bounded rationality for logic programs. In: AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8682"},{"key":"10_CR16","unstructured":"Kifer, M.: Knowledge representation & reasoning with Flora-2. The Flora-2 Web Site (2022). http:\/\/flora.sourceforge.net"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/210332.210335","volume":"42","author":"M Kifer","year":"1995","unstructured":"Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. J. ACM 42, 741\u2013843 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF00245460","volume":"9","author":"M Kifer","year":"1992","unstructured":"Kifer, M., Lozinskii, E.: A logic for reasoning with inconsistency. J. Autom. Reason. 9(2), 179\u2013215 (1992)","journal-title":"J. Autom. Reason."},{"issue":"4\u20135","key":"10_CR19","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1017\/S1471068413000446","volume":"13","author":"S Liang","year":"2013","unstructured":"Liang, S., Kifer, M.: A practical analysis of non-termination in large logic programs. Theory Pract. Log. Program. 13(4\u20135), 705\u2013719 (2013)","journal-title":"Theory Pract. Log. Program."},{"key":"10_CR20","unstructured":"Covid-19 global pandemic scenario for DARPA AIDA program (2022). National Institute of Standards and Technology. https:\/\/tac.nist.gov\/2023\/KBP\/CRUX\/guidelines\/AIDA_COVID19ScenarioV2.pdf"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Nute, D.: Defeasible logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, pp. 353\u2013395. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537472.003.0007"},{"key":"10_CR22","unstructured":"Phi-3 technical report: a highly capable language model locally on your phone (2024). arXiv:2404.14219"},{"issue":"1\u20132","key":"10_CR23","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01531263","volume":"9","author":"H Prakken","year":"1993","unstructured":"Prakken, H.: An argumentation framework in default logic. Ann. Math. Artif. Intell. 9(1\u20132), 93\u2013132 (1993)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"10_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629337","volume":"15","author":"F Riguzzi","year":"2014","unstructured":"Riguzzi, F., Swift, T.: Terminating evaluation of logic programs with finite three-valued models. ACM Trans. Comput. Log. 15(4), 1\u201338 (2014)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1\u20132","key":"10_CR25","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0004-3702(00)00054-0","volume":"123","author":"C Sakama","year":"2000","unstructured":"Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artif. Intell. 123(1\u20132), 185\u2013222 (2000)","journal-title":"Artif. Intell."},{"issue":"4\u20135","key":"10_CR26","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1017\/S1471068414000209","volume":"14","author":"T Swift","year":"2014","unstructured":"Swift, T.: Incremental tabling in support of knowledge representation and reasoning. Theory Pract. Log. Program. 14(4\u20135), 553\u2013567 (2014)","journal-title":"Theory Pract. Log. Program."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Swift, T., Andersen, C.: The Janus system: multi-paradigm programming in Prolog and Python. In: Proceedings of ICLP. EPTCS (2023)","DOI":"10.4204\/EPTCS.385.24"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Swift, T., Kifer, M.: Material for the paper: multi-paradigm logic programming in the ErgoAI system (2024). https:\/\/zenodo.org\/records\/13336861","DOI":"10.1007\/978-3-031-74209-5_10"},{"issue":"1\u20132","key":"10_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1017\/S1471068411000500","volume":"12","author":"T Swift","year":"2012","unstructured":"Swift, T., Warren, D.: XSB: extending the power of Prolog using tabling. Theory Pract. Log. Program. 12(1\u20132), 157\u2013187 (2012)","journal-title":"Theory Pract. Log. Program."},{"issue":"3","key":"10_CR30","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A van Gelder","year":"1991","unstructured":"van Gelder, A., Ross, K., Schlipf, J.: Unfounded sets and well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-02846-5_35","volume-title":"Logic Programming","author":"H Wan","year":"2009","unstructured":"Wan, H., Grosof, B., Kifer, M., Fodor, P., Liang, S.: Logic programming with defaults and argumentation theories. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 432\u2013448. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02846-5_35"},{"issue":"1","key":"10_CR32","doi-asserted-by":"publisher","first-page":"81","DOI":"10.3233\/SW-140140","volume":"6","author":"H Wan","year":"2014","unstructured":"Wan, H., Kifer, M., Grosof, B.: Defeasibility in answer set programs with defaults and argumentation rules. Semant. Web J. 6(1), 81\u201398 (2014)","journal-title":"Semant. Web J."},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-44957-4_11","volume-title":"Computational Logic \u2014 CL 2000","author":"K Wang","year":"2000","unstructured":"Wang, K., Zhou, L., Lin, F.: Alternating fixpoint theory for logic programs with priority. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 164\u2013178. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_11"},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-39733-5_4","volume":"2800","author":"G Yang","year":"2003","unstructured":"Yang, G., Kifer, M.: Inheritance in rule-based frame systems: semantics and inference. J. Data Semant. 2800, 69\u201397 (2003)","journal-title":"J. Data Semant."},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-540-39964-3_43","volume-title":"On The Move to Meaningful Internet Systems 2003: CoopIS, DOA, and ODBASE","author":"G Yang","year":"2003","unstructured":"Yang, G., Kifer, M., Zhao, C.: $$\\cal{F}$$lora-2: a rule-based knowledge representation and inference infrastructure for the semantic web. In: Meersman, R., Tari, Z., Schmidt, D.C. (eds.) OTM 2003. LNCS, vol. 2888, pp. 671\u2013688. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39964-3_43"},{"issue":"4","key":"10_CR36","first-page":"183","volume":"14","author":"Y Zhang","year":"2001","unstructured":"Zhang, Y., Wu, C., Bai, Y.: Implementing prioritized logic programming. AI Commun. 14(4), 183\u2013196 (2001)","journal-title":"AI Commun."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74209-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:02:51Z","timestamp":1736614971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74209-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031742088","9783031742095"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74209-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2024.demacs.unical.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}