Steps towards a first-order logic of explicit and implicit belief
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Belief, awareness, and limited reasoning
Artificial Intelligence
Knowledge and the problem of logical omniscience
Proceedings of the Second International Symposium on Methodologies for intelligent systems
Reasoning situated in time I: basic concepts
Journal of Experimental & Theoretical Artificial Intelligence
A situated view of representation and control
Artificial Intelligence - Special volume on computational research on interaction and agency, part 2
Logic and representation
Reasoning about knowledge
Descriptive dynamic logic and its application to reflective architectures
Future Generation Computer Systems - Special double issue: reflection and meta-level AI architectures
Modal logic
A Deduction Model of Belief
Ascribing beliefs to resource bounded agents
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Logical Omniscience vs. Logical Ignorance on a Dilemma of Epistemic Logic
EPIA '95 Proceedings of the 7th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
We propose a framework for modelling situated resource-bounded agents. The framework is based on an objective ascription of intentional modalities and can be easily tailored to the system we want to model and the properties we wish to specify. As an elaboration of the framework, we introduce a logic, OBA, for describing the observations, beliefs, goals and actions of simple agents, and show that OBA is complete, decidable and has an efficient model checking procedure, allowing properties of agents specified in OBA to be verified using standard theorem proving or model checking techniques.