Decidability properties for fragments of CHR

DOI10.1017/S1471068410000311zbMath1209.68091DBLPjournals/tplp/GabbrielliMMS10arXiv1007.4476OpenAlexW2021616063WikidataQ62043709 ScholiaQ62043709MaRDI QIDQ3585171

Maria Chiara Meo, Jacopo Mauro, Jon Sneyers, Maurizio Gabbrielli

Publication date: 19 August 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.4476

zbMATH Keywords

expressivityconstraint programmingwell-structured transition systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logic programming (68N17)

Cites Work

• A timed concurrent constraint language.
• As time goes by: Constraint Handling Rules
• Constraint Handling Rules
• Well-structured transition systems everywhere!

This page was built for publication: Decidability properties for fragments of CHR