Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SUM

2010

Springer

2010

Springer

Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities. Rules in ap-programs have the form “If the environment in which entity E operates satisﬁes certain conditions, then the probability that E will take some action A is between L and U”. Given an ap-program, we have addressed the problem of deciding if there is a way to change the environment (subject to some constraints) so that the probability that entity E takes some action (or combination of actions) is maximized. In this work we tackle a related problem, in which we are interested in reasoning about the expected reactions of the entity being modeled when the environment is changed. Therefore, rather than merely deciding if there is a way to obtain the desired outcome, we wish to ﬁnd the best way to do so, given costs of possible outcomes. This is called the Cost-based Query Answering Problem (CBQA...

Related Content

Added |
30 Jan 2011 |

Updated |
30 Jan 2011 |

Type |
Journal |

Year |
2010 |

Where |
SUM |

Authors |
Gerardo I. Simari, John P. Dickerson, V. S. Subrahmanian |

Comments (0)