The complexity of theory revision

This publication has 22 references indexed in Scilit:

• Pac-learning non-recursive prolog clauses
  Artificial Intelligence, 1995
• Pac-learning Recursive Logic Programs: Negative Results
  Journal of Artificial Intelligence Research, 1995
• Structure identification in relational data
  Artificial Intelligence, 1992
• Abductive explanation-based learning: A solution to the multiple inconsistent explanation problem
  Machine Learning, 1992
• Completeness in approximation classes
  Information and Computation, 1991
• Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services
  Artificial Intelligence, 1991
• Polynomial-time inference of all valid implications for Horn and related formulae
  Annals of Mathematics and Artificial Intelligence, 1990
• Learnability and the Vapnik-Chervonenkis dimension
  Journal of the ACM, 1989
• On the logic of theory change: Partial meet contraction and revision functions
  The Journal of Symbolic Logic, 1985
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
  The Annals of Mathematical Statistics, 1952