As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We extend LARS, which is a recent stream reasoning framework based on ASP, to weighted LARS (wLARS), where formulae are interpreted as algebraic expressions over semirings. This adds the ability to express quantitative measures of many different natures and to approach respective reasoning problems such as probabilistic reasoning, preferential reasoning and quantitative queries in a uniform manner. Notably, well-known quantitative ASP extensions can be formalized using wLARS, thus lifting them to the streaming setting. We identify a relevant wLARS fragment that is equivalent to weighted automata, which consequently gives us a rule-based language for expressing behaviors of such automata. Furthermore, we analyze evaluating wLARS formulae, showing that brave preferential reasoning is PSPACE- resp. Σp3-complete in relevant settings.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.