{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:18:34Z","timestamp":1742937514424,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031493416"},{"type":"electronic","value":"9783031493423"}],"license":[{"start":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T00:00:00Z","timestamp":1701475200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T00:00:00Z","timestamp":1701475200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49342-3_4","type":"book-chapter","created":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T09:02:27Z","timestamp":1701421347000},"page":"55-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["ULKB Logic: A HOL-Based Framework for\u00a0Reasoning over\u00a0Knowledge Graphs"],"prefix":"10.1007","author":[{"given":"Guilherme","family":"Lima","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Rademaker","sequence":"additional","affiliation":[]},{"given":"Rosario","family":"Uceda-Sosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,2]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edn. Kluwer, Dordrecht (2002). https:\/\/doi.org\/10.1007\/978-94-015-9934-4","DOI":"10.1007\/978-94-015-9934-4"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-88564-1_8","volume-title":"The Semantic Web - ISWC 2008","author":"R Angles","year":"2008","unstructured":"Angles, R., Gutierrez, C.: The expressive power of SPARQL. In: Sheth, A., et al. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 114\u2013129. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88564-1_8"},{"key":"4_CR3","unstructured":"Austin, E.C.: HaskHOL: a Haskell hosted domain specific language for higher-order logic theorem proving. Master\u2019s thesis, Electrical Engineering and Computer Science Faculty, University of Kansas (2011)"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Aydemir, B., Chargu\u00e9raud, A., Pierce, B.C., Pollack, R., Weirich, S.: Engineering formal metatheory. In: Proceedings of 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL \u201908, pp. 3\u201315. ACM, New York (2008). https:\/\/doi.org\/10.1145\/1328438.1328443","DOI":"10.1145\/1328438.1328443"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511711787"},{"key":"4_CR6","unstructured":"Bansal, K., Loos, S., Rabe, M., Szegedy, C., Wilcox, S.: HOList: an environment for machine learning of higher-order theorem proving. In: Proceedings of 36th International Conference on Machine Learning, Long Beach, California, USA. PMLR (2019)"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. J. Symb. Logic 5(2), 56\u201368 (1940). https:\/\/doi.org\/10.2307\/2266170","journal-title":"J. Symb. Logic"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-35786-2_11","volume-title":"Conceptual Structures for STEM Research and Education","author":"R Dapoigny","year":"2013","unstructured":"Dapoigny, R., Barlatier, P.: Modeling ontological structures with type classes in Coq. In: Pfeiffer, H.D., Ignatov, D.I., Poelmans, J., Gadiraju, N. (eds.) ICCS-ConceptStruct 2013. LNCS (LNAI), vol. 7735, pp. 135\u2013152. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35786-2_11"},{"volume-title":"Introduction to HOL: A Theorem Proving Environment for Higher Order Logic","year":"1993","key":"4_CR9","unstructured":"Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)"},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09724-4","volume-title":"Edinburgh LCF: A Mechanised Logic of Computation","author":"MJC Gordon","year":"1979","unstructured":"Gordon, M.J.C., Milner, A.J., Wadsworth, C.P.: Edinburgh LCF: A Mechanised Logic of Computation. Springer, Berlin (1979). https:\/\/doi.org\/10.1007\/3-540-09724-4"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/fmp.2017.1","volume":"5","author":"T Hales","year":"2017","unstructured":"Hales, T., et al.: A formal proof of the Kepler conjecture. Forum Math. Pi 5, 1\u201329 (2017). https:\/\/doi.org\/10.1017\/fmp.2017.1","journal-title":"Forum Math. Pi"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-03359-9_4","volume-title":"Theorem Proving in Higher Order Logics","author":"J Harrison","year":"2009","unstructured":"Harrison, J.: HOL Light: an overview. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 60\u201366. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_4"},{"key":"4_CR13","unstructured":"Harrison, J.: HOL Light tutorial (2017). https:\/\/www.cl.cam.ac.uk\/~jrh13\/hol-light\/tutorial.pdf"},{"key":"4_CR14","unstructured":"Horrocks, I., Patel-Schneider, P.F., Boley, H., Tabet, S., Grosof, B., Dean, M.: SWRL: a semantic web rule language combining OWL and RuleML. W3C member submission, W3C, May 2004. https:\/\/www.w3.org\/Submission\/SWRL\/"},{"key":"4_CR15","unstructured":"Lai, Z., Ng, A.B., Wong, L.Z., See, S., Lin, S.: Dependently typed knowledge graphs. Technical report. arXiv:2003.03785, arXiv.org (2020)"},{"key":"4_CR16","volume-title":"Introduction to Higher Order Categorical Logic","author":"J Lambek","year":"1986","unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher Order Categorical Logic. Cambridge University Press, Cambridge (1986)"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"McBride, C., McKinna, J.: Functional pearl: I am not a number-I am a free variable. In: Proceedings of 2004 ACM SIGPLAN Workshop on Haskell. Haskell \u201904, pp. 1\u20139. ACM, New York (2004). https:\/\/doi.org\/10.1145\/1017472.1017477","DOI":"10.1145\/1017472.1017477"},{"issue":"11","key":"4_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/219717.219748","volume":"38","author":"GA Miller","year":"1995","unstructured":"Miller, G.A.: WordNet: a lexical database for English. Commun. ACM 38(11), 39\u201341 (1995). https:\/\/doi.org\/10.1145\/219717.219748","journal-title":"Commun. ACM"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"4_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","author":"T Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Polleres, A., Wallner, J.P.: On the relation between SPARQL 1.1 and answer set programming. J. Appl. Non-Classical Logics 23(1\u20132), 159\u2013212 (2013). https:\/\/doi.org\/10.1080\/11663081.2013.798992","DOI":"10.1080\/11663081.2013.798992"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"P\u00e9rez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM Trans. Database Syst. 34(3), 16:1\u201316:45 (2009). https:\/\/doi.org\/10.1145\/1567274.1567278","DOI":"10.1145\/1567274.1567278"},{"issue":"2\u20133","key":"4_CR23","first-page":"91","volume":"15","author":"A Riazanov","year":"2002","unstructured":"Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Commun. 15(2\u20133), 91\u2013110 (2002)","journal-title":"AI Commun."},{"key":"4_CR24","unstructured":"Schuler, K.K.: VerbNet: a broad-coverage, comprehensive verb lexicon. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, USA (2005)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-030-29436-6_29","volume-title":"Automated Deduction \u2013 CADE 27","author":"S Schulz","year":"2019","unstructured":"Schulz, S., Cruanes, S., Vukmirovi\u0107, P.: Faster, higher, stronger: E 2.3. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 495\u2013507. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29436-6_29"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Speer, R., Chin, J., Havasi, C.: ConceptNet 5.5: an open multilingual graph of general knowledge. In: Proceedings of 31st AAAI Conference on Artificial Intelligence (AAAI-17), San Francisco, California, USA, 4\u20139 February 2017, pp. 4444\u20134451. AAAI (2017)","DOI":"10.1609\/aaai.v31i1.11164"},{"issue":"4","key":"4_CR27","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10817-017-9407-7","volume":"59","author":"G Sutcliffe","year":"2017","unstructured":"Sutcliffe, G.: The TPTP problem library and associated infrastructure. J. Automat. Reason. 59(4), 483\u2013502 (2017). https:\/\/doi.org\/10.1007\/s10817-017-9407-7","journal-title":"J. Automat. Reason."},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Tang, Y., Sun, J., Dong, J.S., Mahony, B.: Reasoning about semantic web in Isabelle\/HOL. In: Proceedings of 11th Asia-Pacific Software Engineering Conference, pp. 46\u201353 (2004). https:\/\/doi.org\/10.1109\/APSEC.2004.82","DOI":"10.1109\/APSEC.2004.82"},{"key":"4_CR29","unstructured":"The Coq Development Team: The Coq Reference Manual: Release 8.14.0, October 2021"},{"issue":"10","key":"4_CR30","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrande\u010di\u0107","year":"2014","unstructured":"Vrande\u010di\u0107, D., Kr\u00f6tzsch, M.: Wikidata: a free collaborative knowledgebase. Commun. ACM 57(10), 78\u201385 (2014). https:\/\/doi.org\/10.1145\/2629489","journal-title":"Commun. ACM"},{"key":"4_CR31","unstructured":"W3C-OWL-WG-2012: OWL 2 web ontology language document overview (second edition). W3C recommendation, W3C, December 2012. http:\/\/www.w3.org\/TR\/2012\/REC-owl2-overview-20121211\/"},{"key":"4_CR32","unstructured":"W3C SPARQL Working Group: SPARQL 1.1 overview. W3C recommendation, W3C (2013). http:\/\/www.w3.org\/TR\/2013\/REC-sparql11-overview-20130321\/"},{"key":"4_CR33","unstructured":"Zhan, B.: HolPy: interactive theorem proving in Python. Technical report. arXiv:1905.05970, arXiv.org (2020)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49342-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T09:03:10Z","timestamp":1701421390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49342-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,2]]},"ISBN":["9783031493416","9783031493423"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49342-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,2]]},"assertion":[{"value":"2 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBMF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Manaus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sbmf2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sbmf23.ufam.edu.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}