A refinement operator for theories

DOI10.1007/3-540-44797-0_1MaRDI QIDQ4796701zbMATH OpenFDO

Authors Liviu Badea

Publication date 3 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44797-0_1

Mathematics Subject Classification ID

Logic programming (68N17) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A Note on Refinement Operators for IE-Based ILP Systems
• scientific article; zbMATH DE number 1015105
• The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
• Completeness and properness of refinement operators in inductive logic programming
• Refining logic theories under OI-implication

Cited in

(9)

• Using the bottom clause and mode declarations in FOL theory revision from examples
• Learning programs by learning from failures
• Improving inductive logic programming by using simulated annealing
• A Note on Refinement Operators for IE-Based ILP Systems
• scientific article; zbMATH DE number 1015105 (Why is no real title available?)
• Macro-operators in multirelational learning: A search-space reduction technique
• A refinement operator for inducing threaded-variable clauses
• Retrenchment and refinement interworking: the tower theorems
• Incremental learning of event definitions with inductive logic programming

This page was built for publication: A refinement operator for theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796701)