Absolute versus probabilistic classification in a logical setting

[1]  Patrick Caldon,et al.  Limiting Resolution: From Foundations to Implementation , 2004, ICLP.

[2]  Arun Sharma,et al.  Learning, Logic, and Topology in a Common Framework , 2002, ALT.

[3]  Izumi Takeuti The measure of an omega regular language is rational (Algebraic Semigroups, Formal Languages and Computation) , 2001 .

[4]  Andris Ambainis,et al.  Probabilistic inductive inference: a survey , 1999, Theor. Comput. Sci..

[5]  Stuart A. Kurtz,et al.  On the Relative Sizes of Learnable Sets , 1998, Theor. Comput. Sci..

[6]  Carl H. Smith,et al.  Learning Formulae from Elementary Facts , 1997, EuroCOLT.

[7]  Léa Meyer,et al.  Probabilistic Language Learning Under Monotonicity Constraints , 1995, Theor. Comput. Sci..

[8]  Frank Stephan,et al.  Urban Classification Using Full Spectral Information of Landsat ETM Imagery in Marion County , Indiana , 2005 .

[9]  Shai Ben-David,et al.  Can Finite Samples Detect Singularities of Real-Valued Functions? , 1992, STOC '92.

[10]  Andrei Voronkov,et al.  Logic Programming with Bounded Quantifiers , 1990, RCLP.

[11]  Leonard Pitt,et al.  Probabilistic inductive inference , 1989, JACM.

[12]  Carl H. Smith,et al.  Probability and Plurality for Aggregations of Learning Machines , 1987, Inf. Comput..

[13]  Robert P. Daley Inductive inference hierarchies: probabilistic vs pluralistic strategies , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

[14]  Carl H. Smith,et al.  The Power of Pluralism for Automatic Program Synthesis , 1982, JACM.

[15]  Manuel Blum,et al.  Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[16]  Jr. Hartley Rogers Theory of Recursive Functions and Effective Computability , 1969 .

[17]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[18]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[19]  R. McNaughton Review: J. Richard Buchi, Weak Second-Order Arithmetic and Finite Automata; J. Richard Buchi, On a Decision Method in Restricted second Order Arithmetic , 1963, Journal of Symbolic Logic.

[20]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[21]  S. Sieber On a decision method in restricted second-order arithmetic , 1960 .