Open Access
Constraint Logic Programming.
Kim Marriott,Peter J. Stuckey,Mark Wallace +2 more
- 01 Jan 2006
pp 409-452
22
TL;DR: This chapter reviews that constraint logic programming (CLP) is the merger of two declarative paradigms: constraint solving and logic programming.
read more
About: The article was published on 01 Jan 2006. and is currently open access. The article focuses on the topics: Constraint logic programming & Concurrent constraint logic programming.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Natural domain SMT: a preliminary assessment
Scott Cotton
- 08 Sep 2010
TL;DR: A DPLL-like algorithm for SMT solving in which the search takes place over the natural domain of the variables in the problem, which can sometimes outperform leading SMT solvers but that the method is not yet robust.
42
Automated construction sequencing and scheduling from functional requirements
TL;DR: A model called FReMAS – a Functional Requirement Model for Automatic Sequencing – which is an attempt to automate sequencing and scheduling from functional requirements provides a generic representation schema and a systematic reasoning framework to capture, reason and convert functional requirements into temporal constraints between schedule elements.
41
Well-founded semantics for hybrid rules
Wlodzimierz Drabent,Jan Maluszynski +1 more
- 07 Jun 2007
TL;DR: A declarative semantics of hybrid programs and a formal operational semantics are defined that provides a basis for hybrid implementations combining Prolog with constraint solvers and can be seen as an extension of SLS-resolution.
40
CP-Based Decision Support for Project Driven Manufacturing
Zbigniew Banaszak
- 01 Jan 2006
TL;DR: Some of the most challenging issues that arise in the domain of distributed manufacturing technology and management include manufacturability analysis, validation and evaluation of process plans, partnership in virtual enterprises, process design, and optimization of production plans and schedules.
24
Hybrid Rules with Well-Founded Semantics
TL;DR: A declarative semantics of hybrid programs and a goal-driven formal operational semantics are defined, which provides a basis for hybrid implementations combining Prolog with constraint solvers (such as ontology reasoners).
Related Papers (5)
Spiro Michaylov,Frank Pfenning +1 more
- 01 Jan 1993
Herbert Kuchen
- 01 Jan 2011
Helmut Simonis
- 01 Jan 1995
Francesca Rossi
- 01 Jan 2003