Difficulties in Forcing Fairness of Polynomial Time Inductive Inference

DOI10.1007/978-3-642-04414-4_23MaRDI QIDQ3648757zbMATH OpenOpenAlexFDO

Authors Timo Kötzing, John Case

Publication date 1 December 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-04414-4_23

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• On fairness of completion-based theorem proving strategies
• scientific article; zbMATH DE number 512823
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 3935022
• On the complexity of inductive inference
• scientific article; zbMATH DE number 1960352
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• scientific article; zbMATH DE number 2117131
• On complete primitives for fairness
• scientific article; zbMATH DE number 7064055

Cites work

• Dynamic Modeling in Inductive Inference
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• scientific article; zbMATH DE number 1142308 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning correction grammars
• Learning efficiency of very simple grammars from positive data
• Program size complexity of correction grammars in the Ershov hierarchy
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• Toward a mathematical theory of inductive inference

Cited in

(10)

• Automatic learning from positive data and negative counterexamples
• On the role of update constraints and text-types in iterative learning
• Revisiting Shinohara's algorithm for computing descriptive patterns
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• On fairness of completion-based theorem proving strategies
• Learners based on transducers
• Partial learning of recursively enumerable languages
• Topological separations in inductive inference
• Learnability and positive equivalence relations
• Learning in the limit with lattice-structured hypothesis spaces

This page was built for publication: Difficulties in Forcing Fairness of Polynomial Time Inductive Inference

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