@INPROCEEDINGS{ZarriessClassen2015b,
  author      = {Benjamin Zarrie{\ss} and Jens Cla{\ss}en},
  title       = {Verification of Knowledge-Based Programs over Description Logic Actions},
  booktitle   = {Proceedings of the Twenty-Fourth International Joint
                  Conference on Artificial Intelligence (IJCAI 2015)}, 
  year        = {2015},
  pages       = {3278--3284},
  publisher   = {AAAI Press},
  abstract    = {A knowledge-based program defines the behavior of an
                  agent by combining primitive actions, programming
                  constructs and test conditions that make explicit
                  reference to the agent{\textquoteright}s
                  knowledge. In this paper we consider a setting where
                  an agent is equipped with a Description Logic (DL)
                  knowledge base providing general domain knowledge
                  and an incomplete description of the initial
                  situation. We introduce a corresponding new DL-based
                  action language that allows for representing both
                  physical and sensing actions, and that we then use
                  to build knowledge-based programs with test
                  conditions expressed in the epistemic DL. After
                  proving undecidability for the general case, we then
                  discuss a restricted fragment where verification
                  becomes decidable. The provided proof is
                  constructive and comes with an upper bound on the
                  procedure{\textquoteright}s complexity.},
  url         = {http://www.kbsg.rwth-aachen.de/~classen/pub/ZarriessClassen2015b.pdf}
}

{"_id":"Y6Cg5mxHwduStxzGz","bibbaseid":"zarrie-claen-verificationofknowledgebasedprogramsoverdescriptionlogicactions-2015","author_short":["Zarrieß, B.","Claßen, J."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Benjamin"],"propositions":[],"lastnames":["Zarrieß"],"suffixes":[]},{"firstnames":["Jens"],"propositions":[],"lastnames":["Claßen"],"suffixes":[]}],"title":"Verification of Knowledge-Based Programs over Description Logic Actions","booktitle":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015)","year":"2015","pages":"3278–3284","publisher":"AAAI Press","abstract":"A knowledge-based program defines the behavior of an agent by combining primitive actions, programming constructs and test conditions that make explicit reference to the agent\\textquoterights knowledge. In this paper we consider a setting where an agent is equipped with a Description Logic (DL) knowledge base providing general domain knowledge and an incomplete description of the initial situation. We introduce a corresponding new DL-based action language that allows for representing both physical and sensing actions, and that we then use to build knowledge-based programs with test conditions expressed in the epistemic DL. After proving undecidability for the general case, we then discuss a restricted fragment where verification becomes decidable. The provided proof is constructive and comes with an upper bound on the procedure\\textquoterights complexity.","url":"http://www.kbsg.rwth-aachen.de/~classen/pub/ZarriessClassen2015b.pdf","bibtex":"@INPROCEEDINGS{ZarriessClassen2015b,\n author = {Benjamin Zarrie{\\ss} and Jens Cla{\\ss}en},\n title = {Verification of Knowledge-Based Programs over Description Logic Actions},\n booktitle = {Proceedings of the Twenty-Fourth International Joint\n Conference on Artificial Intelligence (IJCAI 2015)}, \n year = {2015},\n pages = {3278--3284},\n publisher = {AAAI Press},\n abstract = {A knowledge-based program defines the behavior of an\n agent by combining primitive actions, programming\n constructs and test conditions that make explicit\n reference to the agent{\\textquoteright}s\n knowledge. In this paper we consider a setting where\n an agent is equipped with a Description Logic (DL)\n knowledge base providing general domain knowledge\n and an incomplete description of the initial\n situation. We introduce a corresponding new DL-based\n action language that allows for representing both\n physical and sensing actions, and that we then use\n to build knowledge-based programs with test\n conditions expressed in the epistemic DL. After\n proving undecidability for the general case, we then\n discuss a restricted fragment where verification\n becomes decidable. The provided proof is\n constructive and comes with an upper bound on the\n procedure{\\textquoteright}s complexity.},\n url = {http://www.kbsg.rwth-aachen.de/~classen/pub/ZarriessClassen2015b.pdf}\n}\n\n","author_short":["Zarrieß, B.","Claßen, J."],"key":"ZarriessClassen2015b","id":"ZarriessClassen2015b","bibbaseid":"zarrie-claen-verificationofknowledgebasedprogramsoverdescriptionlogicactions-2015","role":"author","urls":{"Paper":"http://www.kbsg.rwth-aachen.de/~classen/pub/ZarriessClassen2015b.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://kbsg.rwth-aachen.de/files/kbsgweb.bib","dataSources":["dqRQPSg6Hy3ZXQg7z"],"keywords":[],"search_terms":["verification","knowledge","based","programs","over","description","logic","actions","zarrieß","claßen"],"title":"Verification of Knowledge-Based Programs over Description Logic Actions","year":2015}