An Abductive Treatment of Long Distance Dependencies in CHR

Dahl, Verónica

doi:10.1007/11424574_2

Cited by 2 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CHRG's inherent support for context-sensitive rules readily allows linguistic phenomena such as long-distance reference and coordination to be modeled naturally (Christiansen 2005;Aguilar-Solis and Dahl 2004;Dahl 2004). CHRG grammar rules can also use extra-grammatical hypotheses, modeled as regular CHR constraints.…”

Section: Computational Linguisticsmentioning

confidence: 99%

As time goes by: Constraint Handling Rules

Sneyers¹,

Weert²,

Schrijvers³

et al. 2009

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language.CHR-related research has surged during the decade following the previous survey by Frühwirth (1998). Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions and applications.

show abstract

Section: Computational Linguisticsmentioning

confidence: 99%

As time goes by: Constraint Handling Rules

Sneyers¹,

Weert²,

Schrijvers³

et al. 2009

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…The chr grammar system [7,9], or chrg for short, translates a grammar notation into chr rules that parse a text bottom-up, and which also interacts with various sorts of hypotheses. Other applications of chr for language processing that are not commented on here may be found in [13,[22][23][24][51][52][53].…”

Section: Evaluation and Comparison With Related Workmentioning

confidence: 99%

Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules

Christiansen

2009

Journal of Applied Logic

View full text Add to dashboard Cite

Constraint Handling Rules (CHR) is an extension to Prolog which opens up a spectrum of hypothesis-based reasoning in logic programs without additional interpretation overhead. Abduction with integrity constraints is one example of hypothesis-based reasoning which can be implemented directly in Prolog and CHR with a straightforward use of available and efficiently implemented facilities. The present paper clarifies the semantic foundations for this way of doing abduction in CHR and Prolog as well as other examples of hypothesis-based reasoning that is possible, including assumptive logic programming, hypotheses with priority and scope, and nonmonotonic reasoning. Examples are presented as executable code so the paper may also serve the additional purpose of a practical guide for developing such programs, and it is demonstrated that the approach provides a seamless integration with existing constraint solvers.

show abstract

An Abductive Treatment of Long Distance Dependencies in CHR

Cited by 2 publications

References 12 publications

As time goes by: Constraint Handling Rules

As time goes by: Constraint Handling Rules

Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules

Contact Info

Product

Resources

About