Cited in
(only showing first 100 items - show all)- DeepCoder
- Iterative learning of answer set programs from context dependent examples
- ILP :- Just Trie It
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
- The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
- Learning higher-order logic programs
- Advances in integrative statistics for logic programming
- kLog: a language for logical and relational learning with kernels
- An investigation into feature construction to assist word sense disambiguation
- FOLD-R++: a scalable toolset for automated inductive learning of default theories from mixed data
- Introducing possibilistic logic in ILP for dealing with exceptions
- Learning to rank the distinctiveness of behaviour in serial offending
- Subsumer: a Prolog \(\theta\)-subsumption engine
- Using the bottom clause and mode declarations in FOL theory revision from examples
- Ultra-strong machine learning: comprehensibility of programs learned with ILP
- Louise
- SOLAR
- SeqLog
- TopLog
- FOIL-D
- FORS
- ProbLog
- PITA
- YAP-Prolog
- FACTORIE
- kLog
- Pengines
- ProDiGe
- SPOOK
- PolyFARM
- MYDDAS
- ProGolem
- Subsumer
- CDK
- On the use of stochastic local search techniques to revise first-order logic theories from examples
- GAP
- SWI-Prolog
- cplint
- proSQLite
- MCINTYRE
- kFOIL
- Bio2RDF
- FOIL
- GOLEM
- plml
- Real
- April
- Orange4WS
- GDL
- Biomine
- Fr-ONT
- NCDawareRank
- NetSDM
- PL-ranking
- SegMine
- SEGS
- Senseval
- Wikibase
- The complexity and generality of learning answer set programs
- TerpreT
- PIDoc
- VICKEY
- Metagol
- Metaopt
- Nonmonotonic abductive inductive learning
- REVEAL
- FactorBase
- Fast theta-subsumption with constraint satisfaction algorithms
- TotemBioNet
- First order random forests: Learning relational classifiers with complex aggregates
- Learning from positive and unlabeled data: a survey
- An empirical study of on-line models for relational data streams
- nFOIL
- FOLD-R++
- QuickFOIL
- sCASP
- ProGolem: a system based on relative minimal generalisation
- Lifted graphical models: a survey
- Formulating the template ILP consistency problem as a constraint satisfaction problem
- NetSDM: semantic data mining with network analysis
- Explaining mixture models through semantic pattern mining and banded matrix visualization
- Consensus-based modeling using distributed feature construction with ILP
- Gradient-based boosting for statistical relational learning: the relational dependency network case
- Data and task parallelism in ILP using mapreduce
- Parallel ILP for distributed-memory architectures
- TopLog: ILP Using a Logic Program Declarative Bias
- Logical explanations for deep relational machines using relevance information
- Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
- Learning goal hierarchies from structured observations and expert annotations
- Quantitative pharmacophore models with inductive logic programming
- White-box induction from SVM models: explainable AI with logic programming
- Automated generation of control concepts annotation rules using inductive logic programming. System description
- Lifting symmetry breaking constraints with inductive logic programming
- Learning programs by learning from failures
- Induction and exploitation of subgoal automata for reinforcement learning
- FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data
- Constructing generative logical models for optimisation problems using domain knowledge
- Using SWISH to realize interactive web-based tutorials for logic-based languages
- Lifted discriminative learning of probabilistic logic programs
- Inductive general game playing
This page was built for software: Aleph
