As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We develop a cut-free tableau calculus for the logic CPDLreg, leading to the first cut-free EXPTIME (optimal) tableau decision procedure for CPDLreg. This logic extends Converse-PDL with regular inclusion axioms characterized by finite automata. It is a logical formalism suitable for expressing complex properties of agents' cooperation in terms of beliefs, goals and intentions.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
loading subjects...
