scientific article; zbMATH DE number 2182497

MaRDI QIDQ4681373zbMATH OpenFDO

Authors M. Kacprzak, Alessio Lomuscio, W. Pencek

Publication date 23 June 2005

Full work available at URL http://iospress.metapress.com/link.asp?id=qn2mjb23ul1u1bpr

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in artificial intelligence (68T01) Logic in artificial intelligence (68T27)

Recommendations

• A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic
• Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
• Bounded model checking for temporal epistemic logic in synchronous multi-agent systems
• Symbolic model checking for temporal-epistemic logic
• Completeness of bounded model checking temporal logic of knowledge
• Parallel model checking for temporal epistemic logic
• Bounded model checking for propositional projection temporal logic
• Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• Model checking temporal-epistemic logic using alternating tree automata

Cited in

(24)

• Compositional verification of multi-agent systems in temporal multi-epistemic logic
• Natural strategic ability
• Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
• A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic
• A three-value abstraction technique for the verification of epistemic properties in multi-agent systems
• Bounded model checking for deontic interpreted systems
• Symbolic model checking for temporal-epistemic logic
• Parallel model checking for temporal epistemic logic
• On the (un-)decidability of model checking resource-bounded agents
• Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
• Completeness of bounded model checking temporal logic of knowledge
• Model checking temporal-epistemic logic using alternating tree automata
• Specification and Verification of Multi-Agent Systems
• Optimizing epistemic model checking using conditional independence (extended abstract)
• Bounded model checking for temporal epistemic logic in synchronous multi-agent systems
• Achieving completeness in the verification of action theories by bounded model checking in ASP
• Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
• scientific article; zbMATH DE number 2064229 (Why is no real title available?)
• Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
• From Model Checking to a Temporal Proof for Partial Models
• Decidability of model checking multi-agent systems against a class of EHS specifications
• Algebraic Methodology and Software Technology
• Bounded Model Checking Real-Time Multi-agent Systems with Clock Differences: Theory and Implementation
• Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic

This page was built for publication:

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