Deciding the Bisimilarity Relation between Datalog Goals

DOI10.1007/978-3-642-33353-8_6zbMath1361.68029OpenAlexW118539919MaRDI QIDQ2915060

Philippe Balbiani, Antoun Yaacoub

Publication date: 21 September 2012

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33353-8_6

zbMATH Keywords

computational complexitybisimulationlogic programmingDatalogdecision methodequivalence of goals

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculi for synchrony and asynchrony
• An analysis of loop checking mechanisms for logic programs
• Observable behaviors and equivalences of logic programs
• Communicating sequential processes
• Loop checking in partial deduction
• Origins of bisimulation and coinduction
• Strongly equivalent logic programs