dusa
dusa copied to clipboard
robsimmons
A logic programming language that has features of both Datalog and answer set programming.
SEQ_CONCAT (n-ary) `concat [[a], [b], c] [d] [e, f] is [[a], [b], c, d, e, f]` Can be run backwards as long as there's only one free variable (prefix/postfix matching)...
Multiple possibilities here: ``` div 7 4 is 2 mod 7 4 is 3 ``` or ``` divmod 7 4 is [2, 3] ``` Relatedly, allowing multiplication to be run...
Sequences as an internal datatype are desirable. As a first step, they can be incorporated with the `SEQUENCE` builtin: ``` #builtin SEQUENCE seq a X :- seq 1 3 "hello"...
This is something that GraphiQL really usefully supports - if we'd like to help people use JSON EDBs through the Dusa API, we want to allow them to put in...
Minus acts like it can be run backwards, but it cannot. ``` y 4. x N :- y M, minus N 1 is M. ``` this should result in `x...
This is a medium-small refactor: repeated uses of the Dusa API will cause memory leaks, because the same hash-consing table is used accross multiple instances of Dusa objects. Based on...
I need to better understand how this relates to the "demand" or "magic sets" transformation, but I really think the right move for Dusa is to declare certain predicates to...
If we have two rules ``` a :- c X, c Y, c Z, d X Y Z. b :- c X, c Y, c Z, e Y X Z....
Right now if we have two rules: ``` a X Z Z :- c X Z. a X Y Z :- b X, b Y, c X Z. a X...
Metadata
Owner
Metadata
A logic programming language that has features of both Datalog and answer set programming.