Causal learning with Occam's razor

DOI10.1007/s11225-018-9829-1zbMath1477.68135OpenAlexW2890711507WikidataQ129287914 ScholiaQ129287914MaRDI QIDQ2009770

Oliver Schulte

Publication date: 29 November 2019

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-018-9829-1

zbMATH Keywords

Bayesian networkformal learning theorycausal graphmind change boundsprobabilistic clauses

Mathematics Subject Classification ID

Computational learning theory (68Q32) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in the philosophy of science (03A10) Probabilistic graphical models (62H22)

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• The co-discovery of conservation laws and particle families
• Answering queries from context-sensitive probabilistic knowledge bases
• The max-min hill-climbing Bayesian network structure learning algorithm
• Mind change optimal learning of Bayes net structure from dependency and independency data
• Causation, prediction, and search
• Tree induction for probability-based ranking
• Mind change efficient learning
• Knowledge representation and inference in similarity networks and Bayesian multinets
• The Topology of Statistical Verifiability
• 10.1162/153244303321897717
• Trial and error predicates and the solution to a problem of Mostowski
• Language identification in the limit

This page was built for publication: Causal learning with Occam's razor