{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:30:14Z","timestamp":1648575014911},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1007\/bf00117743","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T01:52:57Z","timestamp":1099187577000},"page":"7-33","source":"Crossref","is-referenced-by-count":4,"title":["Knowledge representation for mathematical discovery: Three experiments in graph theory"],"prefix":"10.1007","volume":"1","author":[{"given":"Susan L.","family":"Epstein","sequence":"first","affiliation":[]},{"given":"N. S.","family":"Sridharan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1111\/j.1467-8640.1988.tb00089.x","volume":"4-1","author":"S.L. Epstein","year":"1988","unstructured":"S.L. Epstein, ?Learning and discovery: One system's search for mathematical knowledge?, Computational Intelligence vol. 4?1, pp. 42?53, 1988.","journal-title":"Computational Intelligence"},{"key":"CR2","first-page":"134","volume-title":"Computers and Thought","author":"H. Gelernter","year":"1963","unstructured":"H. Gelernter, ?Realization of a geometry-theorem proving machine,? in Computers and Thought, edited by E.A.Feigenbaum and J.Feldman, McGraw-Hill: New York, pp. 134?152, 1963."},{"key":"CR3","unstructured":"D.B. Lenat, ?AM: An artificial intelligence approach to discovery in mathematics,? Ph.D. dissertation, Department of Computer Science, Stanford University, 1976."},{"key":"CR4","unstructured":"N.S. Sridharan, ?Artificial intelligence and mathematical reasoning,? paper presented to the Mathematics Section meeting of the New York Academy of Sciences, New York, NY, May, 1984."},{"key":"CR5","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"F. Harary, Graph Theory, Addison-Wesley: Reading, 1972."},{"key":"CR6","volume-title":"How to Solve It","author":"G. Polya","year":"1957","unstructured":"G. Polya, How to Solve It, Doubleday Anchor Books: Garden City, 1957. 2nd ed.","edition":"2nd ed."},{"key":"CR7","volume-title":"Mathematical Discovery","author":"G. Polya","year":"1962","unstructured":"G. Polya, Mathematical Discovery, John Wiley & Sons: New York, 1962. Volumes 1 and 2."},{"key":"CR8","doi-asserted-by":"crossref","volume-title":"Proof and Refutations?The Logic of Mathematical Discovery","author":"I. Lakatos","year":"1976","unstructured":"I. Lakatos, Proof and Refutations?The Logic of Mathematical Discovery, edited by I.Worrall and E.Zahar, Cambridge University Press: Cambridge, 1976.","DOI":"10.1017\/CBO9781139171472"},{"key":"CR9","series-title":"American Mathematical Society Colloquium Publications","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"O. Ore","year":"1962","unstructured":"O. Ore, Theory of Graphs, American Mathematical Society Colloquium Publications, Volume 38, American Mathematical Society: Providence, 1962."},{"key":"CR10","doi-asserted-by":"crossref","volume-title":"Graph Theory with Applications","author":"J. Bondy","year":"1976","unstructured":"J. Bondy and U. Murty, Graph Theory with Applications, North-Holland: New York, 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"CR11","unstructured":"S.L. Epstein, ?Knowledge representation in mathematics: A case study in graph theory,? Ph.D. dissertation, Department of Computer Science, Rutgers University, 1983."},{"key":"CR12","first-page":"73","volume-title":"Pens\u00e9es de Pascal","author":"B. Pascal","year":"1964","unstructured":"B. Pascal, Pens\u00e9es de Pascal, \u00c9ditions Garnier Fr\u00e8res:Paris, pp. 73?84, 1964."},{"key":"CR13","first-page":"27","volume-title":"La Valeur de la Sci\u00e8nce","author":"H. Poincar\u00e9","year":"1970","unstructured":"H. Poincar\u00e9, La Valeur de la Sci\u00e8nce, Flammarion: France, pp. 27?40, 1970."},{"key":"CR14","volume-title":"A Computational Logic","author":"R.S. Boyer","year":"1979","unstructured":"R.S. Boyer and J.S. Moore, A Computational Logic, Academic Press: New York, 1979."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0004-3702(88)90039-2","volume":"34-2","author":"M. Leyton","year":"1988","unstructured":"M. Leyton, ?A process grammar for shape,? Artificial Intelligence vol. 34?2, pp. 213?247, 1988.","journal-title":"Artificial Intelligence"},{"key":"CR16","volume-title":"Introduction to Automate Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to Automate Theory, Languages and Computation, Addison-Wesley: Reading, 1979."},{"key":"CR17","first-page":"3","volume-title":"Machine Learning: An Artificial Intelligence Approach","author":"J.G. Carbonell","year":"1983","unstructured":"J.G. Carbonell, R.S. Michalski, and T.M. Mitchell, ?An overview of machine learning,? in Machine Learning: An Artificial Intelligence Approach, edited by R.S.Michalski, J.G.Carbonell, and T.M.Mitchell, Tioga Publishing: Palo Alto, pp. 3?23, 1983."},{"key":"CR18","volume-title":"Theory of Problem Solving: An Approach to Artificial Intelligence","author":"R. Banerji","year":"1969","unstructured":"R. Banerji, Theory of Problem Solving: An Approach to Artificial Intelligence, American Elsevier Publishing: New York, 1969."},{"key":"CR19","first-page":"107","volume-title":"Machine Learning: An Artificial Intelligence Approach","author":"P.E. Utgoff","year":"1986","unstructured":"P.E. Utgoff, ?Shift of bias for inductive concept learning,? in Machine Learning: An Artificial Intelligence Approach, Volume II, edited by R.S.Michalski, J.G.Carbonell and T.M.Mitchell, Tioga Publishing: Palo Alto, pp. 107?148, 1986."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/B978-0-12-737550-2.50019-1","volume-title":"Pattern-Directed Inference Systems","author":"B.G. Buchanan","year":"1978","unstructured":"B.G. Buchanan and T.M. Mitchell, ?Model-directed learning of production rules,? in Pattern-Directed Inference Systems, edited by D.A.Waterman and F.Hayes-Roth, Academic Press: New York, pp. 297?312, 1978."},{"key":"CR21","unstructured":"H. Galperin, ?Succinct representation of graphs,? Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Princeton University, 1982."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF00289616","volume":"4","author":"B.K. Rosen","year":"1975","unstructured":"B.K. Rosen, ?Deriving graphs from graphs by applying a production,? Acta Informatica vol. 4, pp. 337?357, 1975.","journal-title":"Acta Informatica"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"M. Wegman, ?Summarizing graphs by regular expressions,? POPL, pp. 203?216, 1983.","DOI":"10.1145\/567067.567088"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/0210028","volume":"10?2","author":"A. Proskurowski","year":"1981","unstructured":"A. Proskurowski, ?Recursive graphs, recursive labelings and shortest paths,? SIAM J. Comput. vol. 10?2, pp. 391?397, 1981.","journal-title":"SIAM J. Comput."},{"key":"CR25","first-page":"253","volume-title":"Proceedings 10th Annual ACM Symposium on Theory of Computing","author":"M. Yannakakis","year":"1978","unstructured":"M.Yannakakis, ?Node-and-edge-deletion NP-complete problems,? in Proceedings 10th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery: New York, 1978, pp. 253?264."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1145\/362619.362627","volume":"14?7","author":"T.W. Pratt","year":"1971","unstructured":"T.W. Pratt and D.P. Friedman, ?A language extension for graph processing and its formal semantics,? CACM vol. 14?7, pp. 460?467, 1971.","journal-title":"CACM"},{"key":"CR27","volume-title":"Ph.D. dissertation","author":"P.M. Dorin","year":"1982","unstructured":"P.M. Dorin, ?Aspects of the implementation of sequential graph rewriting systems,? Ph.D. dissertation, Department of Computer Science, University of California, Los Angeles, 1982."},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"M. Sims, ?Empirical and analytic discovery in IL,? in Proceedings of the Fourth International Workshop on Machine Learning, Irvine, CA, 1987, pp. 274?280.","DOI":"10.1016\/B978-0-934613-41-5.50031-3"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00117743.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00117743\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00117743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T10:09:55Z","timestamp":1554718195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00117743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["BF00117743"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf00117743","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":["Artificial Intelligence"],"published":{"date-parts":[[1991,7]]}}}