The complexity of theory revision
DOI10.1016/S0004-3702(98)00107-6zbMATH Open0996.68068WikidataQ127526104 ScholiaQ127526104MaRDI QIDQ1606294FDOQ1606294
Authors: Russell Greiner 
Publication date: 24 July 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learnability and the Vapnik-Chervonenkis dimension
- On the logic of theory change: Partial meet contraction and revision functions
- Polynomial-time inference of all valid implications for Horn and related formulae
- Knowledge in flux. Modeling the dynamics of epistemic states
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Title not available (Why is that?)
- A general lower bound on the number of examples needed for learning
- Title not available (Why is that?)
- Results on learnability and the Vapnik-Chervonenkis dimension
- On the hardness of approximating minimization problems
- Completeness in approximation classes
- Structure identification in relational data
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Belief revision: A critique
- Title not available (Why is that?)
- Foundations of a functional approach to knowledge representation
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Horn approximations of empirical data
- Theory refinement combining analytical and empirical methods
- The complexity of revising logic programs
- Title not available (Why is that?)
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- Abductive explanation-based learning: A solution to the multiple inconsistent explanation problem
- Title not available (Why is that?)
- The refinement of probabilistic rule sets: Sociopathic interactions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pac-learning non-recursive Prolog clauses
- Refinement of uncertain rule bases via reduction
Cited In (9)
- Maximizing theory accuracy through selective reinterpretation
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- Bayesian knowledge base tuning
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Theory revision with queries: Horn, read-once, and parity formulas
Uses Software
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)
