A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters (Q1378382): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Datalog / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters |
scientific article |
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
