Logic programs and connectionist networks
From MaRDI portal
Publication:1884268
DOI10.1016/j.jal.2004.03.002zbMath1072.68090OpenAlexW2082296752MaRDI QIDQ1884268
Steffen Hölldobler, Anthony Karel Seda, Pascal Hitzler
Publication date: 28 October 2004
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://corescholar.libraries.wright.edu/cse/172
Related Items (9)
An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases ⋮ Learning from interpretation transition using differentiable logic programming semantics ⋮ Logic programs, iterated function systems, and recurrent radial basis function networks ⋮ Neuro-symbolic artificial intelligence ⋮ Bridging logic and kernel machines ⋮ Semantic-based regularization for learning and inference ⋮ Symbolic Knowledge Extraction from Trained Neural Networks Governed by Łukasiewicz Logics ⋮ Improving inductive logic programming by using simulated annealing ⋮ Logic and Complexity in Cognitive Science
Cites Work
- Acyclic logic programs and the completeness of SLDNF-resolution
- Complete problems for deterministic polynomial time
- Reasoning about termination of pure Prolog programs
- Knowledge-based artificial neural networks
- Generalized metrics and uniquely determined logic programs.
- Fixpoint semantics for logic programming a survey
- Multilayer feedforward networks are universal approximators
- Logic programs, iterated function systems, and recurrent radial basis function networks
- A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
- A kripke-kleene semantics for logic programs*
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- The well-founded semantics for general logic programs
- Metric Methods Three Examples and a Theorem
- KI 2003: Advances in Artificial Intelligence
- Symbolic knowledge extraction from trained neural networks: A sound approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Logic programs and connectionist networks