Efficient Open World Reasoning for Planning Export

@misc{babaian06efficient, abstract = {We consider the problem of reasoning and planning with incomplete knowledge and deterministic actions. We introduce a knowledge representation scheme called PSIPLAN that can effectively represent incompleteness of an agent's knowledge while allowing for sound, complete and tractable entailment in domains where the set of all objects is either unknown or infinite. We present a procedure for state update resulting from taking an action in PSIPLAN that is correct, complete and has only polynomial complexity. State update is performed without considering the set of all possible worlds corresponding to the knowledge state. As a result, planning with PSIPLAN is done without direct manipulation of possible worlds. PSIPLAN representation underlies the PSIPOP planning algorithm that handles quantified goals with or without exceptions that no other domain independent planner has been shown to achieve. PSIPLAN has been implemented in Common Lisp and used in an application on planning in a collaborative interface.}, archivePrefix = {arXiv}, author = {Babaian, Tamara and Schmolze, James G.}, citeulike-article-id = {557780}, citeulike-linkout-0 = {http://arxiv.org/abs/cs.AI/0601032}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs.AI/0601032}, day = {9}, eprint = {cs.AI/0601032}, keywords = {ai, incomplete\_knowledge, logic, planning}, month = {Jan}, posted-at = {2006-03-21 04:01:37}, priority = {0}, title = {Efficient Open World Reasoning for Planning}, url = {http://arxiv.org/abs/cs.AI/0601032}, year = {2006} }

TY - ELEC ID - babaian06efficient L3 - citeulike-article-id:557780 N2 - We consider the problem of reasoning and planning with incomplete knowledge and deterministic actions. We introduce a knowledge representation scheme called PSIPLAN that can effectively represent incompleteness of an agent's knowledge while allowing for sound, complete and tractable entailment in domains where the set of all objects is either unknown or infinite. We present a procedure for state update resulting from taking an action in PSIPLAN that is correct, complete and has only polynomial complexity. State update is performed without considering the set of all possible worlds corresponding to the knowledge state. As a result, planning with PSIPLAN is done without direct manipulation of possible worlds. PSIPLAN representation underlies the PSIPOP planning algorithm that handles quantified goals with or without exceptions that no other domain independent planner has been shown to achieve. PSIPLAN has been implemented in Common Lisp and used in an application on planning in a collaborative interface. TI - Efficient Open World Reasoning for Planning KW - ai KW - incomplete_knowledge KW - logic KW - planning AU - Babaian, Tamara AU - Schmolze, James PY - 2006/Jan/09/ UR - http://arxiv.org/abs/cs.AI/0601032 ER -