Extending Equation Solving and Constraint Handling in Logic Programming

1989 ◽  
pp. 87-115
Author(s):  
M. DINCBAS ◽  
H. SIMONIS ◽  
P. VAN HENTENRYCK
Keyword(s):  
Logic Programming ◽  
Constraint Handling ◽  
Equation Solving

scholarly journals As time goes by: Constraint Handling Rules

2009 ◽  
Vol 10 (1) ◽  
pp. 1-47 ◽  
Author(s):  
JON SNEYERS ◽  
PETER VAN WEERT ◽  
TOM SCHRIJVERS ◽  
LESLIE DE KONINCK
Keyword(s):  
Logic Programming ◽  
General Purpose ◽  
Constraint Handling ◽  
Special Issue ◽  
Previous Survey ◽  
Related Research ◽  
Research Areas ◽  
Wide Range ◽  
Rewrite Rules ◽  
High Level

AbstractConstraint 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. Constraint Handling Rules related research has surged during the decade following the previous survey by Frühwirth (J. Logic Programming, Special Issue on Constraint Logic Programming, 1998, vol. 37, nos. 1–3, pp. 95–138). 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.

scholarly journals Tabling, Rational Terms, and Coinduction Finally Together!

2014 ◽  
Vol 14 (4-5) ◽  
pp. 429-443 ◽  
Author(s):  
THEOFRASTOS MANTADELIS ◽  
RICARDO ROCHA ◽  
PAULO MOURA
Keyword(s):  
Logic Programming ◽  
Internal Representation ◽  
Canonical Representation ◽  
Constraint Handling ◽  
Cyclic Behavior ◽  
Logic Programs ◽  
Finite Representation ◽  
Computational Performance ◽  
Definite Clause Grammars ◽  
Rational Term

AbstractTabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling often improves computational performance. Rational term are terms with one or more infinite sub-terms but with a finite representation. Rational terms can be generated in Prolog by omitting the occurs check when unifying two terms. Applications of rational terms include definite clause grammars, constraint handling systems, and coinduction. In this paper, we report our extension of YAP's Prolog tabling mechanism to support rational terms. We describe the internal representation of rational terms within the table space and prove its correctness. We then use this extension to implement a tabling based approach to coinduction. We compare our approach with current coinductive transformations and describe the implementation. In addition, we present an algorithm that ensures a canonical representation for rational terms.

Sign in / Sign up

Export Citation Format

Share Document