Cited By
View all- Bembenek AGreenberg MChong S(2024)Making Formulog Fast: An Argument for Unconventional Datalog EvaluationProceedings of the ACM on Programming Languages10.1145/36897548:OOPSLA2(1219-1248)Online publication date: 8-Oct-2024
- Shaikhha ASuciu DSchleich MNgo H(2024)Optimizing Nested Recursive QueriesProceedings of the ACM on Management of Data10.1145/36392712:1(1-27)Online publication date: 26-Mar-2024
- Kaminski MKostylev EGrau BMotik BHorrocks I(2021)The Complexity and Expressive Power of Limit DatalogJournal of the ACM10.1145/349500969:1(1-83)Online publication date: 22-Dec-2021
- Show More Cited By