A strong completeness result for a MAS logic

MaRDI QIDQ5486060zbMATH OpenFDO

Authors M. Kacprzak

Publication date 6 September 2006

zbMATH Keywords

multi-agent systemscompletenessdeductive system

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• MASL: A Logic for the Specification of Multiagent Real-Time Systems
• Specification and Verification of Multi-Agent Systems
• A complete coalition logic of temporal knowledge for multi-agent systems
• Interactions between knowledge and time in a first-order logic for multi-agent systems: completeness results
• Frontiers of Combining Systems

Cited in

(2)

• A probabilistic temporal epistemic logic: strong completeness
• A logic-based approach to incremental reasoning on multi-agent systems

This page was built for publication: A strong completeness result for a MAS logic

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