Sciweavers

2278 search results - page 106 / 456
» Markov logic networks
Sort
View
196
Voted
IJCAI
2007
15 years 8 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...
TSE
2011
134views more  TSE 2011»
15 years 1 months ago
Verifying the Evolution of Probability Distributions Governed by a DTMC
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
YoungMin Kwon, Gul A. Agha
DATE
2009
IEEE
106views Hardware» more  DATE 2009»
16 years 1 months ago
Debugging of Toffoli networks
—Intensive research is performed to find post-CMOS technologies. A very promising direction based on reversible logic are quantum computers. While in the domain of reversible lo...
Robert Wille, Daniel Große, Stefan Frehse, G...
ICML
2004
IEEE
16 years 7 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
INFOCOM
1990
IEEE
15 years 11 months ago
Fault Tolerance of a Class of Double-Loop Networks
This paper analyzes the fault tolerance of a class of double-loop networks referred to as forwardloop backward-hop FLBH, in which each node is connected via unidirectional links t...
Jon M. Peha, Fouad A. Tobagi