Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree.
Géraud SénizerguesPublished in: FOCS (1998)
Keyphrases
- equational theories
- equivalence relation
- random graphs
- theorem proving
- graph theoretic
- decision procedures
- graph matching
- linear separability
- weighted graph
- finite number
- query answering
- graph partitioning
- theorem prover
- description logics
- graph representation
- complex structures
- graph clustering
- graph databases
- graph mining
- query containment
- graph structure