Theory refinement combining analytical and empirical methods

DOI10.1016/0004-3702(94)90028-0zbMath0807.68089OpenAlexW2165520550MaRDI QIDQ1327162

Raymond J. Mooney, Dirk Ourston

Publication date: 1 March 1995

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90028-0

zbMATH Keywords

knowledge basepropositional Horn-clause domain theory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Related Items (8)

Knowledge-based artificial neural networks ⋮ Revising threshold functions ⋮ PALO: a probabilistic hill-climbing algorithm ⋮ Structure learning of probabilistic logic programs by searching the clause space ⋮ A fuzzy theory refinement algorithm ⋮ Markov logic networks ⋮ The complexity of theory revision ⋮ Theory revision with queries: Horn, read-once, and parity formulas

Cites Work

• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Approximation algorithms for combinatorial problems
• A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theory refinement combining analytical and empirical methods