{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T03:29:14Z","timestamp":1777087754031,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Intelligence"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1023\/a:1008376514077","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T14:41:38Z","timestamp":1040568098000},"page":"45-58","source":"Crossref","is-referenced-by-count":39,"title":["Approximating the Semantics of Logic Programs by Recurrent Neural Networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Steffen","family":"H\u00f6lldobler","sequence":"first","affiliation":[]},{"given":"Yvonne","family":"Kalinke","sequence":"additional","affiliation":[]},{"given":"Hans-Peter","family":"St\u00f6rr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"211545_CR1","unstructured":"S. H\u00f6lldobler and Y. Kalinke, \u201cTowards a massively parallel computational model for logic programming,\u201d in Proceedings of the ECAI'94 Workshop on Combining Symbolic and Connectionist Processing, ECCAI, 1994, pp. 68-77."},{"key":"211545_CR2","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler, Y. Kalinke, and H.-P. St\u00f6rr, \u201cRecurrent neural networks to approximate the semantics of acceptable logic programs,\u201d in Advanced Topics in Artificial Intelligence, edited by G. Antoniou and J. Slaney, LNAI 1502, Springer-Verlag, 1998.","DOI":"10.1007\/BFb0095050"},{"key":"211545_CR3","doi-asserted-by":"crossref","unstructured":"S.-E. Bornscheuer, S. H\u00f6lldobler, Y. Kalinke, and A. Strohmaier, \u201cMassively parallel reasoning,\u201d Automated Deduction\u2014A Basis for Applications, Kluwer Academic Publishers, vol. II, chap. 11, pp. 291-321, 1998.","DOI":"10.1007\/978-94-017-0435-9_11"},{"key":"211545_CR4","volume-title":"Deduction","author":"P.N. Johnson-Laird","year":"1991","unstructured":"P.N. Johnson-Laird and R.M.J. Byrne, Deduction, Lawrence Erlbaum Associates: Hove and London, UK, 1991."},{"issue":"1","key":"211545_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0140525X00052432","volume":"11","author":"P. Smolensky","year":"1988","unstructured":"P. Smolensky, \u201cOn the proper treatment of connectionism,\u201d Behavioral and Brain Sciences, vol. 11,no. 1, pp. 1-23, 1988.","journal-title":"Behavioral and Brain Sciences"},{"key":"211545_CR6","doi-asserted-by":"crossref","unstructured":"R. Manthey and F. Bry, \u201cSATCHMO: A theorem prover implemented in Prolog,\u201d in Proceedings of the Conference on Automated Deduction, edited by E. Lusk and R. Overbeek, LLNCS 310, pp. 415-434, Springer, 1988.","DOI":"10.1007\/BFb0012847"},{"key":"211545_CR7","unstructured":"M. Fujita, R. Hasegawa, M. Koshimura, and H. Fujita, \u201cModel generation theorem provers on a parallel inference machine,\u201d in Fifth Generation Computer Systems '92: Proceedings of the International Conference on Fifth Generation Computer Systems,\u201d edited by ICOT Staff, IOS Press, pp. 357-375, 1992."},{"key":"211545_CR8","unstructured":"J. Slaney, \u201cScott: A model-guided theorem prover,\u201d in Proceedings of the International Joint Conference on Artificial Intelligence, 1993, pp. 109-114."},{"key":"211545_CR9","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, Springer, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"211545_CR10","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"K.R. Apt and M.H. Van Emden, \u201cContributions to the theory of logic programming,\u201d Journal of the ACM, vol. 29, pp. 841-862, 1982.","journal-title":"Journal of the ACM"},{"issue":"3","key":"211545_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0743-1066(14)80007-1","volume":"21","author":"M. Fitting","year":"1994","unstructured":"M. Fitting, \u201cMetric methods\u2014three examples and a theorem,\u201d Journal of Logic Programming, vol. 21,no. 3, pp. 113-127, 1994.","journal-title":"Journal of Logic Programming"},{"key":"211545_CR12","first-page":"33","volume-title":"Knowledge Representation in Neural Networks","author":"A.S. d'Avila Garcez","year":"1997","unstructured":"A.S. d'Avila Garcez, G. Zaverucha, and L.A.V. de Carvalho, \u201cLogic programming and inductive learning in artificial neural networks,\u201d in Knowledge Representation in Neural Networks, edited by Ch. Herrmann, F. Reine, and A. Strohmaier, Logos Verlag: Berlin, pp. 33-46, 1997."},{"issue":"1","key":"211545_CR13","first-page":"71","volume":"13","author":"G.G. Towell","year":"1993","unstructured":"G.G. Towell and J.W. Shavlik, \u201cExtracting refined rules from knowledge-based neural networks,\u201d Machine Learning, vol. 13,no. 1, pp. 71-101, 1993.","journal-title":"Machine Learning"},{"key":"211545_CR14","doi-asserted-by":"crossref","unstructured":"R. Andrews, J. Diederich, and A. Tickle, \u201cA survey and critique of techniques for extracting rules from trained artificial neural networks,\u201d Knowledge-Based Systems, vol. 8,no. 6, 1995.","DOI":"10.1016\/0950-7051(96)81920-4"},{"key":"211545_CR15","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1017\/S0140525X0005264X","volume":"11","author":"J. McCarthy","year":"1988","unstructured":"J. McCarthy, \u201cEpistemological challanges for connectionism,\u201d Behavioural and Brain Sciences, vol. 11, p. 44, 1988, Commentary to [5].","journal-title":"Behavioural and Brain Sciences"},{"key":"211545_CR16","doi-asserted-by":"crossref","unstructured":"G. Pinkas, \u201cSymmetric neural networks and logic satisfiability,\u201d Neural Computation, vol. 3, 1991.","DOI":"10.1162\/neco.1991.3.2.282"},{"key":"211545_CR17","unstructured":"G. Pinkas, \u201cExpressing first-order logic in symmetric connectionist networks,\u201d in Informal Proceedings of the International Workshop on Parallel Processing for AI, edited by L.N. Kanal and C.B. Suttner, Sydney, Australia, pp. 155-160, Aug. 1991."},{"issue":"3","key":"211545_CR18","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1017\/S0140525X00030910","volume":"16","author":"L. Shastri","year":"1993","unstructured":"L. Shastri and V. Ajjanagadde, \u201cFrom associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony,\u201d Behavioural and Brain Sciences, vol. 16,no. 3, pp. 417-494, Sept. 1993.","journal-title":"Behavioural and Brain Sciences"},{"key":"211545_CR19","series-title":"Technical Report","volume-title":"Automated inferencing and connectionist models","author":"S. H\u00f6lldobler","year":"1993","unstructured":"S. H\u00f6lldobler, \u201cAutomated inferencing and connectionist models,\u201d Technical Report AIDA-93-06, Intellektik, Informatik, TH Darmstadt, 1993 (Postdoctoral Thesis)."},{"key":"211545_CR20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/09540098908915635","volume":"1","author":"T.E. Lange","year":"1989","unstructured":"T.E. Lange and M.G. Dyer, \u201cHigh-level inferencing in a connectionist network,\u201d Connection Science, vol. 1, pp. 181-217, 1989.","journal-title":"Connection Science"},{"key":"211545_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0004-3702(90)90005-K","volume":"46","author":"J.B. Pollack","year":"1990","unstructured":"J.B. Pollack, \u201cRecursive distributed representations,\u201d Artificial Intelligence, vol. 46, pp. 77-105, 1990.","journal-title":"Artificial Intelligence"},{"key":"211545_CR22","series-title":"Technical Report","volume-title":"Labeling RAAM","author":"A. Sperduti","year":"1993","unstructured":"A. Sperduti, \u201cLabeling RAAM,\u201d Technical Report TR-93-029, International Computer Science Institute, Berkeley, CA, 1993."},{"key":"211545_CR23","unstructured":"T.A. Plate, \u201cHolographic reduced representations,\u201d in Proceedings of the International Joint Conference on Artificial Intelligence, pp. 30-35, 1991."},{"key":"211545_CR24","unstructured":"Y. Kalinke, \u201cUsing connectionist term representation for first-order deduction-A critical view,\u201d in Connectionist Systems for Knowledge Representation Deduction, edited by F. Maire, R. Hayward, and J. Diederich, Queensland University of Technology, 1997."},{"issue":"6","key":"211545_CR25","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0893-9659(91)90080-F","volume":"4","author":"H. Siegelmann","year":"1991","unstructured":"H. Siegelmann and E.D. Sontag, \u201cTuring computability with neural nets,\u201d Applied Mathematics Letters, vol. 4,no. 6, pp. 77-80, 1991.","journal-title":"Applied Mathematics Letters"},{"issue":"1","key":"211545_CR26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0893-6080(95)00086-0","volume":"9","author":"C.W. Omlin","year":"1996","unstructured":"C.W. Omlin and C.L. Giles, \u201cExtraction of rules from discrete-time recurrent neural networks,\u201d Neural Networks, vol. 9,no. 1, pp. 41-52, 1996.","journal-title":"Neural Networks"},{"issue":"6","key":"211545_CR27","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1162\/neco.1996.8.6.1135","volume":"8","author":"M. Casey","year":"1996","unstructured":"M. Casey, \u201cThe dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction,\u201d Neural Computation, vol. 8,no. 6, pp. 1135-1178, 1996.","journal-title":"Neural Computation"},{"issue":"2","key":"211545_CR28","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1145\/103516.103523","volume":"38","author":"N. Alon","year":"1991","unstructured":"N. Alon, A. Dewdney, and T. Ott, \u201cEfficient simulation of finite automata by neural nets,\u201d Journal of the Association for Computing Machinery, vol. 38,no. 2, pp. 495-514, 1991.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"6","key":"211545_CR29","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1145\/235809.235811","volume":"45","author":"C.W. Omlin","year":"1996","unstructured":"C.W. Omlin and C.L. Giles, \u201cConstructing deterministic finite-state automata in recurrent neural networks,\u201d Journal of the ACM, vol. 45,no. 6, pp. 937-972, 1996.","journal-title":"Journal of the ACM"},{"key":"211545_CR30","first-page":"309","volume-title":"Neural Information Processing Systems 4","author":"R.L. Watrous","year":"1992","unstructured":"R.L. Watrous and G. Kuhn, \u201cInduction of finite-state automata using second-order recurrent networks,\u201d in Neural Information Processing Systems 4, edited by J.E. Moody et al., Morgan Kaufmann: San Mateo, CA, pp. 309-316, 1992."},{"issue":"3","key":"211545_CR31","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1162\/neco.1992.4.3.393","volume":"4","author":"C.L. Giles","year":"1992","unstructured":"C.L. Giles, C. Miller, G.Z. Sun, H.H. Chen, Y.C. Lee, and D. Chen, \u201cLearning and extracting finite state automata with second-order recurrent neural networks,\u201d Neural Computation, vol. 4,no. 3, pp. 393-405, 1992.","journal-title":"Neural Computation"},{"key":"211545_CR32","first-page":"5","volume":"23","author":"P. Frasconi","year":"1996","unstructured":"P. Frasconi, M. Gori, M. Maggini, and G. Soda, \u201cRepresentation of finite state automata in recurrent radial basis function networks,\u201d Machine Learning, vol. 23, pp. 5-32, 1996.","journal-title":"Machine Learning"},{"key":"211545_CR33","unstructured":"J.F. Kolen, \u201cExploring the computational capabilities of recurrent neural networks,\u201d Ph.D. Thesis, Ohio State University, 1994."},{"key":"211545_CR34","doi-asserted-by":"crossref","unstructured":"Y. Kalinke and H. Lehmann, \u201cComputation in recurrent neural networks: From counters to iterated function systems,\u201d in Advanced Topics in Artificial Intelligence, edited by G. Antoniou and J. Slaney, LNAI 1502, Springer-Verlag, 1998.","DOI":"10.1007\/BFb0095051"},{"issue":"3","key":"211545_CR35","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0893-6080(96)00105-0","volume":"10","author":"A. Sperduti","year":"1997","unstructured":"A. Sperduti, \u201cOn the computational power of recurrent neural networks,\u201d Neural Networks, vol. 10,no. 3, pp. 395-400, 1997.","journal-title":"Neural Networks"},{"key":"211545_CR36","first-page":"612","volume-title":"Advances in Neural Information Processing Systems 8","author":"S.C. Kremer","year":"1996","unstructured":"S.C. Kremer, \u201cFinite state automata that recurrent cascade-corelation cannot represent,\u201d in Advances in Neural Information Processing Systems 8, edited by D.S. Touretzky et al., MIT Press: Cambridge, MA, pp. 612-618, 1996."},{"key":"211545_CR37","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0893-6080(89)90003-8","volume":"2","author":"K.-I. Funahashi","year":"1989","unstructured":"K.-I. Funahashi, \u201cOn the approximate realization of continuous mappings by neural networks,\u201d Neural Networks, vol. 2, pp. 183-192, 1989.","journal-title":"Neural Networks"},{"key":"211545_CR38","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K. Hornik","year":"1989","unstructured":"K. Hornik, M. Stinchcombe, and H. White, \u201cMultilayer feedforward networks are universal approximators,\u201d Neuronal Networks, vol. 2, pp. 359-366, 1989.","journal-title":"Neuronal Networks"},{"key":"211545_CR39","unstructured":"S. Willard, General Topology, Addison-Wesley, 1970."},{"issue":"1","key":"211545_CR40","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0304-3975(91)90005-M","volume":"86","author":"L. Cavedon","year":"1991","unstructured":"L. Cavedon, \u201cAcyclic programs and the completeness of SLDNF-resolution,\u201d Theoretical Computer Science, vol. 86,no. 1, pp. 81-92, 1991.","journal-title":"Theoretical Computer Science"},{"key":"211545_CR41","first-page":"617","volume-title":"Proceedings of the Seventh International Conference","author":"K.R. Apt","year":"1990","unstructured":"K.R. Apt and M. Bezem, \u201cAcyclic programs,\u201d Logic Programming, in Proceedings of the Seventh International Conference, edited by D.H.D. Warren and P. Szeredi, MIT Press: Jerusalem, Israel, pp. 617-633, June 1990."},{"issue":"s.3\/4","key":"211545_CR42","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF03037168","volume":"9","author":"K.R. Apt","year":"1991","unstructured":"K.R. Apt and M. Bezem, \u201cAcyclic programs,\u201d New Generation Computing, vol. 9,nos. 3\/4, pp. 335-363, 1991.","journal-title":"New Generation Computing"},{"key":"211545_CR43","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/B978-0-934613-40-8.50009-9","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T.C. Przymusinski","year":"1988","unstructured":"T.C. Przymusinski, \u201cOn the declarative semantics of deductive databases and logic programs,\u201d in Foundations of Deductive Databases and Logic Programming, edited by J. Minker, Morgan Kaufmann Publishers Inc.: Los Altos, pp. 193-216, 1988."},{"key":"211545_CR44","series-title":"Topology Proceedings","first-page":"427","volume-title":"Proceedings of the Twelveth Summer Conference on General Topology and its Applications: Special Session on Topology in Computer Science","author":"A.K. Seda","year":"1997","unstructured":"A.K. Seda and P. Hitzler, \u201cTopology and iterates in computational logic,\u201d Topology Proceedings, in Proceedings of the Twelveth Summer Conference on General Topology and its Applications: Special Session on Topology in Computer Science, Annals of the New York Academy of Sciences, Ontario, Aug. 1997, Topology Proceedings 22 (1999), pp. 427-429."},{"key":"211545_CR45","doi-asserted-by":"crossref","unstructured":"A.K. Seda and P. Hitzler, \u201cStrictly level-decreasing logic programs, in Proceedings of the Second Irish Workshop on Formal Methods, edited by A. Butterfield and S. Flynn, Electronic Workshops in Computing, Springer-Verlag, 1998, to appear.","DOI":"10.14236\/ewic\/FM1998.12"},{"key":"211545_CR46","unstructured":"T.A. Plate, \u201cDistributed representations and nested compositional structure,\u201d Ph.D. Thesis, Department of Computer Science, University of Toronto, 1994."},{"key":"211545_CR47","unstructured":"S.-E. Bornscheuer, \u201cGenerating rational models,\u201d in Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), edited by M. Maher, MIT Press, p. 547, 1996."},{"key":"211545_CR48","first-page":"293","volume-title":"Logic and Databases","author":"K.L. Clark","year":"1978","unstructured":"K.L. Clark, \u201cNegation as failure,\u201d in Logic and Databases, edited by H. Gallaire and J. Minker, Plenum: New York, NY, pp. 293-322, 1978."},{"issue":"20","key":"211545_CR49","first-page":"635","volume":"19","author":"Devienne","year":"1994","unstructured":"Devienne and P. Leb\u00e9gue, A. Parrain, J. C. Routier, and J. W\u00fcrz, \u201cSmallest Horn Clause Programs,\u201d Journal of Logic Programming, vol. 19,no. 20, pp. 635-679, 1994.","journal-title":"Journal of Logic Programming"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008376514077.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008376514077\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008376514077.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:50:40Z","timestamp":1747579840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008376514077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["211545"],"URL":"https:\/\/doi.org\/10.1023\/a:1008376514077","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}