Robust logics

DOI10.1016/S0004-3702(00)00002-3zbMath0941.68107OpenAlexW2914851020MaRDI QIDQ5918074

Leslie G. Valiant

Publication date: 4 June 2000

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00002-3

zbMATH Keywords

robustnesslearningreasoningdeductionPAC learningsoundnesslearning rulesbinding problemlearning relationsPAC semantics

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27)

Related Items

Many-Layered Learning ⋮ An empirical study of on-line models for relational data streams ⋮ Computational Hardness of Validity in Probability Logic ⋮ Revising threshold functions ⋮ Levels of uniformity ⋮ MODEL THEORY OF MEASURE SPACES AND PROBABILITY LOGIC ⋮ Connectionist computations of intuitionistic reasoning ⋮ Partial observability and learnability ⋮ Decidability and Undecidability in Probability Logic ⋮ Learning to Assign Degrees of Belief in Relational Domains ⋮ Learning to assign degrees of belief in relational domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analysis of first-order logics of probability
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant
• A polynomial-time algorithm for learning noisy linear threshold functions
• A general lower bound on the number of examples needed for learning
• Projection learning
• A neuroidal architecture for cognitive computation
• Learning in the Presence of Malicious Errors
• A theory of the learnable
• Computational limitations on learning from examples
• Inductive Logic Programming: Theory and methods
• Learning to reason
• Efficient noise-tolerant learning from statistical queries