On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Artificial Intelligence
AgentSpeak(L): BDI agents speak out in a logical computable language
MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Semantics of declarative goals in agent programming
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Hierarchical planning in BDI agent programming languages: a formal approach
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Electronic Notes in Theoretical Computer Science (ENTCS)
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Synthesis of reactive(1) designs
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Induction and learning of finite-state controllers from simulation
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Automatic behavior composition synthesis
Artificial Intelligence
Hi-index | 0.00 |
We imagine agent "planning" programs as programs built from achievement and maintenance goals. Their executions require the ability to meet such goals while respecting the programs' control flow. The question then is: can we always guarantee the execution of such programs? In this paper, we define this novel planning-programming problem formally, and propose a sound, complete and optimal wrt computational complexity technique to actually generate a solution by appealing to recent results in LTL-based synthesis of reactive systems.