Deciding the bisimilarity relation between datalog goals

Authors:
Philippe Balbiani;Antoun Yaacoub
Affiliations:
Institut de Recherche en Informatique de Toulouse, CNRS -- Université de Toulouse, Toulouse Cedex 9, France;Institut de Recherche en Informatique de Toulouse, CNRS -- Université de Toulouse, Toulouse Cedex 9, France
Venue:
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Year:
2012

Citing 10
Cited 0

Foundations of logic programming

Foundations of logic programming
Equivalences of logic programs

Proceedings on Third international conference on logic programming
An analysis of loop checking mechanisms for logic programs

Theoretical Computer Science
Observable behaviors and equivalences of logic programs

Information and Computation
Communicating sequential processes

Communications of the ACM
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
On Observing Nondeterminism and Concurrency

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Halting Problem of One Binary Horn Clause is Undecidable

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
On the origins of bisimulation and coinduction

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the concept of bisimulation between Datalog goals: two Datalog goals are bisimilar with respect to a given Datalog program when their SLD-trees, considered as relational structures, are bisimilar. We address the problem of deciding whether two given goals are bisimilar with respect to given programs. When the given programs are hierarchical or restricted, this problem is decidable in 2EXPTIME.