The size of a revised knowledge base

DOI10.1016/S0004-3702(99)00074-0zbMath0939.68853OpenAlexW2088635442WikidataQ58006970 ScholiaQ58006970MaRDI QIDQ1978467

Marco Cadoli, Marco Schaerf, Francesco 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

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)

Related Items (13)

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

Cites Work

• The complexity of nested counterfactuals and iterated knowledge base revisions
• Some consequences of non-uniform conditions on uniform classes
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• On compact representations of propositional circumscription
• On the logic of theory change: Partial meet contraction and revision functions
• Update semantics of relational views
• Counterfactuals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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