Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27) Complexity of computation (including implicit computational complexity) (03D15)
Recommendations
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 4166936 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 54155 (Why is no real title available?)
- scientific article; zbMATH DE number 140403 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1149414 (Why is no real title available?)
- scientific article; zbMATH DE number 1149415 (Why is no real title available?)
- scientific article; zbMATH DE number 1149451 (Why is no real title available?)
- scientific article; zbMATH DE number 194625 (Why is no real title available?)
- scientific article; zbMATH DE number 795584 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A general lower bound on the number of examples needed for learning
- Abductive explanation-based learning: A solution to the multiple inconsistent explanation problem
- Belief revision: A critique
- Completeness in approximation classes
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Foundations of a functional approach to knowledge representation
- Horn approximations of empirical data
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- Knowledge in flux. Modeling the dynamics of epistemic states
- Learnability and the Vapnik-Chervonenkis dimension
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- On the hardness of approximating minimization problems
- On the logic of theory change: Partial meet contraction and revision functions
- Pac-learning non-recursive Prolog clauses
- Polynomial-time inference of all valid implications for Horn and related formulae
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Refinement of uncertain rule bases via reduction
- Results on learnability and the Vapnik-Chervonenkis dimension
- Structure identification in relational data
- The complexity of revising logic programs
- The refinement of probabilistic rule sets: Sociopathic interactions
- Theory refinement combining analytical and empirical methods
Cited in
(9)- Maximizing theory accuracy through selective reinterpretation
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- Bayesian knowledge base tuning
- scientific article; zbMATH DE number 140376 (Why is no real title available?)
- More theory revision with queries (extended abstract)
- Removing inconsistencies in assumption-based theories through knowledge-gathering actions
- On the formal characterization of the FORTE\_MBC theory revision operators
- scientific article; zbMATH DE number 2084851 (Why is no real title available?)
- Theory revision with queries: Horn, read-once, and parity formulas
This page was built for publication: The complexity of theory revision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606294)
