zlacker

[return to "Can logic programming be liberated from predicates and backtracking? [pdf]"]
1. rebane+0I2[view] [source] 2024-10-13 11:09:06
>>matt_d+(OP)
Datalog does not use backtracking, and is getting ever increasingly more popular.

See: - The fastest non-incremental embedded Datalog engine https://github.com/s-arash/ascent - The state-of-the-art non-embedded and non-incremental Datalog engine https://github.com/knowsys/nemo - A python library that contains an embedded incremental Datalog engine https://github.com/brurucy/pydbsp - A Rust library that provides a embedded incremental Datalog engine over property graphs https://github.com/brurucy/materialized-view

◧◩
2. lapino+kO2[view] [source] 2024-10-13 12:22:19
>>rebane+0I2
Datalog is a nice query language but it is far more limited than prolog or general purpose logic programming.
◧◩◪
3. convol+ap3[view] [source] 2024-10-13 17:08:06
>>lapino+kO2
there is a really interesting space between queries and prolog which includes mundane junk like encoding and rendering and data formatting changes that benefits in evaluation from having less power but maintains the lovely expressibility and analysis that we get from 'real' logic programming.

there's lots of exploring left to do

[go to top]