Logic programming approaches for representing and solving constraint satisfaction problems: A comparison

DOI10.1007/3-540-44404-1_15MaRDI QIDQ2767022zbMATH OpenFDO

Authors Nikolay Pelov, Emmanuel de Mot, Marc Denecker

Publication date 22 July 2002

Published in Lecture Notes in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44404-1_15

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On computing logic programs
• Logic programs with stable model semantics as a constraint programming paradigm
• Logic Programming in Knowledge Domains
• Constraint satisfaction using constraint logic programming
• Constraint programming for modelling and solving modal satisfiability

Cited in

(9)

• Evaluating ASP and commercial solvers on the CSPLib
• Model-based inference in CHARME.
• A simple and efficient Boolean solver for constraint logic programming
• Models and tools for improving efficiency in constraint logic programming
• An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
• CR-Prolog as a Specification Language for Constraint Satisfaction Problems
• scientific article; zbMATH DE number 4128359 (Why is no real title available?)
• scientific article; zbMATH DE number 1059315 (Why is no real title available?)
• On computing logic programs

This page was built for publication: Logic programming approaches for representing and solving constraint satisfaction problems: A comparison

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