Sciweavers

746 search results - page 1 / 150
» Connectionist Propositional Logic
Sort
View
NEUROSCIENCE
2001
Springer
13 years 9 months ago
Connectionist Propositional Logic
Daniel Kustrin, Jim Austin
IJCAI
2007
13 years 5 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
AIA
2006
13 years 5 months ago
Computational Model of Speech Understanding
This paper proposes a speech comprehension computational model based on neurocognitiveresearches. The computational representation uses techniques as wavelets transform and connec...
Daniel Nehme Müller, Philippe Olivier Alexand...
ICFP
2012
ACM
11 years 6 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
PLPV
2012
ACM
12 years 1 days ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey