scientific article; zbMATH DE number 5129607

MaRDI QIDQ3425580zbMATH OpenFDO

Authors Marcin Dziubiński, Rineke Verbrugge, Barbara Dunin-Kȩplicz

Publication date 26 February 2007

zbMATH Keywords

TEAMLOG

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1202867
• Complexity of logics for multi-agent systems with restricted modal context
• Logical aspects of multi-agent systems
• Computational logic in multi-agent systems: Recent advances and future directions
• scientific article; zbMATH DE number 2087709
• Multiple agent possibilistic logic
• Special issue on logical aspects of multi-agent systems
• scientific article; zbMATH DE number 2064466
• Comparing semantics of logics for multi-agent systems

Cited in

(9)

• On the Complexity of Two-Agent Justification Logic
• Converse-PDL with regular inclusion axioms: a framework for MAS logics
• Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic
• A framework for graded beliefs, goals and intentions
• scientific article; zbMATH DE number 2051900 (Why is no real title available?)
• Representation and solving of logic dependent relation in multi-agent system
• Logic and social cognition. The facts matter, and so do computational models
• scientific article; zbMATH DE number 2064466 (Why is no real title available?)
• scientific article; zbMATH DE number 2087709 (Why is no real title available?)

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 Q3425580)