A Semantical Account of Progression in the Presence of Uncertainty.
Belle, V.; and Lakemeyer, G.
In
Proc. AAAI, pages 165-170, 2011.
![A Semantical Account of Progression in the Presence of Uncertainty [pdf]](//bibbase.org/img/filetypes/pdf.svg "Paper")
Paper
link
bibtex
abstract
12 downloads
@InProceedings{KBSG_220,
Title = {A Semantical Account of Progression in the Presence of Uncertainty},
Author = {Belle, Vaishak and Lakemeyer, Gerhard},
Booktitle = {Proc. AAAI},
Year = {2011},
Pages = {165-170},
Abstract = {Building on a general theory of action by Reiter and his colleagues, Bacchus et al give an account for formalizing degrees of belief and noisy actions in the situation calculus. Unfortunately, there is no clear solution to the projection problem for the formalism. And, while the model has epistemic features, it is not obvious what the agent{\textquoteright}s knowledge base should look like. Also, reasoning about uncertainty essentially resorts to second-order logic. In recent work, Gabaldon and Lakemeyer remedy these shortcomings somewhat, but here too the utility seems to be restricted to queries (with action operators) about the initial theory. In this paper, we propose a fresh amalgamation of a modal fragment of the situation calculus and uncertainty, where the idea will be to update the initial knowledge base, containing both ordinary and (certain kinds of) probabilistic beliefs, when noisy actions are performed. We show that the new semantics has the right properties, and study a special case where updating probabilistic beliefs is computable. Our ideas are closely related to the Lin and Reiter notion of progression. },
Date-added = {2011-05-16 13:15:50 +0200},
Date-modified = {2012-02-22 14:53:45 +0000},
Timestamp = {2018.09.23},
Url = {http://kbsg.rwth-aachen.de/fileskbsg/prog-noisy.pdf}
}
Building on a general theory of action by Reiter and his colleagues, Bacchus et al give an account for formalizing degrees of belief and noisy actions in the situation calculus. Unfortunately, there is no clear solution to the projection problem for the formalism. And, while the model has epistemic features, it is not obvious what the agent\textquoterights knowledge base should look like. Also, reasoning about uncertainty essentially resorts to second-order logic. In recent work, Gabaldon and Lakemeyer remedy these shortcomings somewhat, but here too the utility seems to be restricted to queries (with action operators) about the initial theory. In this paper, we propose a fresh amalgamation of a modal fragment of the situation calculus and uncertainty, where the idea will be to update the initial knowledge base, containing both ordinary and (certain kinds of) probabilistic beliefs, when noisy actions are performed. We show that the new semantics has the right properties, and study a special case where updating probabilistic beliefs is computable. Our ideas are closely related to the Lin and Reiter notion of progression.
On Progression and Query Evaluation in First-Order Knowledge Bases with Function Symbols.
Belle, V.; and Lakemeyer, G.
In
Proc. IJCAI, pages 255-260, 2011.
Paper
link
bibtex
abstract
12 downloads
@InProceedings{KBSG_219,
Title = {On Progression and Query Evaluation in First-Order Knowledge Bases with Function Symbols},
Author = {Belle, Vaishak and Lakemeyer, Gerhard},
Booktitle = {Proc. IJCAI},
Year = {2011},
Pages = {255-260},
Abstract = {In a seminal paper, Lin and Reiter introduced the notion of progression of basic action theories. Unfortunately, progression is second-order in general. Recently, Liu and Lakemeyer improve on earlier results and show that for the local-effect and normal actions case, progression is computable but may lead to an exponential blow-up. Nevertheless, they show that for certain kinds of expressive first-order knowledge bases with disjunctive information, called proper$^+$, it is efficient. However, answering queries about the resulting state is still undecidable. In this paper, we continue this line of research and extend proper$^+$ KBs to include functions. We prove that their progression wrt local-effect, normal actions, and range-restricted theories, is first-order definable and efficiently computable. We then provide a new logically sound and complete decision procedure for certain kinds of queries. },
Date-added = {2011-05-16 13:15:30 +0200},
Date-modified = {2012-02-22 14:52:49 +0000},
Timestamp = {2018.09.23},
Url = {http://kbsg.rwth-aachen.de/fileskbsg/ijcai11.pdf}
}
In a seminal paper, Lin and Reiter introduced the notion of progression of basic action theories. Unfortunately, progression is second-order in general. Recently, Liu and Lakemeyer improve on earlier results and show that for the local-effect and normal actions case, progression is computable but may lead to an exponential blow-up. Nevertheless, they show that for certain kinds of expressive first-order knowledge bases with disjunctive information, called proper$^+$, it is efficient. However, answering queries about the resulting state is still undecidable. In this paper, we continue this line of research and extend proper$^+$ KBs to include functions. We prove that their progression wrt local-effect, normal actions, and range-restricted theories, is first-order definable and efficiently computable. We then provide a new logically sound and complete decision procedure for certain kinds of queries.
Multi-Agent Only-Knowing.
Belle, V.; and Lakemeyer, G.
In Lakemeyer, G.; and McIlraith, S. A., editor(s),
Knowing, Reasoning, and Acting: Essays in Honour of Hector J. Levesque, pages 67-86. College Publications, 2011.
link
bibtex
8 downloads
@InCollection{bellelakbook,
Title = {Multi-Agent Only-Knowing},
Author = {Vaishak Belle and Gerhard Lakemeyer},
Booktitle = {Knowing, Reasoning, and Acting: Essays in Honour of Hector J. Levesque},
Publisher = {College Publications},
Year = {2011},
Editor = {Gerhard Lakemeyer and Sheila A. McIlraith},
Pages = {67-86},
Date-added = {2011-11-20 10:23:08 +0000},
Date-modified = {2012-02-27 12:00:41 +0100},
Timestamp = {2018.09.23}
}
![A First-Order Logic of Probability and Only Knowing in Unbounded Domains [link]](//bibbase.org/img/filetypes/link.svg "Paper")
Paper
link
bibtex
![A First-Order Logic of Probability and Only Knowing in Unbounded Domains [link]](http://bibbase.org/img/filetypes/link.svg "Paper")
Paper
link
bibtex
![Planning Over Multi-Agent Epistemic States: A Classical Planning Approach [pdf]](http://bibbase.org/img/filetypes/pdf.svg "Paper")