Abstract. We present a method for characterizing the least fixed-points of a certain class of Datalog programs in Presburger arithmetic. The method consists in applying a set of rules that transform general computation paths into "canonical " ones. We use the method for treating the problem of reachability in the field of Petri nets, thus relating some unconnected results and extending them in several directions.
|
755
|
Constraint Logic Programming
– Jaffar, Lassez
- 1987
|
|
358
|
N.: Automatic discovery of linear restraints among variables of a program
– Cousot, Halbwachs
- 1978
|
|
337
|
Constraint Query languages
– Kanellakis, Kuper, et al.
- 1990
|
|
244
|
Modeling with Generalized Stochastic Petri Nets
– Marsan, Balbo, et al.
- 1995
|
|
204
|
Automated Theorem Proving: A Logical Basis
– Loveland
- 1978
|
|
75
|
Decidability and Decomposition in Process Algebras
– Christensen
- 1993
|
|
68
|
Recursive query processing: the power of logic
– Vieille
- 1989
|
|
67
|
Handling Infinite Temporal Data
– Kabanza, Stevenne, et al.
- 1995
|
|
62
|
Diophantine equations, presburger arithmetic and finite automata
– Boudet, Comon
- 1996
|
|
59
|
Delay analysis in synchronous programs
– Halbwachs
- 1993
|
|
56
|
Transformations and decompositions of nets
– Berthelot
- 1987
|
|
52
|
A Closed Form for Datalog Queries with Integer Order
– Revesz
- 1990
|
|
49
|
A logic programming view of CLP
– Maher
- 1993
|
|
43
|
On the Representation of Infinite Temporal Data and Queries
– Baudinet, Niezette, et al.
- 1991
|
|
41
|
Temporal deductive databases and infinite objects
– Chomicki, Imielinski
- 1988
|
|
40
|
Deriving Constraints among Argument Sizes in Logic Programs
– Gelder
- 1990
|
|
36
|
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
– Esparza
- 1997
|
|
32
|
On the reachability problem for 5-dimensional vector addition systems
– Hopcroft, Pansiot
- 1979
|
|
25
|
Efficient solution of linear diophantine equations
– Clausen, Fortenbacher
- 1989
|
|
25
|
Net Theory and the Modelling of
– Peterson
|
|
20
|
Checking System Properties via Integer Programming
– Melzer, Esparza
- 1996
|
|
20
|
Termination proofs for logic programs based on predicate inequalities
– Plumer
- 1990
|
|
17
|
Proof-tree Transformation Theorems and their Applications
– Ramakrishnan, Sagiv, et al.
- 1989
|
|
14
|
Proving safety properties of infinite state systems by compilation into Presburger arithmetic
– Fribourg, Olsén
- 1997
|
|
13
|
Decidability issues for Petri nets
– Esparza, Nielsen
- 1994
|
|
11
|
R'eseaux de PETRI: th'eorie et pratique
– Brams
- 1983
|
|
7
|
Bottom-up evaluation of Datalog programs with arithmetic constraints
– Fribourg, Peixoto
- 1994
|
|
5
|
Datalog programs with arithmetical constraints: hierarchic, periodic and spiralling least fixed points. Research report 95-26, Laboratoire Informatique, ' Ecole Normale Sup'erieure
– Fribourg, Ols'en
- 1995
|
|
4
|
The denotational semantics of Horn clauses as a production system
– Lassez, Maher
- 1983
|
|
2
|
On the detection and elimination of redundant derivations during bottom-up execution
– Helm
- 1989
|
|
2
|
Equivalences of Logic Programs". Foundations of Deductive Databases
– Maher
- 1988
|
|
2
|
Schreye, "Deriving Termination Proofs for Logic Programs, using Abstract Procedures
– Verschaetse, De
- 1991
|
|
1
|
Semigroups, Presburgerformulas and languages
– Ginsburg, Spanier
- 1966
|
|
1
|
on Principles of Database Systems
– Tamaki, Sato
- 1992
|
|
