Representing action: indeterminacy and ramifications
Artificial Intelligence
Formalizing sensing actions—a transition function based approach
Artificial Intelligence
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
A uniform integration of higher-order reasoning and external evaluations in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
What is planning in the presence of sensing?
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Adding knowledge to the action description language A
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Combining nonmonotonic knowledge bases with external sources
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
Exception handling in web service processes
The evolution of conceptual modeling
Pushing efficient evaluation of HEX programs by modular decomposition
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Proof Systems for Planning Under Cautious Semantics
Minds and Machines
Hi-index | 0.00 |
We introduce the logic-based planning language κc as an extension of κ [5]. κc has two advantages upon κ. First, the introduction of external function calls in the rules of a planning description allows the knowledge engineer to describe certain planning domains, e.g. involving complex action effects, in a more intuitive fashion then is possible in κ. Secondly, in contrast to the conformant planning framework κ, κc is formalized as a conditional planning system, which enables κc to solve planning problems that are impossible to express in κ, e.g. involving sensing actions. A prototype implementation of conditional planning with κc is build on top of the DLVκsystem, and we illustrate its use by some small examples.