{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:15:07Z","timestamp":1761610507393,"version":"build-2065373602"},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)82522-8","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"340-351","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Agent Based Mathematical Reasoning"],"prefix":"10.1016","volume":"23","author":[{"given":"Christoph","family":"Benzm\u00fcller","sequence":"first","affiliation":[]},{"given":"Mateja","family":"Jamnik","sequence":"additional","affiliation":[]},{"given":"Manfred","family":"Kerber","sequence":"additional","affiliation":[]},{"given":"Volker","family":"Sorge","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S1571-0661(05)82522-8_BIB1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF00252180","article-title":"and H. Xi. TPS: A theorem proving system for classical type theory","volume":"16","author":"Andrews","year":"1996","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB2","unstructured":"C. Benzm\u00fcller, M. Bishop, and V. Sorge. Integrating TPS and \u03a9mega. Journal of Universal Computer Science, 1999. Special issue on Integrating of Deduction System, forthcoming."},{"key":"10.1016\/S1571-0661(05)82522-8_BIB3","doi-asserted-by":"crossref","unstructured":"C. Benzm\u00fcller, L. Cheikhrouhou, D. Fehrer, A. Fiedler, X. Huang, M. Kerber, M. Kohlhase, K. Konrad, E. Melis, A. Meier, W. Schaarschmidt, J. Siekmann, and V. Sorge. \u03a9mega: Towards a mathematical assistant. In W. McCune, editor, Proceedings of the 14th Conference on Automated Deduction, pages 252\u2014255. Townsville, Australia, 1997. Springer, LNAI 1249.","DOI":"10.1007\/3-540-63104-6_23"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB4","series-title":"Proceedings of the 15th Conference on Automated Deduction","first-page":"139","article-title":"LEO \u2014 a higher-order theorem prover","author":"Benzm\u00fcller","year":"1998"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB5","series-title":"Artificial Intelligence: Methodology, Systems and Applications","first-page":"102","article-title":"A blackboard architecture for guiding interactive proofs","author":"Benzm\u00fcller","year":"1998"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB6","article-title":"Critical agents supporting interactive theorem proving","author":"Benzm\u00fcller","year":"1999","journal-title":"SEKI-Report SR-99\ue4f802, Fachbereich Informatik, Universit\u00e4t des Saarlandes"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB7","article-title":"Intelligence without reason","author":"Brooks","year":"1991","journal-title":"Memo No. 1293, MIT"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB8","series-title":"Proceedings of the 9th Conference on Automated Deduction","first-page":"111","article-title":"The use of explicit plans to guide inductive proofs","author":"Bundy","year":"1988"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB9","first-page":"71","article-title":"A subsumption architecture for theorem proving","volume":"Volume 349\/1689","author":"Bundy","year":"1994","journal-title":"Philosophical Transactions of the Royal Society of London"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB10","series-title":"10th Conference on Automated Deduction","first-page":"647","article-title":"The OYSTER-CAM system","author":"Bundy","year":"1990"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB11","series-title":"Proceedings of the 14th Conference on Automated Deduction","first-page":"57","article-title":"Integration of automated and interactive theorem proving in ILF","author":"Dahn","year":"1997"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB12","first-page":"81","article-title":"Knowledge-Based Distributed Search Using Teamwork","author":"Denzinger","year":"1995","journal-title":"Proceedings of the First International Conference on Multiagent Systems (ICMAS-95)"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB13","series-title":"Automated Deduction, a Basis for Application\ue4f8Handbook of the German Focus Programme on Automated Deduction, chapter II.14","first-page":"383","article-title":"Cooperating theorem provers","author":"Denzinger","year":"1998"},{"issue":"2","key":"10.1016\/S1571-0661(05)82522-8_BIB14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1023\/A:1005879229581","article-title":"DISCOUNT - a distributed and learning equational prover","volume":"18","author":"Denzinger","year":"1997","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","article-title":"STRIPS: A new approach to the application of theorem proving to problem solving","volume":"2","author":"Fikes","year":"1971","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB16","article-title":"An open approach to concurrent theorem proving","volume":"volume 3","author":"Fisher","year":"1997"},{"issue":"3","key":"10.1016\/S1571-0661(05)82522-8_BIB17","first-page":"156","article-title":"Agent-oriented integration of distributed mathematical services","volume":"5","author":"Franke","year":"1999","journal-title":"Journal of Universal Computer Science"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB18","series-title":"In Proceedings of the First International Workshop on Proof Transformation and Presentation","first-page":"35","article-title":"Proof verbalization in PROVERB.","author":"Huang","year":"1997"},{"issue":"3","key":"10.1016\/S1571-0661(05)82522-8_BIB19","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1023\/A:1006059810729","article-title":"Integrating Computer Algebra Into Proof Planning","volume":"21","author":"Kerber","year":"1998","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB20","first-page":"463","article-title":"Some philosophical problems from the standpoint of artificial intelligence","volume":"4","author":"McCarthy","year":"1969","journal-title":"Machine Intelligence"},{"issue":"3","key":"10.1016\/S1571-0661(05)82522-8_BIB21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1005843212881","article-title":"Solution of the Robbins problem","volume":"19","author":"McCune","year":"1997","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB22","series-title":"Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI95)","first-page":"182","article-title":"A model of analogy-driven proof-plan construction","author":"Melis","year":"1995"},{"year":"1981","series-title":"Mathematical Discovery","author":"P\u00f3lya","key":"10.1016\/S1571-0661(05)82522-8_BIB23"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB24","series-title":"15th Conference on Automated Deduction","article-title":"System description: proof planning in higher-order logic with \u03bb-Clam","author":"Richardson","year":"1998"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB25","article-title":"Loui: Lovely \u03a9mega User Interface. Special Issue on Integrated Systems of the Journal of Formal Aspects of Computer Science","author":"Siekmann","year":"1999","journal-title":"forthcoming"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB26","series-title":"Human Cognition and Social Agent Technology","article-title":"Architectural requirements for human-like agents \ue4f8 both natural and artificial. (What sorts of machines can love?)","author":"Sloman","year":"1999"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB27","series-title":"Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX\ue4f898)","first-page":"320","article-title":"P-SETHEO: Strategy parallelism in automated theorem proving","author":"Wolf","year":"1998"},{"key":"10.1016\/S1571-0661(05)82522-8_BIB28","series-title":"AAAI Fall Symposium on Rational Agency","article-title":"Models of Bounded Rationality","author":"Zilberstein","year":"1995"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825228?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825228?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:32Z","timestamp":1761610112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999]]}},"alternative-id":["S1571066105825228"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82522-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Agent Based Mathematical Reasoning","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)82522-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}