On the decidability and complexity of reasoning about only knowing

DOI10.1016/S0004-3702(99)00083-1zbMath0939.68838WikidataQ64360229 ScholiaQ64360229MaRDI QIDQ1978243

Yanyan Li

Publication date: 4 June 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

computational complexity; knowledge representation; nonmonotonic reasoning; epistemic logics

Mathematics Subject Classification ID

68T30: Knowledge representation

Related Items

Only knowing with degrees of confidence

Cites Work

• Foundations of a functional approach to knowledge representation
• Semantical considerations on nonmonotonic logic
• A guide to completeness and complexity for modal logics of knowledge and belief
• Reasoning about minimal knowledge in nonmonotonic modal logics
• Minimal knowledge problem: A new approach
• Minimal belief and negation as failure
• Levesque's axiomatization of only knowing is incomplete
• Limited reasoning in first-order knowledge bases with full introspection
• All I know: A study in autoepistemic logic
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Multi-agent Only Knowing
• Decidable fragments of first-order modal logics
• What should a database know?
• Complexity Results for Nonmonotonic Logics
• Ground Nonmonotonic Modal Logics
• NP trees and Carnap's modal logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item