{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:58:32Z","timestamp":1720227512954},"reference-count":86,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","award":["308433\/2014-9"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","award":["303920\/2016-5","420669\/2016-7"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"publisher","award":["2016\/18841-0","2015\/21880-4"],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"publisher","award":["001"],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.ijar.2019.04.003","type":"journal-article","created":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T15:45:40Z","timestamp":1555602340000},"page":"107-126","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["The finite model theory of Bayesian network specifications: Descriptive complexity and zero\/one laws"],"prefix":"10.1016","volume":"110","author":[{"given":"Fabio Gagliardi","family":"Cozman","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2297-6349","authenticated-orcid":false,"given":"Denis Deratani","family":"Mau\u00e1","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ijar.2019.04.003_br0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1049","article-title":"Decidability and expressiveness for first-order logics of probability","volume":"112","author":"Abadi","year":"1994","journal-title":"Inf. Comput."},{"issue":"1","key":"10.1016\/j.ijar.2019.04.003_br0020","doi-asserted-by":"crossref","first-page":"113","DOI":"10.2307\/2274958","article-title":"Reachability is harder for directed than for undirected finite graphs","volume":"55","author":"Ajtai","year":"1990","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.ijar.2019.04.003_br0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2820","article-title":"The DL-Lite family and relations","volume":"36","author":"Artale","year":"2009","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ijar.2019.04.003_br0040","series-title":"Description Logic Handbook","first-page":"47","article-title":"Basic description logics","author":"Baader","year":"2002"},{"key":"10.1016\/j.ijar.2019.04.003_br0050","series-title":"Representing and Reasoning With Probabilistic Knowledge: A Logical Approach","author":"Bacchus","year":"1990"},{"key":"10.1016\/j.ijar.2019.04.003_br0060","series-title":"Conference on Uncertainty in Artificial Intelligence","first-page":"219","article-title":"Using first-order probability logic for the construction of Bayesian networks","author":"Bacchus","year":"1993"},{"key":"10.1016\/j.ijar.2019.04.003_br0070","series-title":"ACM Symposium on Principles of Database Systems (PODS)","article-title":"Symmetric weighted first-order model counting","author":"Beame","year":"2015"},{"key":"10.1016\/j.ijar.2019.04.003_br0080","first-page":"993","article-title":"Latent Dirichlet allocation","volume":"3","author":"Blei","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.ijar.2019.04.003_br0090","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ijar.2016.10.001","article-title":"Negative probabilities in probabilistic logic programs","volume":"83","author":"Buchman","year":"2017","journal-title":"Int. J. Approx. Reason."},{"key":"10.1016\/j.ijar.2019.04.003_br0100","series-title":"Conference on Uncertainty in Artificial Intelligence","article-title":"Why rules are complex: real-valued probabilistic logic programs are not fully expressive","author":"Buchman","year":"2017"},{"issue":"25","key":"10.1016\/j.ijar.2019.04.003_br0110","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.89.258702","article-title":"Scale-free networks from varying vertex intrinsic fitness","volume":"89","author":"Caldarelli","year":"2002","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/j.ijar.2019.04.003_br0120","series-title":"AAAI","first-page":"602","article-title":"DL-Lite: tractable description logics for ontologies","author":"Calvanese","year":"2005"},{"issue":"1","key":"10.1016\/j.ijar.2019.04.003_br0130","doi-asserted-by":"crossref","DOI":"10.18637\/jss.v076.i01","article-title":"A probabilistic programming language","volume":"76","author":"Carpenter","year":"2017","journal-title":"J. Stat. Softw."},{"key":"10.1016\/j.ijar.2019.04.003_br0140","series-title":"URSW 2008-2010\/UniDL 2010","first-page":"1","article-title":"PR-OWL 2.0 \u2014 bridging the gap to OWL semantics","volume":"vol. 7123","author":"Carvalho","year":"2013"},{"key":"10.1016\/j.ijar.2019.04.003_br0150","series-title":"Conference on Formal Ontology in Information Systems","article-title":"PR-OWL: a framework for probabilistic ontologies","author":"Costa","year":"2006"},{"key":"10.1016\/j.ijar.2019.04.003_br0160","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.artint.2018.06.001","article-title":"The complexity of Bayesian networks specified by propositional and relational languages","volume":"262","author":"Cozman","year":"2018","journal-title":"Artif. Intell. J."},{"key":"10.1016\/j.ijar.2019.04.003_br0170","series-title":"Symbolic and Quantitative Approaches to Reasoning With Uncertainty","first-page":"93","article-title":"The descriptive complexity of Bayesian network specifications","author":"Cozman","year":"2017"},{"key":"10.1016\/j.ijar.2019.04.003_br0180","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1613\/jair.5482","article-title":"On the semantics and complexity of probabilistic logic programs","volume":"60","author":"Cozman","year":"2017","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ijar.2019.04.003_br0190","series-title":"Scalable Uncertainty Management","first-page":"36","article-title":"The complexity of plate probabilistic models","volume":"vol. 9310","author":"Cozman","year":"2015"},{"key":"10.1016\/j.ijar.2019.04.003_br0210","series-title":"Modeling and Reasoning With Bayesian Networks","author":"Darwiche","year":"2009"},{"key":"10.1016\/j.ijar.2019.04.003_br0220","series-title":"Encontro Nacional de Intelig\u00eancia Artificial e Computacional","article-title":"Encoding the consistency of relational Bayesian networks","author":"de Bona","year":"2017"},{"key":"10.1016\/j.ijar.2019.04.003_br0230","series-title":"Logical and Relational Learning","author":"de Raedt","year":"2008"},{"key":"10.1016\/j.ijar.2019.04.003_br0240","series-title":"Probabilistic Inductive Logic Programming","author":"de Raedt","year":"2010"},{"key":"10.1016\/j.ijar.2019.04.003_br0250","series-title":"Symbolic and Quantitative Approaches to Reasoning With Uncertainty","first-page":"192","article-title":"Marginals of DAG-isomorphic independence models","volume":"vol. 5590","author":"de Waal","year":"2009"},{"key":"10.1016\/j.ijar.2019.04.003_br0260","series-title":"Finite Model Theory","author":"Ebbinghaus","year":"1995"},{"key":"10.1016\/j.ijar.2019.04.003_br0270","series-title":"Soft Computing in Ontologies and Semantic Web","first-page":"3","article-title":"BayesOWL: uncertainty modeling in semantic web ontologies","volume":"vol. 204","author":"Ding","year":"2006"},{"key":"10.1016\/j.ijar.2019.04.003_br0280","series-title":"A Mathematical Introduction to Logic","author":"Enderton","year":"1972"},{"issue":"1","key":"10.1016\/j.ijar.2019.04.003_br0290","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u00f6s","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"issue":"1","key":"10.1016\/j.ijar.2019.04.003_br0300","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symb. Log."},{"issue":"3","key":"10.1016\/j.ijar.2019.04.003_br0310","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1017\/S1471068414000076","article-title":"Inference and learning in probabilistic logic programs using weighted Boolean formulas","volume":"15","author":"Fierens","year":"2014","journal-title":"Theory Pract. Log. Program."},{"key":"10.1016\/j.ijar.2019.04.003_br0320","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02759729","article-title":"Concerning measures on first-order calculi","volume":"2","author":"Gaifman","year":"1964","journal-title":"Isr. J. Math."},{"issue":"3","key":"10.1016\/j.ijar.2019.04.003_br0330","doi-asserted-by":"crossref","first-page":"495","DOI":"10.2307\/2273587","article-title":"Probabilities over rich languages, testing and randomness","volume":"47","author":"Gaifman","year":"1982","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.ijar.2019.04.003_br0340","series-title":"Introduction to Statistical Relational Learning","article-title":"Probabilistic relational models","author":"Getoor","year":"2007"},{"key":"10.1016\/j.ijar.2019.04.003_br0350","series-title":"Introduction to Statistical Relational Learning","author":"Getoor","year":"2007"},{"issue":"4","key":"10.1016\/j.ijar.2019.04.003_br0360","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","article-title":"Random graphs","volume":"30","author":"Gilbert","year":"1959","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.ijar.2019.04.003_br0370","doi-asserted-by":"crossref","first-page":"169","DOI":"10.2307\/2348941","article-title":"A language and program for complex Bayesian modelling","volume":"43","author":"Gilks","year":"1993","journal-title":"Statistician"},{"issue":"5","key":"10.1016\/j.ijar.2019.04.003_br0380","first-page":"17","article-title":"Range and degree of realizability of formulas in the restricted predicate calculus","volume":"2","author":"Glebskii","year":"1969","journal-title":"Kibernetika"},{"key":"10.1016\/j.ijar.2019.04.003_br0390","series-title":"Conference of Uncertainty in Artificial Intelligence","first-page":"90","article-title":"Dynamic construction of belief networks","author":"Goldman","year":"1990"},{"key":"10.1016\/j.ijar.2019.04.003_br0400","author":"Goodman"},{"key":"10.1016\/j.ijar.2019.04.003_br0410","series-title":"Conference on Uncertainty in Artificial Intelligence","first-page":"220","article-title":"Church: a language for generative models","author":"Goodman","year":"2008"},{"key":"10.1016\/j.ijar.2019.04.003_br0420","series-title":"Finite Model Theory and Its Applications","first-page":"125","article-title":"Finite model theory and descriptive complexity","author":"Gr\u00e4del","year":"2007"},{"key":"10.1016\/j.ijar.2019.04.003_br0430","series-title":"Finite Model Theory and Its Applications","author":"Gr\u00e4del","year":"2007"},{"key":"10.1016\/j.ijar.2019.04.003_br0440","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/S0019-9958(83)80043-6","article-title":"Complexity of the first-order theory of almost all finite structures","volume":"57","author":"Grandjean","year":"1983","journal-title":"Inf. Control"},{"key":"10.1016\/j.ijar.2019.04.003_br0450","series-title":"Conference on Uncertainty in Artificial Intelligence","first-page":"262","article-title":"Generating Bayesian networks from probability logic knowledge","author":"Haddawy","year":"1994"},{"key":"10.1016\/j.ijar.2019.04.003_br0460","series-title":"Reasoning About Uncertainty","author":"Halpern","year":"2003"},{"key":"10.1016\/j.ijar.2019.04.003_br0470","series-title":"Introduction to Statistical Relational Learning","first-page":"201","article-title":"Probabilistic entity-relationship models, PRMs, and plate models","author":"Heckerman","year":"2007"},{"key":"10.1016\/j.ijar.2019.04.003_br0480","series-title":"Conference of Uncertainty in Artificial Intelligence","first-page":"155","article-title":"A dynamic approach to probabilistic inference using Bayesian networks","author":"Horsch","year":"1990"},{"key":"10.1016\/j.ijar.2019.04.003_br0490","series-title":"Conference on Uncertainty in Artificial Intelligence","first-page":"266","article-title":"Relational Bayesian networks","author":"Jaeger","year":"1997"},{"key":"10.1016\/j.ijar.2019.04.003_br0500","series-title":"Symposium on Logic in Computer Science (LICS)","article-title":"Convergence results for relational Bayesian networks","author":"Jaeger","year":"1998"},{"key":"10.1016\/j.ijar.2019.04.003_br0510","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1016713501153","article-title":"Complex probabilistic modeling with recursive relational Bayesian networks","volume":"32","author":"Jaeger","year":"2001","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.ijar.2019.04.003_br0520","article-title":"Relational Bayesian Networks: A Survey","volume":"vol. 6","author":"Jaeger","year":"2002"},{"key":"10.1016\/j.ijar.2019.04.003_br0530","series-title":"Probabilistic Inductive Logic Programming","article-title":"Model-theoretic expressivity analysis","author":"Jaeger","year":"2008"},{"issue":"2","key":"10.1016\/j.ijar.2019.04.003_br0540","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1017\/S1471068413000707","article-title":"Lower complexity bounds for lifted inference","volume":"15","author":"Jaeger","year":"2014","journal-title":"Theory Pract. Log. Program."},{"key":"10.1016\/j.ijar.2019.04.003_br0550","series-title":"2nd Statistical Relational AI (StaRAI-12) Workshop","article-title":"Liftability of probabilistic inference: upper and lower bounds","author":"Jaeger","year":"2012"},{"key":"10.1016\/j.ijar.2019.04.003_br0560","series-title":"Probabilistic Graphical Models: Principles and Techniques","author":"Koller","year":"2009"},{"key":"10.1016\/j.ijar.2019.04.003_br0570","series-title":"AAAI","first-page":"390","article-title":"P-CLASSIC: a tractable probabilistic description logic","author":"Koller","year":"1997"},{"key":"10.1016\/j.ijar.2019.04.003_br0580","series-title":"Conference on Uncertainty in Artificial Intelligence","first-page":"302","article-title":"Object-oriented Bayesian networks","author":"Koller","year":"1997"},{"key":"10.1016\/j.ijar.2019.04.003_br0590","series-title":"National Conference on Artificial Intelligence (AAAI)","first-page":"580","article-title":"Probabilistic frame-based systems","author":"Koller","year":"1998"},{"key":"10.1016\/j.ijar.2019.04.003_br0600","series-title":"Elements of Finite Model Theory","author":"Libkin","year":"2004"},{"key":"10.1016\/j.ijar.2019.04.003_br0610","doi-asserted-by":"crossref","first-page":"3049","DOI":"10.1002\/sim.3680","article-title":"The BUGS project: evolution, critique and future directions","volume":"28","author":"Lunn","year":"2009","journal-title":"Stat. Med."},{"key":"10.1016\/j.ijar.2019.04.003_br0620","series-title":"Conference on Uncertainty in Artificial Intelligence","article-title":"Network engineering for complex belief networks","author":"Mahoney","year":"1996"},{"key":"10.1016\/j.ijar.2019.04.003_br0630","series-title":"NIPS Workshop on Probabilistic Programming","article-title":"CoreVenture: a high level, reflective machine language for probabilistic programming","author":"Mansinghka","year":"2014"},{"key":"10.1016\/j.ijar.2019.04.003_br0640","series-title":"European Conference on Machine Learning and Knowledge Discovery in Databases","first-page":"369","article-title":"First-order Bayes-ball","author":"Meert","year":"2010"},{"key":"10.1016\/j.ijar.2019.04.003_br0650","series-title":"IJCAI","article-title":"BLOG: probabilistic models with unknown objects","author":"Milch","year":"2005"},{"key":"10.1016\/j.ijar.2019.04.003_br0660","series-title":"Artificial Intelligence and Statistics","article-title":"Approximate inference for infinite contingent Bayesian networks","author":"Milch","year":"2005"},{"key":"10.1016\/j.ijar.2019.04.003_br0670","series-title":"Networks: An Introduction","author":"Newman","year":"2010"},{"key":"10.1016\/j.ijar.2019.04.003_br0680","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/j.ijar.2019.04.003_br0690","series-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl","year":"1988"},{"key":"10.1016\/j.ijar.2019.04.003_br0700","series-title":"International Joint Conference on Artificial Intelligence","first-page":"733","article-title":"IBAL: a probabilistic rational programming language","author":"Pfeffer","year":"2001"},{"key":"10.1016\/j.ijar.2019.04.003_br0710","series-title":"Practical Probabilistic Programming","author":"Pfeffer","year":"2016"},{"key":"10.1016\/j.ijar.2019.04.003_br0720","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(93)90061-F","article-title":"Probabilistic Horn abduction and Bayesian networks","volume":"64","author":"Poole","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ijar.2019.04.003_br0730","series-title":"International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"985","article-title":"First-order probabilistic inference","author":"Poole","year":"2003"},{"key":"10.1016\/j.ijar.2019.04.003_br0740","series-title":"Heuristics, Probability and Causality \u2014 A Tribute to Judea Pearl","first-page":"253","article-title":"Probabilistic programming languages: independent choices and deterministic systems","author":"Poole","year":"2010"},{"key":"10.1016\/j.ijar.2019.04.003_br0750","series-title":"International Workshop on Probabilistic Logic Programming","first-page":"69","article-title":"The distribution semantics is well-defined for all normal programs","volume":"vol. 1413","author":"Riguzzi","year":"2015"},{"issue":"2","key":"10.1016\/j.ijar.2019.04.003_br0760","first-page":"676","article-title":"Markov properties for mixed graphs","volume":"20","author":"Sadegui","year":"2014","journal-title":"Bernoulli"},{"key":"10.1016\/j.ijar.2019.04.003_br0770","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1006\/jcss.1995.1039","article-title":"Descriptive complexity of #P functions","volume":"50","author":"Saluja","year":"1995","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ijar.2019.04.003_br0780","series-title":"Int. Conference on Logic Programming","first-page":"715","article-title":"A statistical learning method for logic programs with distribution semantics","author":"Sato","year":"1995"},{"key":"10.1016\/j.ijar.2019.04.003_br0790","series-title":"Probabilistic Conditional Independence Structures","author":"Studeny","year":"2005"},{"key":"10.1016\/j.ijar.2019.04.003_br0800","series-title":"Probabilistic Databases","author":"Suciu","year":"2011"},{"key":"10.1016\/j.ijar.2019.04.003_br0810","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.ijar.2019.04.003_br0820","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1177\/0278364913481635","article-title":"KnowRob: a knowledge processing infrastructure for cognition-enabled robots","volume":"32","author":"Tenorth","year":"2013","journal-title":"Int. J. Robot. Res."},{"issue":"3","key":"10.1016\/j.ijar.2019.04.003_br0830","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/116825.116858","article-title":"Complexity classes defined by counting quantifiers","volume":"38","author":"T\u00f3ran","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/j.ijar.2019.04.003_br0840","series-title":"Neural Processing Information Systems","first-page":"1386","article-title":"On the completeness of first-order knowledge compilation for lifted probabilistic inference","author":"Van den Broeck","year":"2011"},{"key":"10.1016\/j.ijar.2019.04.003_br0850","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00289117","article-title":"The complexity of combinatorial problems with succinct input representation","volume":"23","author":"Wagner","year":"1986","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/j.ijar.2019.04.003_br0860","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1017\/S0269888900006147","article-title":"From knowledge bases to decision models","volume":"7","author":"Wellman","year":"1992","journal-title":"Knowl. Eng. Rev."},{"key":"10.1016\/j.ijar.2019.04.003_br0870","series-title":"Conference on Artificial Intelligence and Statistics","first-page":"1024","article-title":"A new approach to probabilistic programming inference","author":"Wood","year":"2014"}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X17305911?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X17305911?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T01:58:55Z","timestamp":1712455135000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X17305911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":86,"alternative-id":["S0888613X17305911"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2019.04.003","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The finite model theory of Bayesian network specifications: Descriptive complexity and zero\/one laws","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2019.04.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}