A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters (Q1378382)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters |
scientific article; zbMATH DE number 1117561
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters |
scientific article; zbMATH DE number 1117561 |
Statements
A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters (English)
0 references
2 June 1998
0 references
Datalog programs
0 references
Presburger arithmetic
0 references
Petri nets
0 references
0.86091053
0 references
0.8547909
0 references
0.8512499
0 references
0.85037076
0 references
0.8427336
0 references
0.83853656
0 references
0.83620155
0 references
0 references
