2152 search results - page 247 / 431 » On Automating the Calculus of Relations |
199
click to vote
ILP
2007
Springer
16 years 18 days ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
148
click to vote
SEMWEB
2007
Springer
16 years 17 days ago
2007
Springer
Since engineered systems, e.g. aviation control, have increasingly equipped with automated and computer-supported artifacts, human-system interaction has been an important issue. U...
164
click to vote
IMSCCS
2006
IEEE
16 years 14 days ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
136
click to vote
LICS
2006
IEEE
16 years 14 days ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
177
click to vote
ILP
2005
Springer
15 years 12 months ago
2005
Springer
We propose a new approach to Inductive Logic Programming that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computati...