CHR grammars

DOI10.1017/S1471068405002395zbMATH Open1104.68055OpenAlexW2911319454MaRDI QIDQ5696594FDOQ5696594

Authors: Henning Christiansen 

Publication date: 18 October 2005

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

Full work available at URL: https://doi.org/10.1017/s1471068405002395

Recommendations

• scientific article; zbMATH DE number 2090557
• scientific article; zbMATH DE number 42778
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
• A compositional semantics for CHR
• Logic Programming

zbMATH Keywords

constraint logic programmingconstraint handling rules

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42)

Cited In (7)

• Title not available (Why is that?)
• Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules
• Abductive Logic Grammars
• Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
• Parsing as semantically guided constraint solving: the role of ontologies
• On proving confluence modulo equivalence for Constraint Handling Rules
• Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities

This page was built for publication: CHR grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696594)