\n
\n\n \n \n \n \n \n \n Scaling up Probabilistic Inference in Linear and Non-Linear Hybrid Domains by Leveraging Knowledge Compilation.\n \n \n \n \n\n\n \n Fuxjaeger, A.; and Belle, V.\n\n\n \n\n\n\n
CoRR, abs/1811.12127. 2018.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1811-12127,\n\tArchiveprefix = {arXiv},\n\tAuthor = {Anton Fuxjaeger and Vaishak Belle},\n\tBibsource = {dblp computer science bibliography, https://dblp.org},\n\tBiburl = {https://dblp.org/rec/bib/journals/corr/abs-1811-12127},\n\tDate-Added = {2019-06-07 12:10:52 +0100},\n\tDate-Modified = {2019-06-07 12:10:52 +0100},\n\tEprint = {1811.12127},\n\tJournal = {CoRR},\n\tTimestamp = {Fri, 30 Nov 2018 12:44:28 +0100},\n\tTitle = {Scaling up Probabilistic Inference in Linear and Non-Linear Hybrid Domains by Leveraging Knowledge Compilation},\n\tUrl = {http://arxiv.org/abs/1811.12127},\n\tVolume = {abs/1811.12127},\n\tYear = {2018},\n\tBdsk-Url-1 = {http://arxiv.org/abs/1811.12127}}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n Abstracting Probabilistic Relational Models.\n \n \n \n \n\n\n \n Belle, V.\n\n\n \n\n\n\n
CoRR, abs/1810.02434. 2018.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1810-02434,\n\tArchiveprefix = {arXiv},\n\tAuthor = {Vaishak Belle},\n\tBibsource = {dblp computer science bibliography, https://dblp.org},\n\tBiburl = {https://dblp.org/rec/bib/journals/corr/abs-1810-02434},\n\tDate-Added = {2019-06-07 12:10:38 +0100},\n\tDate-Modified = {2019-06-07 12:10:38 +0100},\n\tEprint = {1810.02434},\n\tJournal = {CoRR},\n\tTimestamp = {Tue, 30 Oct 2018 10:49:09 +0100},\n\tTitle = {Abstracting Probabilistic Relational Models},\n\tUrl = {http://arxiv.org/abs/1810.02434},\n\tVolume = {abs/1810.02434},\n\tYear = {2018},\n\tBdsk-Url-1 = {http://arxiv.org/abs/1810.02434}}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n Learning Probabilistic Logic Programs in Continuous Domains.\n \n \n \n \n\n\n \n Speichert, S.; and Belle, V.\n\n\n \n\n\n\n
CoRR, abs/1807.05527. 2018.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1807-05527,\n\tArchiveprefix = {arXiv},\n\tAuthor = {Stefanie Speichert and Vaishak Belle},\n\tBibsource = {dblp computer science bibliography, https://dblp.org},\n\tBiburl = {https://dblp.org/rec/bib/journals/corr/abs-1807-05527},\n\tDate-Added = {2019-06-07 12:10:31 +0100},\n\tDate-Modified = {2019-06-07 12:10:31 +0100},\n\tEprint = {1807.05527},\n\tJournal = {CoRR},\n\tTimestamp = {Mon, 13 Aug 2018 16:46:00 +0200},\n\tTitle = {Learning Probabilistic Logic Programs in Continuous Domains},\n\tUrl = {http://arxiv.org/abs/1807.05527},\n\tVolume = {abs/1807.05527},\n\tYear = {2018},\n\tBdsk-Url-1 = {http://arxiv.org/abs/1807.05527}}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n Tractable Querying and Learning in Hybrid Domains via Sum-Product Networks.\n \n \n \n \n\n\n \n Bueff, A.; Speichert, S.; and Belle, V.\n\n\n \n\n\n\n
CoRR, abs/1807.05464. 2018.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1807-05464,\n\tArchiveprefix = {arXiv},\n\tAuthor = {Andreas Bueff and Stefanie Speichert and Vaishak Belle},\n\tBibsource = {dblp computer science bibliography, https://dblp.org},\n\tBiburl = {https://dblp.org/rec/bib/journals/corr/abs-1807-05464},\n\tDate-Added = {2019-06-07 12:10:24 +0100},\n\tDate-Modified = {2019-06-07 12:10:24 +0100},\n\tEprint = {1807.05464},\n\tJournal = {CoRR},\n\tTimestamp = {Mon, 13 Aug 2018 16:47:39 +0200},\n\tTitle = {Tractable Querying and Learning in Hybrid Domains via Sum-Product Networks},\n\tUrl = {http://arxiv.org/abs/1807.05464},\n\tVolume = {abs/1807.05464},\n\tYear = {2018},\n\tBdsk-Url-1 = {http://arxiv.org/abs/1807.05464}}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems.\n \n \n \n \n\n\n \n Belle, V.; and Levesque, H. J.\n\n\n \n\n\n\n
Artificial Intelligence, 262: 189 - 221. 2018.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@article{Belle2018189,\n\tAuthor = {Vaishak Belle and Hector J. Levesque},\n\tDate-Added = {2018-06-27 15:25:11 +0000},\n\tDate-Modified = {2018-06-27 15:25:51 +0000},\n\tDoi = {https://doi.org/10.1016/j.artint.2018.06.003},\n\tIssn = {0004-3702},\n\tJournal = {Artificial Intelligence},\n\tKeywords = {Cognitive robotics},\n\tPages = {189 - 221},\n\tTitle = {Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems},\n\tUrl = {https://cl.ly/sY32/download/discrete-continuous-noisy-2.pdf},\n\tVolume = {262},\n\tYear = {2018},\n\tBdsk-Url-1 = {https://www.sciencedirect.com/science/article/pii/S000437021830314X},\n\tBdsk-Url-2 = {https://doi.org/10.1016/j.artint.2018.06.003}}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n Efficient Symbolic Integration for Probabilistic Inference.\n \n \n \n \n\n\n \n Kolb, S.; Mladenov, M.; Sanner, S.; Belle, V.; and Kersting, K.\n\n\n \n\n\n\n In
IJCAI, 2018. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{ijcai18,\n\tAuthor = {Samuel Kolb and Martin Mladenov and Scott Sanner and Vaishak Belle and Kristian Kersting},\n\tBooktitle = {IJCAI},\n\tDate-Added = {2018-05-01 10:05:24 +0000},\n\tDate-Modified = {2018-05-08 10:22:05 +0000},\n\tTitle = {Efficient Symbolic Integration for Probabilistic Inference},\n\tUrl = {https://d.pr/free/f/ycfrsj},\n\tYear = {2018},\n\tBdsk-Url-1 = {https://d.pr/free/f/ycfrsj}}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n Planning in hybrid relational MDPs.\n \n \n \n\n\n \n Nitti, D.; Belle, V.; De Laet, T.; and De Raedt, L.\n\n\n \n\n\n\n In
ICAPS (Journal Track), 2018. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Nitti2018,\n\tAuthor = {Nitti, Davide and Belle, Vaishak and De Laet, Tinne and De Raedt, Luc},\n\tBooktitle = {ICAPS (Journal Track)},\n\tDate-Added = {2018-04-26 14:40:07 +0000},\n\tDate-Modified = {2018-04-26 14:40:39 +0000},\n\tTitle = {Planning in hybrid relational MDPs},\n\tYear = {2018},\n\tBdsk-Url-1 = {https://doi.org/10.1007/s10994-017-5669-x},\n\tBdsk-Url-2 = {http://dx.doi.org/10.1007/s10994-017-5669-x}}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n On Plans With Loops and Noise.\n \n \n \n \n\n\n \n Belle, V.\n\n\n \n\n\n\n In
AAMAS, 2018. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{on-plans-with-loops-and-noise,\n\tAuthor = {V. Belle},\n\tBooktitle = {AAMAS},\n\tDate-Added = {2018-04-26 14:39:06 +0000},\n\tDate-Modified = {2018-04-26 14:39:46 +0000},\n\tTitle = {On Plans With Loops and Noise},\n\tUrl = {https://d.pr/free/f/CEBE0r},\n\tYear = {2018},\n\tBdsk-Url-1 = {https://d.pr/free/f/CEBE0r}}\n\n
\n
\n\n\n\n
\n
\n\n \n \n \n \n \n \n Probabilistic Planning by Probabilistic Programming.\n \n \n \n \n\n\n \n Belle, V.\n\n\n \n\n\n\n In
AAAI Workshop on Planning and Inference, 2018. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{probabilistic-planning-by-probabilistic-programming,\n\tAuthor = {V. Belle},\n\tBooktitle = {AAAI Workshop on Planning and Inference},\n\tDate-Added = {2018-04-26 14:37:52 +0000},\n\tDate-Modified = {2018-04-26 14:38:55 +0000},\n\tTitle = {Probabilistic Planning by Probabilistic Programming},\n\tUrl = {https://arxiv.org/pdf/1801.08365.pdf},\n\tYear = {2018},\n\tBdsk-Url-1 = {https://arxiv.org/pdf/1801.08365.pdf}}\n\n
\n
\n\n\n\n