Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
LogicBlox
open-in-new
<h2 id="features">Features</h2> <ul><li><a href="/facts/Stratification_(mathematics)/RXXeG04r">Stratified</a> negation<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a></li> <li><a href="/facts/Aggregate_function/685obrqz">Aggregate functions</a><a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a></li> <li>Evaluation using a novel worst-case optimal <a href="/facts/Join_algorithm/Cxl5lxcR">join algorithm</a>.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a><a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a></li> <li><a href="/facts/Data_constructor/Fn9KhnAb">Data constructors</a></li> <li>Static typing<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a></li> <li>A <a href="/facts/Modular_programming/sNoqKvRD">module</a> system</li> <li><a href="/facts/Probabilistic_programming/73uGIo5w">Probabilistic programming</a> features</li> <li><a href="/facts/Incremental_computing/4cCcb2dp">Incremental computation</a><a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a></li> <li>Debugging with provenance<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a><a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a></li></ul> <h3>Notes</h3> <h3>Sources</h3> <ul><li>Green, Todd J.; Aref, Molham; Karvounarakis, Grigoris (2012). Barceló, Pablo; Pichler, Reinhard (eds.). <a href="https://link.springer.com/chapter/10.1007/978-3-642-32925-8_1"><i>LogicBlox, Platform and Language: A Tutorial</i></a>. <i>Datalog in Academia and Industry</i>. Lecture Notes in Computer Science. Vol. 7494. Berlin, Heidelberg: Springer. pp. 1–8. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2F978-3-642-32925-8_1">10.1007/978-3-642-32925-8_1</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3-642-32925-8.</li> <li>Aref, Molham; ten Cate, Balder; Green, Todd J.; Kimelfeld, Benny; Olteanu, Dan; Pasalic, Emir; Veldhuizen, Todd L.; Washburn, Geoffrey (2015-05-27). <a href="https://doi.org/10.1145/2723372.2742796">"Design and Implementation of the LogicBlox System"</a>. <i>Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data</i>. SIGMOD '15. New York, NY, USA: Association for Computing Machinery. pp. 1371–1382. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1145%2F2723372.2742796">10.1145/2723372.2742796</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-4503-2758-9. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:2161070">2161070</a>.</li> <li>Kifer, Michael; Liu, Yanhong Annie (2018-09-19). <a href="https://books.google.com/books?id=q6dwDwAAQBAJ&dq=%22LogicBlox%22+-wikipedia&pg=PA335"><i>Declarative Logic Programming: Theory, Systems, and Applications</i></a>. Morgan & Claypool. p. 345. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-970001-97-6.</li></ul> <h2 id="further-reading">Further reading</h2> <ul><li>Halpin, Terry; Rugaber, Spencer (2014-11-13). <a href="https://books.google.com/books?id=UBYeBQAAQBAJ&dq=logicblox&pg=PP1"><i>LogiQL: A Query Language for Smart Databases</i></a>. CRC Press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-4822-4493-9.</li></ul> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Datalog/67jbYWDb">Datalog</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Antoniadis, Tony; Triantafyllou, Konstantinos; Smaragdakis, Yannis (2017-06-18). "Porting doop to Soufflé". Proceedings of the 6th ACM SIGPLAN International Workshop on State of the Art in Program Analysis. SOAP 2017. New York, NY, USA: Association for Computing Machinery. pp. 25–30. doi:10.1145/3088515.3088522. ISBN 978-1-4503-5072-3. S2CID 3074689. <a href="978-1-4503-5072-3" target="_blank">978-1-4503-5072-3</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>"Predictix Acquires LogicBlox". mergr.com. Retrieved 2024-06-08. <a href="https://mergr.com/predictix-acquires-logicblox" target="_blank">https://mergr.com/predictix-acquires-logicblox</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>"Infor Acquires Predictix". finance.yahoo.com. Retrieved 2024-06-08. <a href="https://finance.yahoo.com/news/infor-acquires-predictix-120000577.html" target="_blank">https://finance.yahoo.com/news/infor-acquires-predictix-120000577.html</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>"6.4. Negation - LogicBlox 3.10 Reference Manual". developer.logicblox.com. Retrieved 2023-03-04. "Additionally, negation is only allowed when the platform can determine a way to stratify all rules and constraints that use negation." <a href="https://developer.logicblox.com/content/docs/core-reference/webhelp/formula-negation.html" target="_blank">https://developer.logicblox.com/content/docs/core-reference/webhelp/formula-negation.html</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>"Chapter 7. Rules - LogicBlox 3.10 Reference Manual". developer.logicblox.com. Retrieved 2023-03-04. <a href="https://developer.logicblox.com/content/docs/core-reference/webhelp/rules.html#rules-aggregation" target="_blank">https://developer.logicblox.com/content/docs/core-reference/webhelp/rules.html#rules-aggregation</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Veldhuizen, Todd L. (2013-12-20). "Leapfrog Triejoin: a worst-case optimal join algorithm". arXiv:1210.0481 [cs.DB]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Aberger, Christopher R.; Tu, Susan; Olukotun, Kunle; Ré, Christopher (May 2016). "Old techniques for new join algorithms: A case study in RDF processing". 2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW). pp. 97–102. arXiv:1602.03557. doi:10.1109/ICDEW.2016.7495625. ISBN 978-1-5090-2109-3. S2CID 10016546. <a href="978-1-5090-2109-3" target="_blank">978-1-5090-2109-3</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Zook, David; Pasalic, Emir; Sarna-Starosta, Beata (2009). Gill, Andy; Swift, Terrance (eds.). Typed Datalog. Practical Aspects of Declarative Languages. Lecture Notes in Computer Science. Vol. 5418. Berlin, Heidelberg: Springer. pp. 168–182. doi:10.1007/978-3-540-92995-6_12. ISBN 978-3-540-92995-6. "Our type system has been implemented as a part of the LogicBlox development environment." <a href="978-3-540-92995-6" target="_blank">978-3-540-92995-6</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>Singh, Shikha; Madaminov, Sergey; Bender, Michael A.; Ferdman, Michael; Johnson, Ryan; Moseley, Benjamin; Ngo, Hung; Nguyen, Dung; Olesen, Soeren; Stirewalt, Kurt; Washburn, Geoffrey (May 2020). "A Scheduling Approach to Incremental Maintenance of Datalog Programs". 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS). pp. 864–873. doi:10.1109/IPDPS47924.2020.00093. ISBN 978-1-7281-6876-0. S2CID 216513350. <a href="978-1-7281-6876-0" target="_blank">978-1-7281-6876-0</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Köhler, Sven; Ludäscher, Bertram; Smaragdakis, Yannis (2012). Barceló, Pablo; Pichler, Reinhard (eds.). Declarative Datalog Debugging for Mere Mortals. Datalog in Academia and Industry. Lecture Notes in Computer Science. Vol. 7494. Berlin, Heidelberg: Springer. pp. 111–122. doi:10.1007/978-3-642-32925-8_12. ISBN 978-3-642-32925-8. <a href="978-3-642-32925-8" target="_blank">978-3-642-32925-8</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>"Chapter 17. Provenance". LogicBlox 3.10 Reference Manual. Retrieved 2023-03-11. <a href="https://developer.logicblox.com/content/docs/core-reference/webhelp/provenance.html" target="_blank">https://developer.logicblox.com/content/docs/core-reference/webhelp/provenance.html</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> </ol>