Sciweavers

32 search results - page 4 / 7
» Taming the Complexity of Inductive Logic Programming
Sort
View
CSL
2007
Springer
15 years 3 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
82
Voted
CADE
2008
Springer
15 years 9 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
ECAI
2010
Springer
14 years 10 months ago
Event Model Learning from Complex Videos using ILP
Abstract. Learning event models from videos has applications ranging from abnormal event detection to content based video retrieval. Relational learning techniques such as Inductiv...
Krishna S. R. Dubba, Anthony G. Cohn, David C. Hog...
68
Voted
ECAI
2000
Springer
15 years 1 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
15 years 2 months ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...