Steffen Hölldobler  Home/Search
Context Related
| pikas.inf.tudresden.de/p...wv9903.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pikas.inf.tudresden.de/publik... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Ste en Holldobler Arti cial Intelligence Institute Department of Computer Science Dresden University of Technology D{01062 Dresden Phone: +49-351-463-8340 Fax: +49-351-463-8342 sh@inf.tu-dresden.de Keywords: Logic Programming, Recurrent Connectionist Networks 1 1 Motivation Connectionist systems exhibit many desirable properties of intelligent systems like, for example, being massively parallel, context{sensitive, adaptable and robust (see eg. [7]). It is strongly believed that... (Update)
Similar documents based on text: More All
0.6: Approximating the Semantics of Logic Programs by Recurrent.. - Hölldobler, Störr (1999) (Correct)
0.0: The Mathematical Foundation of Symbolic Trajectory Evaluation - Chou (1999) (Correct)
0.0: BDD-based Reasoning in the Fluent Calculus - First Results - Hölldobler, Störr (Correct)
BibTeX entry: (Update)
Ste#en Holldobler. Challenge problems for the integration of logic and connectionist systems. In Francois Bry, Ulrich Geske, and Dietmar Seipel, editors, Proceedings 14. Workshop Logische Programmierung, volume 90 of GMD Report, pages 161--171. GMD, 2000. http://citeseer.ist.psu.edu/en99challenge.html More
@misc{ en00challenge,
author = "S. en",
title = "Challenge problems for the integration of logic and connectionist systems",
text = "Ste#en Holldobler. Challenge problems for the integration of logic and
connectionist systems. In Francois Bry, Ulrich Geske, and Dietmar Seipel,
editors, Proceedings 14. Workshop Logische Programmierung, volume 90 of
GMD Report, pages 161--171. GMD, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/en99challenge.html" }
Citations (may not include all citations):388 Inductive Logic Programming - Muggleton - 1992
268 Parallel algorithms for shared-memory machines (context) - Karp, Ramachandran - 1990
235 the approximate realization of continuous mappings by neural.. (context) - Funahashi - 1989
198 Connectionism and cognitive architecture: A critical analysi.. - Fodor, Pylyshyn - 1988
144 Contributions to the theory of logic programming (context) - Apt, Van Emden - 1982
106 Connectionist models and their properties (context) - Feldman, Ballard - 1982
69 On matrices with connections (context) - Bibel - 1981
65 Physical symbol systems (context) - Newell - 1980
59 Recent advances in ai planning - Weld - 1999
40 Holographic reduced representations - Plate - 1991
35 Recursive auto-associative memory: Devising compositional di.. (context) - Pollack - 1988
28 A new method for solving hard satisability problems - Selman, Levesque et al. - 1992
26 Propositional non-monotonic reasoning and inconsistency in s.. (context) - Pinkas - 1991
25 Neural networks and physical systems with emergent collectiv.. (context) - Hopeld - 1982
23 From associations to systematic reasoning: A connectionist r.. (context) - Shastri, Ajjanagadde - 1993
[Article contains additional citations not shown here]
Documents on the same site (http://pikas.inf.tu-dresden.de/publikationen/1999/):
The Undecidability of the Entailment Problem in the Fluent and.. - Hölldobler (1999) (Correct)
A Recursive Neural Network for Reflexive Reasoning - Hölldobler, Kalinke, Wunderlich (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC