The complexity of nested counterfactuals and iterated knowledge base revisions

DOI10.1006/JCSS.1996.0083MaRDI QIDQ676453zbMATH OpenOpenAlexFDO

Authors Thomas Eiter, Georg Gottlob

Publication date 20 August 1997

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/39a339dc34919b2631f1400edbf96f6dbe1a876c

zbMATH Keywords

nested counterfactualspropositional knowledge base

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Fast algorithms for revision of some special propositional knowledge bases
• Updates and counterfactuals
• scientific article; zbMATH DE number 140392
• scientific article; zbMATH DE number 1487808

Cited in

(9)

• A solver for QBFs in negation normal form
• Preference-based belief revision for rule-based agents
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• The size of a revised knowledge base
• Belief revision within fragments of propositional logic
• Belief merging by examples
• Mixed Iterated Revisions: Rationale, Algorithms, and Complexity
• Knowledgebase transformations
• Natural revision is contingently-conditionalized revision

This page was built for publication: The complexity of nested counterfactuals and iterated knowledge base revisions

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