Producing explanations for rich logics

DOI10.1007/978-3-319-95582-7_8zbMath1460.68053OpenAlexW2808842104MaRDI QIDQ2024339

Charles Pecheur, Simon Busard

Publication date: 4 May 2021

Full work available at URL: https://doi.org/10.1007/978-3-319-95582-7_8

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (1)

Generating contrastive explanations for inductive logic programming based on a near miss approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Propositional dynamic logic of regular programs
• Generation of minimum tree-like witnesses for existential CTL
• Proof Graphs for Parameterised Boolean Equation Systems
• mcmas: A Model Checker for Multi-agent Systems
• Alternating-time temporal logic
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
• Computer Aided Verification
• Fundamental Approaches to Software Engineering
• On ACTL formulas having linear counterexamples
• Error diagnosis in finite communicating systems

This page was built for publication: Producing explanations for rich logics