Logic programs and connectionist networks

[1]  Krysia Broda,et al.  Neural-symbolic learning systems - foundations and applications , 2012, Perspectives in neural computing.

[2]  Philipp Slusallek,et al.  Introduction to real-time ray tracing , 2005, SIGGRAPH Courses.

[3]  Pascal Hitzler,et al.  Logic programs, iterated function systems, and recurrent radial basis function networks , 2004, J. Appl. Log..

[4]  Pascal Hitzler,et al.  Continuity of Semantic Operators in Logic Programming and Their Approximation by Artificial Neural Networks , 2003, KI.

[5]  Pascal Hitzler,et al.  Generalized metrics and uniquely determined logic programs , 2003, Theor. Comput. Sci..

[6]  A.S. d'Avila Garcez,et al.  A connectionist inductive learning system for modal logic programming , 2002, Proceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02..

[7]  Melvin Fitting,et al.  Fixpoint Semantics for Logic Programming a Survey , 2001, Theor. Comput. Sci..

[8]  Pascal Hitzler,et al.  A Note on the Relationships Between Logic Programs and Neural Networks , 2000, IWFM.

[9]  Pascal Hitzler,et al.  Characterizations of Classes of Programs by Three-Valued Operators , 1999, LPNMR.

[10]  Steffen Hölldobler,et al.  Approximating the Semantics of Logic Programs by Recurrent Neural Networks , 1999, Applied Intelligence.

[11]  Artur S. d'Avila Garcez,et al.  The Connectionist Inductive Learning and Logic Programming System , 1999, Applied Intelligence.

[12]  Steffen Hölldobler,et al.  A Recursive Neural Network for Reflexive Reasoning , 1998, Hybrid Neural Systems.

[13]  A. Seda.  Topology And The Semantics Of Logic Programs , 1995 .

[14]  Joachim Diederich,et al.  Survey and critique of techniques for extracting rules from trained artificial neural networks , 1995, Knowl. Based Syst..

[15]  Tony A. Plate,et al.  Holographic reduced representations , 1995, IEEE Trans. Neural Networks.

[16]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[17]  Melvin Fitting,et al.  Metric Methods Three Examples and a Theorem , 1994, J. Log. Program..

[18]  Jude W. Shavlik,et al.  Knowledge-Based Artificial Neural Networks , 1994, Artif. Intell..

[19]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[20]  Dino Pedreschi,et al.  Reasoning about Termination of Pure Prolog Programs , 1993, Inf. Comput..

[21]  L. Shastri,et al.  From simple associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony , 1993, Behavioral and Brain Sciences.

[22]  S. Ginsburg,et al.  Acyclic logic programs and the completeness of SLDNF-resolution , 1991 .

[23]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[24]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[25]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[26]  Maria Grazia Scutellà,et al.  A Note on Dowling and Gallier's Top-Down Algorithm for Propositional Horn Satisfiability , 1990, J. Log. Program..

[27]  Kurt Hornik,et al.  Multilayer feedforward networks are universal approximators , 1989, Neural Networks.

[28]  W. Freeman.  Second Commentary: On the proper treatment of connectionism by Paul Smolensky (1988) - Neuromachismo Rekindled , 1989 .

[29]  Ken-ichi Funahashi,et al.  On the approximate realization of continuous mappings by neural networks , 1989, Neural Networks.

[30]  S. Pinker,et al.  Connections and symbols , 1988 .

[31]  J. Fodor,et al.  Connectionism and cognitive architecture: A critical analysis , 1988, Cognition.

[32]  John McCarthy,et al.  Epistemological challenges for connectionism , 1988, Behavioral and Brain Sciences.

[33]  P. Smolensky.  On the proper treatment of connectionism , 1988, Behavioral and Brain Sciences.

[34]  Geoffrey E. Hinton,et al.  Learning internal representations by error propagation , 1986 .

[35]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[36]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[37]  Allen Newell,et al.  Physical Symbol Systems , 1980, Cogn. Sci..

[38]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[39]  P. Nowosad.  The elements of integration , 1971 .

[40]  Frank Rosenblatt,et al.  PRINCIPLES OF NEURODYNAMICS. PERCEPTRONS AND THE THEORY OF BRAIN MECHANISMS , 1963 .

[41]  G. P. Zarri,et al.  Lecture Notes in Artificial Intelligence , 2005 .

[42]  P. Hitzler,et al.  Semantic Operators and Fixed-Point Theory in Logic Programming , 2001 .

[43]  Krysia Broda,et al.  Symbolic knowledge extraction from trained neural networks: A sound approach , 2001, Artif. Intell..

[44]  P. Hitzler.  Generalized Metrics and Topology in Logic Programming Semantics , 2001 .

[45]  P. Hitzler,et al.  A "Converse" of the Banach Contraction Mapping Theorem , 2001 .

[46]  Yvonne McIntyre,et al.  Modellgenerierung mit konnektionistischen Systemen , 2000 .

[47]  Jack Minker,et al.  Logic-Based Artificial Intelligence , 2000 .

[48]  Steffen Hölldobler,et al.  Towards a New Massively Parallel Computational Model for Logic Programming , 1994 .

[49]  Steffen Hölldobler,et al.  Automated Inferencing and Connectionist Models , 1993 .

[50]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[51]  Marc Bezem,et al.  Characterizing Termination of Logic Programs with Level Mappings , 1989, NACLP.

[52]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[53]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[54]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.