The size of a revised knowledge base

DOI10.1016/S0004-3702(99)00074-0MaRDI QIDQ1978467zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 44621 (Why is no real title available?)
• scientific article; zbMATH DE number 140403 (Why is no real title available?)
• scientific article; zbMATH DE number 140406 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1142303 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• scientific article; zbMATH DE number 1149451 (Why is no real title available?)
• scientific article; zbMATH DE number 970615 (Why is no real title available?)
• scientific article; zbMATH DE number 4185089 (Why is no real title available?)
• Counterfactuals
• Knowledge in flux. Modeling the dynamics of epistemic states
• On compact representations of propositional circumscription
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• On the logic of theory change: Partial meet contraction and revision functions
• Some consequences of non-uniform conditions on uniform classes
• The complexity of nested counterfactuals and iterated knowledge base revisions
• Update semantics of relational views

Cited in

(20)

• Compilability and compact representations of revision of Horn knowledge bases
• 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
• The complexity of belief update
• scientific article; zbMATH DE number 2140435 (Why is no real title available?)
• On compact representations of propositional circumscription
• Instance-level update in DL-Lite ontologies through first-order rewriting
• Belief Revision with Bounded Treewidth
• An approximate approach to belief revision
• Prime forms and minimal change in propositional belief bases
• Redundancy in logic. I: CNF propositional formulae
• scientific article; zbMATH DE number 1509480 (Why is no real title available?)
• On the succinctness of some modal logics
• Foundations of instance level updates in expressive description logics
• DL-Lite ontology revision based on an alternative semantic characterization
• Preprocessing of intractable problems
• Common equivalence and size of forgetting from Horn formulae
• 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)