The complexity of nested counterfactuals and iterated knowledge base revisions

DOI10.1006/JCSS.1996.0083zbMath0869.68045OpenAlexW2014613778MaRDI QIDQ676453

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)

Related Items (7)

Belief Merging by Examples ⋮ Belief revision within fragments of propositional logic ⋮ Mixed Iterated Revisions: Rationale, Algorithms, and Complexity ⋮ The size of a revised knowledge base ⋮ Knowledgebase transformations ⋮ A solver for QBFs in negation normal form ⋮ Preference-based belief revision for rule-based agents

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