It scientific studies how representations in these logics behave in a very dynamic location, and introduces operators for decreasing a query soon after steps to an Original point out, or updating the illustration against Individuals actions.
Weighted model counting frequently assumes that weights are only specified on literals, frequently necessitating the necessity to introduce auxillary variables. We consider a completely new solution dependant on psuedo-Boolean features, resulting in a more typical definition. Empirically, we also get SOTA effects.
The Lab carries out research in synthetic intelligence, by unifying Understanding and logic, with a new emphasis on explainability
Should you be attending NeurIPS this year, chances are you'll be interested in looking at our papers that contact on morality, causality, and interpretability. Preprints can be found about the workshop page.
Our paper (joint with Amelie Levray) on Discovering credal sum-item networks is approved to AKBC. These types of networks, along with other types of probabilistic circuits, are desirable as they warranty that certain forms of likelihood estimation queries is often computed in time linear in the scale of the network.
A consortia undertaking on reliable https://vaishakbelle.com/ units and goverance was acknowledged late last 12 months. News url here.
Thinking about instruction neural networks with reasonable constraints? We now have a whole new paper that aims toward whole fulfillment of Boolean and linear arithmetic constraints on instruction at AAAI-2022. Congrats to Nick and Rafael!
The short article introduces a standard rational framework for reasoning about discrete and ongoing probabilistic styles in dynamical domains.
We analyze organizing in relational Markov conclusion processes involving discrete and ongoing states and actions, and an not known amount of objects (via probabilistic programming).
From the paper, we exploit the XADD details structure to carry out probabilistic inference in combined discrete-constant spaces successfully.
Paulius' Focus on algorithmic procedures for randomly building logic courses and probabilistic logic courses has long been recognized to your rules and practise of constraint programming (CP2020).
Our MLJ (2017) article on setting up with hybrid MDPs was accepted for presentation with the journal track.
For anyone who is attending AAAI this calendar year, you may be interested in checking out our papers that touch on fairness, abstraction and generalized sum-item difficulties.
Our paper on synthesizing programs with loops inside the presence of probabilistic noise, accepted the journal of approximate reasoning, has also been accepted into the ICAPS journal keep track of. Preprint to the entire paper in this article.