The size of a revised knowledge base

DOI10.1016/S0004-3702(99)00074-0zbMATH Open0939.68853OpenAlexW2088635442WikidataQ58006970 ScholiaQ58006970MaRDI QIDQ1978467FDOQ1978467

Marco Cadoli, Marco Schaerf, F. M. Donini, Paolo Liberatore

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(99)00074-0

Recommendations

• Compilability and compact representations of revision of Horn knowledge bases
• scientific article; zbMATH DE number 108002
• scientific article; zbMATH DE number 1500518
• scientific article; zbMATH DE number 2140435
• On the complexity of propositional knowledge base revision, updates, and counterfactuals

zbMATH Keywords

computational complexitybelief revisioncompactability

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cites Work

• Title not available (Why is that?)
• On the logic of theory change: Partial meet contraction and revision functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some consequences of non-uniform conditions on uniform classes
• Update semantics of relational views
• Title not available (Why is that?)
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Title not available (Why is that?)
• The complexity of nested counterfactuals and iterated knowledge base revisions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On compact representations of propositional circumscription
• Counterfactuals

Cited In (17)

• Is intractability of nonmonotonic reasoning a real drawback?
• Reducing belief revision to circumscription (and vice versa)
• First-order logical filtering
• Disjunctive merging: quota and Gmin merging operators
• Title not available (Why is that?)
• The complexity of belief update
• On compact representations of propositional circumscription
• DL-Lite Ontology Revision Based on An Alternative Semantic Characterization
• Belief Revision with Bounded Treewidth
• Redundancy in logic. I: CNF propositional formulae
• Title not available (Why is that?)
• On the succinctness of some modal logics
• Foundations of instance level updates in expressive description logics
• Preprocessing of intractable problems
• Common equivalence and size of forgetting from Horn formulae
• Instance-Level Update in DL-Lite Ontologies through First-Order Rewriting
• Compiling propositional weighted bases

This page was built for publication: The size of a revised knowledge base

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978467)