{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:39:35Z","timestamp":1753889975840,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2006,9,26]],"date-time":"2006-09-26T00:00:00Z","timestamp":1159228800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/assumed-1991-2003"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We consider the problem of reasoning and planning with incomplete knowledge\nand deterministic actions. We introduce a knowledge representation scheme\ncalled PSIPLAN that can effectively represent incompleteness of an agent's\nknowledge while allowing for sound, complete and tractable entailment in\ndomains where the set of all objects is either unknown or infinite. We present\na procedure for state update resulting from taking an action in PSIPLAN that is\ncorrect, complete and has only polynomial complexity. State update is performed\nwithout considering the set of all possible worlds corresponding to the\nknowledge state. As a result, planning with PSIPLAN is done without direct\nmanipulation of possible worlds. PSIPLAN representation underlies the PSIPOP\nplanning algorithm that handles quantified goals with or without exceptions\nthat no other domain independent planner has been shown to achieve. PSIPLAN has\nbeen implemented in Common Lisp and used in an application on planning in a\ncollaborative interface.<\/jats:p>","DOI":"10.2168\/lmcs-2(3:5)2006","type":"journal-article","created":{"date-parts":[[2006,11,23]],"date-time":"2006-11-23T09:28:23Z","timestamp":1164274103000},"source":"Crossref","is-referenced-by-count":1,"title":["Efficient Open World Reasoning for Planning"],"prefix":"10.46298","volume":"Volume 2, Issue 3","author":[{"given":"Tamara","family":"Babaian","sequence":"first","affiliation":[]},{"given":"James G.","family":"Schmolze","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2006,9,26]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/2247\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/2247\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:10:37Z","timestamp":1681243837000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,26]]},"references-count":0,"URL":"https:\/\/doi.org\/10.2168\/lmcs-2(3:5)2006","relation":{"is-same-as":[{"id-type":"arxiv","id":"cs\/0601032","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.cs\/0601032","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2006,9,26]]},"article-number":"2247"}}