Sciweavers

265 search results - page 40 / 53
» Weakly Algebraizable Logics
Sort
View
COLT
1994
Springer
14 years 21 days ago
Bayesian Inductive Logic Programming
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
Stephen Muggleton
AAI
2010
108views more  AAI 2010»
13 years 8 months ago
Augmenting Subsumption Propagation in Distributed Description Logics
Distributed Description Logics (DDL) enable reasoning with multiple ontologies interconnected by directional semantic mapping, called bridge rules. Bridge rules map concepts of a s...
Martin Homola, Luciano Serafini
CORR
2004
Springer
137views Education» more  CORR 2004»
13 years 8 months ago
Implementation of Logical Functions in the Game of Life
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
Jean-Philippe Rennard
LICS
1991
IEEE
14 years 3 days ago
Defaults and Revision in Structured Theories
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...
Mark Ryan
EMSOFT
2008
Springer
13 years 10 months ago
Disassembling real-time fault-tolerant programs
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Anish Ar...