ECLiPSe – From LP to CLP

DOI10.1017/S1471068411000469zbMath1244.68020arXiv1012.4240OpenAlexW2007301302MaRDI QIDQ2893096

Joachim Schimpf, Kish Shen

Publication date: 25 June 2012

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

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

zbMATH Keywords

modellingconstraintPrologsolverlogic programming system

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17)

Related Items (13)

On the Gruenberg–Kegel graph of integral group rings of finite groups ⋮ Fifty Years of Prolog and Beyond ⋮ Concolic testing in logic programming ⋮ Unnamed Item ⋮ \textsc{Tor}: modular search with hookable disjunction ⋮ Unnamed Item ⋮ Cycle-maximal triangle-free graphs ⋮ Modeling and Optimization of Pickup and Delivery Problem Using Constraint Logic Programming ⋮ Modeling Block Structured Project Scheduling with Resource Constraints ⋮ Block structured scheduling using constraint logic programming ⋮ Search combinators ⋮ Unnamed Item ⋮ Branching interval algebra: an almost complete picture

Uses Software

• COMET
• MiniZinc

Cites Work

• Unnamed Item
• Interval propagation to reason about sets: Definition and implementation of a practical language
• Consistency in networks of relations
• Probe backtrack search for minimal perturbation in dynamic scheduling
• Theory and practice of constraint handling rules
• Generalized constraint propagation over the CLP scheme

This page was built for publication: ECLⁱPS^e – From LP to CLP