Fast theta-subsumption with constraint satisfaction algorithms

DOI10.1023/B:MACH.0000023150.80092.40zbMath1089.68103OpenAlexW2087757633MaRDI QIDQ5894895

Jérôme Maloberti, Michèle Sebag

Publication date: 19 January 2005

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:mach.0000023150.80092.40

zbMATH Keywords

phase transitionconstraint satisfactionmeta-learning\(k\)-localityRelational learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Formulating the template ILP consistency problem as a constraint satisfaction problem ⋮ Incremental learning of event definitions with inductive logic programming ⋮ Subsumption Algorithms for Three-Valued Geometric Resolution

Uses Software

• UCI-ml
• Aleph

This page was built for publication: Fast theta-subsumption with constraint satisfaction algorithms