The least fixpoint transformation for disjunctive logic programs
From MaRDI portal
Recommendations
Cites work
Cited in
(5)- A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters
- scientific article; zbMATH DE number 1407679 (Why is no real title available?)
- On the relations between disjunctive and linear logic programming
- scientific article; zbMATH DE number 1884399 (Why is no real title available?)
- Characterizing D-WFS: confluence and iterated GCWA
This page was built for publication: The least fixpoint transformation for disjunctive logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389092)