Foundations for Knowledge-Based Programs using ES. Claßen, J. & Lakemeyer, G. In Doherty, P., Mylopoulos, J., & Welty, C. A., editors, *Proceedings of the 10th Conference on Principles of Knowledge Representation and Reasoning (KR 2006)*, pages 318–328, 2006. AAAI Press. Paper abstract bibtex Reiter proposed a semantics for knowledge-based Golog programs with sensing where program execution can be conditioned on tests involving explicit references to what the agent knows and does not know. An important result of this work is that reasoning about knowledge after the execution of actions can be reduced to classical reasoning from an initial first-order theory. However, it is limited in that tests can only refer to what is known about the current state, knowledge about knowledge is not considered, and the reduction does not apply to formulas with quantifying-in. This is in large part due to the choice of the underlying formalism, which is Reiter\textquoterights version of the situation calculus. In this paper we show that, by moving to a new situation calculus recently proposed by Lakemeyer and Levesque, we cannot only reconstruct Reiter\textquoterights foundations for knowledge-based programs but we can significantly go beyond them, which includes removing the above restrictions and more.

@INPROCEEDINGS{ClaLak:KR2006,
title = {Foundations for Knowledge-Based Programs using {ES}},
author = {Jens Cla{\ss}en and Gerhard Lakemeyer},
booktitle = {Proceedings of the 10th Conference on Principles of
Knowledge Representation and Reasoning (KR 2006)},
year = {2006},
editor = {Patrick Doherty and John Mylopoulos and Christopher
A. Welty},
pages = {318--328},
publisher = {AAAI Press},
abstract = {Reiter proposed a semantics for knowledge-based Golog
programs with sensing where program execution can be
conditioned on tests involving explicit references
to what the agent knows and does not know. An
important result of this work is that reasoning
about knowledge after the execution of actions can
be reduced to classical reasoning from an initial
first-order theory. However, it is limited in that
tests can only refer to what is known about the
current state, knowledge about knowledge is not
considered, and the reduction does not apply to
formulas with quantifying-in. This is in large part
due to the choice of the underlying formalism, which
is Reiter{\textquoteright}s version of the situation
calculus. In this paper we show that, by moving to a
new situation calculus recently proposed by
Lakemeyer and Levesque, we cannot only reconstruct
Reiter{\textquoteright}s foundations for
knowledge-based programs but we can significantly go
beyond them, which includes removing the above
restrictions and more.},
url = {http://kbsg.rwth-aachen.de/~classen/pub/ClassenLakemeyer2006a.pdf}
}

Downloads: 0

{"_id":"DpZLLpc4oo6kMKwAz","bibbaseid":"claen-lakemeyer-foundationsforknowledgebasedprogramsusinges-2006","author_short":["Claßen, J.","Lakemeyer, G."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Foundations for Knowledge-Based Programs using ES","author":[{"firstnames":["Jens"],"propositions":[],"lastnames":["Claßen"],"suffixes":[]},{"firstnames":["Gerhard"],"propositions":[],"lastnames":["Lakemeyer"],"suffixes":[]}],"booktitle":"Proceedings of the 10th Conference on Principles of Knowledge Representation and Reasoning (KR 2006)","year":"2006","editor":[{"firstnames":["Patrick"],"propositions":[],"lastnames":["Doherty"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Mylopoulos"],"suffixes":[]},{"firstnames":["Christopher","A."],"propositions":[],"lastnames":["Welty"],"suffixes":[]}],"pages":"318–328","publisher":"AAAI Press","abstract":"Reiter proposed a semantics for knowledge-based Golog programs with sensing where program execution can be conditioned on tests involving explicit references to what the agent knows and does not know. An important result of this work is that reasoning about knowledge after the execution of actions can be reduced to classical reasoning from an initial first-order theory. However, it is limited in that tests can only refer to what is known about the current state, knowledge about knowledge is not considered, and the reduction does not apply to formulas with quantifying-in. This is in large part due to the choice of the underlying formalism, which is Reiter\\textquoterights version of the situation calculus. In this paper we show that, by moving to a new situation calculus recently proposed by Lakemeyer and Levesque, we cannot only reconstruct Reiter\\textquoterights foundations for knowledge-based programs but we can significantly go beyond them, which includes removing the above restrictions and more.","url":"http://kbsg.rwth-aachen.de/~classen/pub/ClassenLakemeyer2006a.pdf","bibtex":"@INPROCEEDINGS{ClaLak:KR2006,\n title = {Foundations for Knowledge-Based Programs using {ES}},\n author = {Jens Cla{\\ss}en and Gerhard Lakemeyer},\n booktitle = {Proceedings of the 10th Conference on Principles of\n Knowledge Representation and Reasoning (KR 2006)},\n year = {2006},\n editor = {Patrick Doherty and John Mylopoulos and Christopher\n A. Welty},\n pages = {318--328}, \n publisher = {AAAI Press},\n abstract = {Reiter proposed a semantics for knowledge-based Golog\n programs with sensing where program execution can be\n conditioned on tests involving explicit references\n to what the agent knows and does not know. An\n important result of this work is that reasoning\n about knowledge after the execution of actions can\n be reduced to classical reasoning from an initial\n first-order theory. However, it is limited in that\n tests can only refer to what is known about the\n current state, knowledge about knowledge is not\n considered, and the reduction does not apply to\n formulas with quantifying-in. This is in large part\n due to the choice of the underlying formalism, which\n is Reiter{\\textquoteright}s version of the situation\n calculus. In this paper we show that, by moving to a\n new situation calculus recently proposed by\n Lakemeyer and Levesque, we cannot only reconstruct\n Reiter{\\textquoteright}s foundations for\n knowledge-based programs but we can significantly go\n beyond them, which includes removing the above\n restrictions and more.},\n url = {http://kbsg.rwth-aachen.de/~classen/pub/ClassenLakemeyer2006a.pdf}\n}\n","author_short":["Claßen, J.","Lakemeyer, G."],"editor_short":["Doherty, P.","Mylopoulos, J.","Welty, C. A."],"key":"ClaLak:KR2006","id":"ClaLak:KR2006","bibbaseid":"claen-lakemeyer-foundationsforknowledgebasedprogramsusinges-2006","role":"author","urls":{"Paper":"http://kbsg.rwth-aachen.de/~classen/pub/ClassenLakemeyer2006a.pdf"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://kbsg.rwth-aachen.de/files/kbsgweb.bib","dataSources":["dqRQPSg6Hy3ZXQg7z"],"keywords":[],"search_terms":["foundations","knowledge","based","programs","using","claßen","lakemeyer"],"title":"Foundations for Knowledge-Based Programs using ES","year":2006}