Results 1 - 10 of 335

The complexity of one-agent Refinement Modal Logic

by Laura Bozzelli, Hans Van Ditmarsch, Sophie Pinchinat
"... Abstract. We investigate the complexity of satisfiability for one-agent Refinement Modal Logic (RML), a known extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. It is known that RML has the same expressiveness as ML, but the translation of RML into ML is of ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Abstract. We investigate the complexity of satisfiability for one-agent Refinement Modal Logic (RML), a known extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. It is known that RML has the same expressiveness as ML, but the translation of RML into ML

Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence The Complexity of One-Agent Refinement Modal Logic ∗

by Laura Bozzelli, Hans Van Ditmarsch, Sophie Pinchinat
"... We investigate the complexity of satisfiability for one-agent refinement modal logic (RML), an extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. RML is known to have the same expressiveness as ML, but the translation of RML into ML is of non-elementary comp ..."
Abstract - Add to MetaCart
We investigate the complexity of satisfiability for one-agent refinement modal logic (RML), an extension of basic modal logic (ML) obtained by adding refinement quantifiers on structures. RML is known to have the same expressiveness as ML, but the translation of RML into ML is of non

AgentSpeak(L): BDI Agents speak out in a logical computable language

by Anand S. Rao , 1996
"... Belief-Desire-Intention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theorem-prov ..."
Abstract - Cited by 514 (2 self) - Add to MetaCart
-proving or model-checking in these expressive specification logics. Hence, the implemented BDI systems have tended to use the three major attitudes as data structures, rather than as modal operators. In this paper, we provide an alternative formalization of BDI agents by providing an operational and proof

Resolution-Based Methods for Modal Logics

by Hans De Nivelle, Renate A. Schmidt, Ulrich Hustadt - Logic J. IGPL , 2000
"... In this paper we give an overview of resolution methods for extended propositional modal logics. We adopt the standard translation approach and consider different resolution refinements which provide decision procedures for the resulting clause sets. Our procedures are based on ordered resolution an ..."
Abstract - Cited by 54 (23 self) - Add to MetaCart
In this paper we give an overview of resolution methods for extended propositional modal logics. We adopt the standard translation approach and consider different resolution refinements which provide decision procedures for the resulting clause sets. Our procedures are based on ordered resolution

Closing a Gap in the Complexity of Refinement Modal Logic

by Antonis Achilleos, Michael Lampis
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Decision Problems for Propositional Linear Logic

by Patrick Lincoln, John Mitchell, Andre Scedrov, Natarajan Shankar - FOCS , 1990
"... Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. We show that unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable. Further, we prove that without the modal storage operator, ..."
Abstract - Cited by 110 (16 self) - Add to MetaCart
Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. We show that unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable. Further, we prove that without the modal storage operator

Logical Action Refinement

by unknown authors
"... Abstract. Important techniques for developing reactive systems are based on refinement and, in particular, on action refinement. Action refinement allows for the stepwise refinement of processes by transforming abstract actions into concrete processes. We extend the traditional framework of action r ..."
Abstract - Add to MetaCart
refinement by simultaneously refining process descriptions and their specifications. In this way, we do not only refine processes but also the modal and temporal properties of the abstract system. This extension allows to automatically infer properties of the refined system. More precisely, we define

Logical Action Refinement

by unknown authors
"... Abstract. Important techniques for developing reactive systems are based on refinement and, in particular, on action refinement. Action refinement allows for the stepwise refinement of processes by transforming abstract actions into concrete processes. We extend the traditional framework of action r ..."
Abstract - Add to MetaCart
refinement by simultaneously refining process descriptions and their specifications. In this way, we do not only refine processes but also the modal and temporal properties of the abstract system. This extension allows to automatically infer properties of the refined system. More precisely, we define

Logical Action Refinement

by Maria Sorea
"... Important techniques for developing reactive systems are based on refinement and, in particular, on action re nement. Action refinement allows for the stepwise refinement of processes by transforming abstract actions into concrete processes. We extend the traditional framework of action refinement b ..."
Abstract - Add to MetaCart
by simultaneously refining process descriptions and their specifications. In this way, we do not only refine processes but also the modal and temporal properties of the abstract system. This extension allows to automatically infer properties of the refined system. More precisely, we define, in addition to usual

Circumscription in a modal logic

by Fangzhen Lin - Theoretical Aspects of Reasoning about Knowledge: Proc. of the Second Conf , 1988
"... In this paper, we extend circumscription [McCarthy, 80] to a propositional modal logic of knowledge of one agent. Instead of circumscribing a predicate, we circumscribe the knowledge operator "K " in a formula. In order to have a nontrivial circumscription schema, we extend $5 moda ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
In this paper, we extend circumscription [McCarthy, 80] to a propositional modal logic of knowledge of one agent. Instead of circumscribing a predicate, we circumscribe the knowledge operator "K " in a formula. In order to have a nontrivial circumscription schema, we extend $5
Results 1 - 10 of 335