{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T22:40:10Z","timestamp":1747953610548,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662465486"},{"type":"electronic","value":"9783662465493"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46549-3_14","type":"book-chapter","created":{"date-parts":[[2015,4,24]],"date-time":"2015-04-24T07:14:40Z","timestamp":1429859680000},"page":"215-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Integration of and a Solution for Proof Problems and Query-Answering Problems"],"prefix":"10.1007","author":[{"given":"Kiyoshi","family":"Akama","sequence":"first","affiliation":[]},{"given":"Ekawit","family":"Nantajeewarawat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,25]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Akama, K., Nantajeewarawat, E.: Meaning-preserving skolemization. In: 2011 International Conference on Knowledge Engineering and Ontology Development, Paris, France, pp. 322\u2013327 (2011)","DOI":"10.5220\/0003692003220327"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Akama, K., Nantajeewarawat, E.: Proving theorems based on equivalent transformation using resolution and factoring. In: 2nd World Congress on Information and Communication Technologies, Trivandrum, India, pp. 7\u201312 (2012)","DOI":"10.1109\/WICT.2012.6409041"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Akama, K., Nantajeewarawat, E.: Embedding proof problems into query-answering problems and problem solving by equivalent transformation. Technical report, Hokkaido University, Sapporo, Japan (2013)","DOI":"10.7763\/LNSE.2013.V1.54"},{"key":"14_CR4","volume-title":"Semantic Entailment and Formal Derivability","author":"EW Beth","year":"1955","unstructured":"Beth, E.W.: Semantic Entailment and Formal Derivability. Noord-Hollandsche Uitg. Mij, Amsterdam (1955)"},{"key":"14_CR5","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C-L Chang","year":"1973","unstructured":"Chang, C.-L., Lee, R.C.-T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York (1973)"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2360-3","volume-title":"First-Order Logic and Automated Theorem Proving","author":"M Fitting","year":"1996","unstructured":"Fitting, M.: First-Order Logic and Automated Theorem Proving, 2nd edn. Springer, New York (1996)","edition":"2"},{"key":"14_CR7","volume-title":"Logic for Computer Science: Foundations of Automatic Theorem Proving","author":"JH Gallier","year":"1986","unstructured":"Gallier, J.H.: Logic for Computer Science: Foundations of Automatic Theorem Proving. Wiley, New York (1986)"},{"key":"14_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.websem.2005.05.001","volume":"3","author":"B Motik","year":"2005","unstructured":"Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. Web Semant. 3, 41\u201360 (2005)","journal-title":"J. Web Semant."},{"key":"14_CR10","volume-title":"Automated Theorem Proving: Theory and Practice","author":"M Newborn","year":"2000","unstructured":"Newborn, M.: Automated Theorem Proving: Theory and Practice. Springer, New York (2000)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12, 23\u201341 (1965)","journal-title":"J. ACM"}],"container-title":["Communications in Computer and Information Science","Knowledge Discovery, Knowledge Engineering and Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46549-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T22:12:29Z","timestamp":1747951949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46549-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662465486","9783662465493"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46549-3_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}