{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:37:55Z","timestamp":1725500275098},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In the area of reasoning about actions, one of the key computational problems is the projection problem: to find whether a given logical formula is true after<\/jats:p><jats:p>performing a sequence of actions. This problem is undecidable in the general<\/jats:p><jats:p>situation calculus; however, it is decidable in some fragments. We consider<\/jats:p><jats:p>a fragment P of the situation calculus and Reiter's basic action theories (BAT)<\/jats:p><jats:p>such that the projection problem can be reduced to the satisfiability problem<\/jats:p><jats:p>in an expressive description logic $ALCO(U)$ that includes nominals ($O$),<\/jats:p><jats:p>the universal role ($U$), and constructs from the well-known logic $ALC$. It turns out<\/jats:p><jats:p>that our fragment P is more expressive than previously explored description logic<\/jats:p><jats:p>based fragments of the situation calculus.  We explore some of the logical properties of our theories.<\/jats:p><jats:p>In particular, we show that the projection problem can be solved using regression<\/jats:p><jats:p>in the case where BATs include a general ``static\" TBox, i.e., an ontology that has<\/jats:p><jats:p>no occurrences of fluents. Thus, we propose seamless integration of traditional<\/jats:p><jats:p>ontologies with reasoning about actions. We also show that the projection<\/jats:p><jats:p>problem can be solved using progression if all actions have only local effects on<\/jats:p><jats:p>the fluents, i.e., in P, if one starts with an incomplete initial theory that<\/jats:p><jats:p>can be transformed into an $ALCO(U)$ concept, then its progression resulting from<\/jats:p><jats:p>execution of a ground action can still be expressed in the same language. Moreover,<\/jats:p><jats:p>we show that for a broad class of incomplete initial theories progression can be computed efficiently.<\/jats:p>","DOI":"10.29007\/2m22","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:36Z","timestamp":1516730256000},"page":"307-287","source":"Crossref","is-referenced-by-count":0,"title":["Towards an Expressive Practical Logical Action Theory"],"prefix":"10.29007","volume":"10","author":[{"given":"Mikhail","family":"Soutchanski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wael","family":"Yehia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"Turing-100. The Alan Turing Centenary"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:40Z","timestamp":1516730260000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/tcmR"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/2m22","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}