Foundations of inductive logic programming

DOI10.1007/3-540-62927-0zbMath1293.68014OpenAlexW2169042011MaRDI QIDQ1356228

Shan-Hwei Nienhuys-Cheng, Ronald de Wolf

Publication date: 4 June 1997

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

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17)

Related Items (56)

Learning elementary formal systems with queries. ⋮ Learning power and language expressiveness. ⋮ Universal Horn Sentences and the Joint Embedding Property ⋮ Inductive logic programming at 30 ⋮ A New Algorithm for Computing Least Generalization of a Set of Atoms ⋮ Consensus-based modeling using distributed feature construction with ILP ⋮ GAMoN: discovering \(M\)-of-\(N^{\{\neg, \lor\}}\) hypotheses for text classification by a lattice-based genetic algorithm ⋮ Improving expressivity of inductive logic programming by learning different kinds of fuzzy rules ⋮ Computing Abstract Distances in Logic Programs ⋮ Learning logic programs by explaining their failures ⋮ On the non-efficient PAC learnability of conjunctive queries ⋮ Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited ⋮ Bandit-based Monte-Carlo structure learning of probabilistic logic programs ⋮ Maximal closed set and half-space separations in finite closure systems ⋮ Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming ⋮ Inductive equivalence in clausal logic and nonmonotonic logic programming ⋮ Block-wise construction of tree-like relational features with monotone reducibility and redundancy ⋮ Learning efficient logic programs ⋮ \(\alpha\)ILP: thinking visual scenes as differentiable logic programs ⋮ Logical reduction of metarules ⋮ Reference classes and relational learning ⋮ ILP turns 20. Biography and future challenges ⋮ Inverse subsumption for complete explanatory induction ⋮ The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause ⋮ Using the bottom clause and mode declarations in FOL theory revision from examples ⋮ An investigation into feature construction to assist word sense disambiguation ⋮ Concept learning in description logics using refinement operators ⋮ Brave Induction ⋮ Inductive Logic Programming: Issues, results and the challenge of Learning Language in Logic ⋮ Mining closed patterns in relational, graph and network data ⋮ Improving inductive logic programming by using simulated annealing ⋮ Meta-interpretive learning: application to grammatical inference ⋮ The role of semantics in mining frequent patterns from knowledge bases in description logics with rules ⋮ Inductive Logic Programming in Databases: From <scp>Datalog</scp> to ⋮ Nonmonotonicity in the framework of parametric logic ⋮ Learning logic programs with structured background knowledge ⋮ Ordering default theories and nonmonotonic logic programs ⋮ Inductive Negotiation in Answer Set Programming ⋮ Induction of Optimal Semantic Semi-distances for Clausal Knowledge Bases ⋮ A Refinement Operator Based Learning Algorithm for the $\mathcal{ALC}$ Description Logic ⋮ Foundations of Refinement Operators for Description Logics ⋮ Using ILP to Construct Features for Information Extraction from Semi-structured Text ⋮ On Generalization and Subsumption for Ordered Clauses ⋮ Parallel algorithms for enumerating closed patterns from multi-relational data ⋮ Top program construction and reduction for polynomial time meta-interpretive learning ⋮ Learning programs by learning from failures ⋮ Learning Inference by Induction ⋮ Toward effective knowledge acquisition with first-order logic induction. ⋮ Learning closed Horn expressions ⋮ Unnamed Item ⋮ The subsumption lattice and query learning ⋮ Learning explanations for biological feedback with delays using an event calculus ⋮ Meta-interpretive learning as metarule specialisation ⋮ Lifted model checking for relational MDPs ⋮ Mind change complexity of learning logic programs ⋮ Unifying logic, topology and learning in parametric logic

This page was built for publication: Foundations of inductive logic programming