Complexity of model checking for cardinality-based belief revision operators

DOI10.1007/978-3-319-61581-3_35MaRDI QIDQ2401889zbMATH OpenOpenAlexFDO

Authors Nadia Creignou, Odile Papini, Raida Ktari

Publication date 5 September 2017

Full work available at URL https://doi.org/10.1007/978-3-319-61581-3_35

zbMATH Keywords

complexitybelief revisionmodel checkingmaximal cardinality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27)

Recommendations

• Belief revision and update: Complexity of model checking
• The complexity of reversal-bounded model-checking
• The complexity of model checking for Boolean formulas
• Complexity of model checking for modal dependence logic
• On the complexity of the model checking problem
• scientific article; zbMATH DE number 2140435
• Complexity of model checking for logics over Kripke models
• The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
• Mathematical Foundations of Computer Science 2005
• The Complexity of Model Checking Higher-Order Fixpoint Logic

Cited in

(2)

• Belief revision and update: Complexity of model checking
• Toward credible belief base revision

This page was built for publication: Complexity of model checking for cardinality-based belief revision operators

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