I gave a talk for the workshop on how the synthesis of logic and device Understanding, Particularly spots for example statistical relational learning, can empower interpretability.
Weighted design counting usually assumes that weights are only specified on literals, usually necessitating the need to introduce auxillary variables. We consider a new approach dependant on psuedo-Boolean capabilities, resulting in a more general definition. Empirically, we also get SOTA success.
The Lab carries out research in synthetic intelligence, by unifying Understanding and logic, with a the latest emphasis on explainability
If you are attending NeurIPS this 12 months, you might have an interest in checking out our papers that touch on morality, causality, and interpretability. Preprints are available on the workshop website page.
We consider the question of how generalized strategies (designs with loops) can be considered suitable in unbounded and continual domains.
A consortia project on honest techniques and goverance was recognized late previous calendar year. News connection listed here.
Keen on schooling neural networks with sensible constraints? We have a fresh paper that aims in direction of total pleasure of Boolean and linear arithmetic constraints on education at AAAI-2022. Congrats to Nick and Rafael!
A journal paper has actually been approved on prior constraints in tractable probabilistic types, offered about the papers tab. Congratulations Giannis!
Website link In the final 7 days of October, I gave a chat informally discussing explainability and moral accountability in artificial intelligence. Due to the organizers for that invitation.
Jonathan’s paper considers a lifted approached to weighted product integration, such as circuit development. Paulius’ paper develops a evaluate-theoretic perspective on weighted model counting and proposes a method to encode conditional weights on literals analogously to conditional https://vaishakbelle.com/ probabilities, which leads to important performance enhancements.
Paulius' Focus on algorithmic strategies for randomly building logic courses and probabilistic logic applications continues to be accepted to the concepts and practise of constraint programming (CP2020).
Our MLJ (2017) write-up on planning with hybrid MDPs was approved for presentation with the journal track.
Our Focus on synthesizing plans with loops in the presence of noise will appear within the Worldwide journal of approximate reasoning.
Our paper on synthesizing strategies with loops from the existence of probabilistic sounds, recognized the journal of approximate reasoning, has also been approved to your ICAPS journal keep track of. Preprint to the entire paper below.