Computing sufficient and necessary conditions in CTL: a forgetting approach

DOI10.1016/j.ins.2022.10.124OpenAlexW4308178008MaRDI QIDQ6204992

Yisong Wang, Wanwei Liu, Renyan Feng, Weiping Ding, Erman Acar, Stefan Schlobach

Publication date: 11 April 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2022.10.124

zbMATH Keywords

model checkingforgettingcomputation tree logicweakest sufficient condition

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantic forgetting in expressive description logics
• On syntactic forgetting under uniform equivalence
• Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler
• On the limits of forgetting in answer set programming
• Model-checking graded computation-tree logic with finite path semantics
• Forgetting in multi-agent modal logics
• Semantic forgetting in answer set programming
• The mu-calculus and Model Checking
• Automata for the modal μ-calculus and related results
• THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
• Guarded commands, nondeterminacy and formal derivation of programs
• Temporal logics of “the next” do not have the beth property
• A Refined Resolution Calculus for CTL
• A resolution calculus for the branching-time temporal logic CTL
• Knowledge Forgetting in Answer Set Programming
• On strongest necessary and weakest sufficient conditions