Agent theories, architectures, and languages: a survey
ECAI-94 Proceedings of the workshop on agent theories, architectures, and languages on Intelligent agents
Labelled Tableaux for Multi-Modal Logics
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Distributed Modal Theorem Proving with KE
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Free Variable Tableaux for Propositional Modal Logics
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Tableaux and Algorithms for Propositional Dynamic Logic with Converse
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Programming Goal-Driven Web Sites Using an Agent Logic Language
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Belief, information acquisition, and trust in multi-agent systems: a modal logic formulation
Artificial Intelligence
Programming Rational Agents in a Modal Action Logic
Annals of Mathematics and Artificial Intelligence
A modal logic framework for multi-agent belief fusion
ACM Transactions on Computational Logic (TOCL)
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
Decidability of SHIQ with complex role inclusion axioms
Artificial Intelligence
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
Computational Logic in Multi-Agent Systems
Clausal Tableaux for Multimodal Logics of Belief
Fundamenta Informaticae
A Tableau Calculus for Regular Grammar Logics with Converse
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Decidability of SHIQ with complex role inclusion axioms
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Decidability of SHIQ with complex role inclusion axioms
Artificial Intelligence
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Fundamenta Informaticae
A tableau calculus with automaton-labelled formulae for regular grammar logics
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Verifying protocol conformance for logic-based communicating agents
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
A bisimulation-based method of concept learning for knowledge bases in description logics
Proceedings of the Third Symposium on Information and Communication Technology
Countermodels from Sequent Calculi in Multi-Modal Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Clausal Tableaux for Multimodal Logics of Belief
Fundamenta Informaticae
The Nondeterministic Information Logic NIL is PSPACE-complete
Fundamenta Informaticae
| Hi-index | 0.01 |
In this paper we present a prefixed analytic tableau calculus for a class of normal multimodal logics and we present some results about decidability and undecidability of this class. The class is characterized by axioms of the form [t1]...[tn] 驴驴 [s1]...[sm]驴 called inclusion axioms, where the ti's and sj 's are constants. This class of logics, called grammar logics, was introduced for the first time by Fari帽as del Cerro and Penttonen to simulate the behaviour of grammars in modal logics, and includes some well-known modal systems. The prefixed tableau method is used to prove the undecidability of modal systems based on unrestricted, context sensitive, and context free grammars. Moreover, we show that the class of modal logics, based on right-regular grammars, are decidable by means of the filtration methods, by defining an extension of the Fischer-Ladner closure.