Handbook of theoretical computer science (vol. B)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Planning control rules for reactive agents
Artificial Intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
An Automata-Theoretic Approach to Fair Realizability and Synthesis
Proceedings of the 7th International Conference on Computer Aided Verification
Automata-Theoretic Approach to Planning for Temporally Extended Goals
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Planning as model checking for extended goals in non-deterministic domains
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A Request Language for Web-Services Based on Planning and Constraint Satisfaction
TES '02 Proceedings of the Third International Workshop on Technologies for E-Services
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Conformant planning via symbolic model checking and heuristic search
Artificial Intelligence
Automated synthesis of executable web service compositions from BPEL4WS processes
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Understanding planning with incomplete information and sensing
Artificial Intelligence
Strong planning under partial observability
Artificial Intelligence
Understanding approaches for web service composition and execution
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
A logic-based agent that plans for extended reachability goals
Autonomous Agents and Multi-Agent Systems
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
Artificial Intelligence
A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis
Model Checking and Artificial Intelligence
Using α-ctl to Specify Complex Planning Goals
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Semantic Web Service Selection at the Process-Level: The eBay/Amazon/PayPal Case Study
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Task decomposition on abstract states, for planning under nondeterminism
Artificial Intelligence
Synthesis and Composition of Web Services
Formal Methods for Web Services
Goal specification, non-determinism and quantifying over policies
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Planning with first-order temporally extended goals using heuristic search
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Fusing procedural and declarative planning goals for nondeterministic domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Decision-theoretic planning with non-Markovian rewards
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
The planning spectrum: one, two, three, infinity
Journal of Artificial Intelligence Research
Observation reduction for strong plans
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Understanding planning with incomplete information and sensing
Artificial Intelligence
Strong planning under partial observability
Artificial Intelligence
Structured plans and observation reduction for plans with contexts
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Automated composition of Web services via planning in asynchronous domains
Artificial Intelligence
Comparison between two languages used to express planning goals: CTL and EAGLE
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Anytime state-based solution methods for decision processes with non-Markovian rewards
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Planning under uncertainty and its applications
Reasoning, Action and Interaction in AI Theories and Systems
Reasoning about web services in a temporal action logic
Reasoning, Action and Interaction in AI Theories and Systems
Process-Level composition of executable web services: ”on-the-fly” versus ”once-for-all” composition
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Representing and reasoning with qualitative preferences for compositional systems
Journal of Artificial Intelligence Research
SAP speaks PDDL: exploiting a software-engineering model for planning in business process management
Journal of Artificial Intelligence Research
CAptLang: a language for context-aware and adaptable business processes
Proceedings of the Seventh International Workshop on Variability Modelling of Software-intensive Systems
Hi-index | 0.00 |
Planning for extended goals in non-deterministic domains is one of the most significant and challenging planning problems. In spite of the recent results in this field, no work has proposed a language designed specifically for planning. As a consequence, it is still impossible to specify and plan for several classes of goals that are typical of real world applications, like for instance "try to achieve a goal whenever possible", or "if you fail to achieve a goal, recover by trying to achieve something else".We propose a new goal language that allows for capturing the intended meaning of these goals. We give a semantics to this language that is radically different from the usual semantics for extended goals, e.g., the semantics for LTL or CTL. Finally, we implement an algorithm for planning for extended goals expressed in this language, and experiment with it on a parametric domain.