First-order logical filtering

Shirazi, Afsaneh; Amir, Eyal

doi:10.1016/j.artint.2010.04.015

Cited by 17 publications

(15 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our work can likely be enhanced in several dimensions by further studying the ongoing research in the field of probabilistic logics, stochastic/probabilistic satisfiability, relational (PO)MDPs and symbolic dynamic programming (Saad, 2009;Wang and Khardon, 2010;Sanner and Kersting, 2010;Lison, 2010;Shirazi and Amir, 2011). As espoused by Wang et al (2008), for instance, there are advantages to being able to model a domain with relational predicates and not only propositions.…”

Section: Discussionmentioning

confidence: 98%

A Modal Logic for the Decision-Theoretic Projection Problem

Rens

Meyer

Lakemeyer³

2015

Proceedings of the International Conference on Agents and Artificial Intelligence

View full text Add to dashboard Cite

We present a decidable logic in which queries can be posed about (i) the degree of belief in a propositional sentence after an arbitrary finite number of actions and observations and (ii) the utility of a finite sequence of actions after a number of actions and observations. Another contribution of this work is that a POMDP model specification is allowed to be partial or incomplete with no restriction on the lack of information specified for the model. The model may even contain information about non-initial beliefs. Essentially, entailment of arbitrary queries (expressible in the language) can be answered. A sound, complete and terminating decision procedure is provided.

show abstract

Section: Discussionmentioning

confidence: 98%

A Modal Logic for the Decision-Theoretic Projection Problem

Rens

Meyer

Lakemeyer³

2015

Proceedings of the International Conference on Agents and Artificial Intelligence

View full text Add to dashboard Cite

show abstract

“…In particular, they make use of database updating and query service to do progression efficiently. In their work, Shirazi and Amir [2005] investigate the computability of a certain form of first-order progression, but they leave open the cases under which progression is correct.…”

Section: Discussionmentioning

confidence: 99%

On the projection problem in active knowledge bases with incomplete information

Belle

2014

AI Matters

View full text Add to dashboard Cite

The problem of projection has been identified as a fundamental reasoning concern in dynamical domains, where we are to determine whether or not some conditions will hold after a sequence of actions has been performed starting in some initial state. Solving the problem requires, at the very least, effectively reasoning about how actions transform the world, and inferring the logical consequences of the initial knowledge base Completing this Ph.D. has been an enriching journey. What follows is my humble attempt to thank those who have been a part of this ride, through its many potholes. Let me begin by expressing my sincere gratitude to Professor Gerhard Lakemeyer, for first encouraging me to find my own path, and then offering valuable suggestions to realize my goals. My previous background was in machine learning, and I imagine my initial intuitions about epistemic logic must have seemed peculiar. In spite of that, Gerhard patiently helped me fix my technical knowledge, allowed me to explore tangential ideas freely, and more importantly, shared his thoughts on what makes a problem interesting. He has overseen my academic growth for the past four years, and his views on mathematical logic and artificial intelligence have greatly influenced my own. For all of this, for showing me how to write scientifically, and for your continued guidance and support: thank you. A special thanks also goes to my external examiner Professor Hector Levesque for painstakingly reading this thesis, and bringing significant bugs and typographical errors to my attention. Carrying out my work at the Knowledge-based Systems Group has been a lot of fun. I thank its members for great corridor and coffee conversations. Participating in soccer matches, and doctoral seminar escapes to picturesque countrysides, with the remainder of Informatik 5 was very exciting, and I hope these traditions are here to stay. I also thank Jens Claßen for technical discussions, and Tim Niemüller for offering to translate the abstract of this thesis. A number of people visited the department over the years, and among them, I would especially like to thank Yongmei Liu for insightful conversations on research. She also had shared her intuitions about "forgetting" with me, which prompted me to explore that topic. I thank her for this. Financial support for the years 2008-2010 was gratefully received by the Deutsche Forschungsgemeinschaft (German Research Foundation), which funded the graduate school Software for mobile communication systems, of which I was a stipendiary. During my time at the graduate school, Prof. Otto Spaniol provided constant encouragement, and supported our participation in Dagstuhl seminars. For this, I am thankful. Further, Prof. Wolfgang Thomas encouraged me to present my results to the AlgoSyn graduate school, and for this, I thank Wolfgang. For much of the year 2011, financial support was received by the BIT research school, and for this I express my gratitude to Gerhard and Prof. Matthias Jarke. For the remainder of 2011, financial support w...

show abstract

“…Most of the results of Amir and Russell [2003] can be easily generalized to our update operators based on formula/literal dependence, thus completing nicely our results in Section 5. A first-order extension of logical filtering has also been proposed by Shirazi and Amir [2011]. In such a general setting, the update issue is much more difficult (especially, progressing a belief state is known to be not first-order definable [Lin and Reiter 1997]).…”

Section: Dependence-based Update and Action Progressionmentioning

confidence: 98%

“…In such a general setting, the update issue is much more difficult (especially, progressing a belief state is known to be not first-order definable [Lin and Reiter 1997]). In [Shirazi and Amir 2011], the authors present some restrictions on the belief state representations and on the action representations enabling some tractable algorithms for logical filtering to be designed. Lang [2007] characterizes the class of feedback-free actions for which progression corresponds to a belief update, and shows that two well-known forms of action regression correspond in a natural way to two forms of "reverse update".…”

Section: Dependence-based Update and Action Progressionmentioning

confidence: 99%

Propositional Update Operators Based on Formula/Literal Dependence

Herzig

Lang

Marquis

2013

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

We present and study a general family of belief update operators in a propositional setting. Its operators are based on formula/literal dependence, which is more fine-grained than the notion of formula/variable dependence that was proposed in the literature: formula/variable dependence is a particular case of formula/literal dependence. Our update operators are defined according to the "forget-then-conjoin" scheme: updating a belief base by an input formula consists in first forgetting in the base every literal on which the input formula has a negative influence, and then conjoining the resulting base with the input formula. The operators of our family differ by the underlying notion of formula/literal dependence, which may be defined syntactically or semantically, and which may or may not exploit further information like known persistent literals and pre-set dependencies. We argue that this allows to handle the frame problem and the ramification problem in a more appropriate way. We evaluate the update operators of our family w.r.t. two important dimensions: the logical dimension, by checking the status of the Katsuno-Mendelzon postulates for update, and the computational dimension, by identifying the complexity of a number of decision problems (including model checking, consistency and inference), both in the general case and in some restricted cases, as well as by studying compactability issues. It follows that several operators of our family are interesting alternatives to previous belief update operators. ACM Reference Format:Herzig, A., Lang, J., and Marquis, P. 2013. Propositional update operators based on formula/literal dependence.

show abstract

First-order logical filtering

Cited by 17 publications

References 20 publications

A Modal Logic for the Decision-Theoretic Projection Problem

A Modal Logic for the Decision-Theoretic Projection Problem

On the projection problem in active knowledge bases with incomplete information

Propositional Update Operators Based on Formula/Literal Dependence

Contact Info

Product

Resources

About