The child as hacker

JS Rule, JB Tenenbaum, ST Piantadosi - Trends in cognitive sciences, 2020 - cell.com
The scope of human learning and development poses a radical challenge for cognitive
science. We propose that developmental theories can address this challenge by adopting …

Inductive inference: Theory and methods

D Angluin, CH Smith - ACM computing surveys (CSUR), 1983 - dl.acm.org
There has been a great deal of theoretical and experimental work in computer science on
inductive inference systems, that is, systems that try to infer general rules from examples …

[图书][B] 高级人工智能

史忠植, 师昌绪 - 1998 - ecsponline.com
本书共16 章. 第1~ 6 章讨论人工智能的认知问题和逻辑基础, 论述约束推理, 定性推理,
基于范例推理, 概率推理. 第7~ 13 章重点讨论机器学习, 包括归纳学习, 支持向量机, 解释学习 …

[图书][B] Syntax-guided synthesis

R Alur, R Bodik, G Juniwal, MMK Martin… - 2013 - ieeexplore.ieee.org
The classical formulation of the program-synthesis problem is to find a program that meets a
correctness specification given as a logical formula. Recent work on program synthesis and …

A survey on software fault localization

WE Wong, R Gao, Y Li, R Abreu… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
Software fault localization, the act of identifying the locations of faults in a program, is widely
recognized to be one of the most tedious, time consuming, and expensive-yet equally critical …

Statistical relational artificial intelligence: Logic, probability, and computation

LD Raedt, K Kersting, S Natarajan, D Poole - Synthesis lectures on …, 2016 - Springer
An intelligent agent interacting with the real world will encounter individual people, courses,
test results, drugs prescriptions, chairs, boxes, etc., and needs to reason about properties of …

Improving bug localization using structured information retrieval

RK Saha, M Lease, S Khurshid… - 2013 28th IEEE/ACM …, 2013 - ieeexplore.ieee.org
Locating bugs is important, difficult, and expensive, particularly for large-scale systems. To
address this, natural language information retrieval techniques are increasingly being used …

Learning regular sets from queries and counterexamples

D Angluin - Information and computation, 1987 - Elsevier
The problem of identifying an unknown regular set from examples of its members and
nonmembers is addressed. It is assumed that the regular set is presented by a minimally …

Queries and concept learning

D Angluin - Machine learning, 1988 - Springer
We consider the problem of using queries to learn an unknown concept. Several types of
queries are described and studied: membership, equivalence, subset, superset …

[图书][B] Foundations of logic programming

JW Lloyd - 2012 - books.google.com
In the two and a half years since the frrst edition of this book was published, the field of logic
programming has grown rapidly. Consequently, it seemed advisable to try to expand the …