Matches in SemOpenAlex for { <https://semopenalex.org/work/W1497382039> ?p ?o ?g. }
- W1497382039 endingPage "494" @default.
- W1497382039 startingPage "453" @default.
- W1497382039 abstract "This chapter addresses the integration of constraints and s earch into programming languages from three different points of views. It first focuses on the use of constraints to model combinatorial optimization problem and to easily implement search procedures, then it considers the use of constraints for supporting conc urrent computations and finally turns to the use of constraints to enable open implementations of constraints solvers. The idea of approaching hard combinatorial optimization problems through a combination of search and constraint solving appeared first in log ic programming. The genesis and growth of constraint programming within logic programming is not surprising as it catered to two fundamental needs: a declarative style and non-determinism. Despite the continued support of logic programming for constraint programmers, research efforts were initiated to import constraint technol ogies into other paradigms (in particular procedural and object-oriented paradigms) to cate r to a broader audience and leverage constraint-based techniques in novel areas. The first mo tivation behind a transition is a desire to ease the adoption of a successful technology. Moving constraints to a platform and paradigm widely accepted would facilitate their adoption within existing software systems by reducing resistance to the introduction of technologies and tools perceived as radically different. A second motivation is that constraints are vers atile abstractions equally well suited for modeling and supporting concurrency. In particular, concurrent computation can be seen as agents that communicate and coordinate through a shared constraint store. Third, constraint-based techniques can leverage the semantics of a target application domain to design specialized constraints or search procedures that are more effective than off-the-shelves constraints. The ability, for domain spec ialists, to easily create, customize and extend both constraints solvers and search is therefore a necessity for adaptability. The continued success and growth of constraints depends on the availability of flexible, extensible, versatile and easy to use solvers. It is conting ent on retaining performance that" @default.
- W1497382039 created "2016-06-24" @default.
- W1497382039 creator A5021717408 @default.
- W1497382039 creator A5032517478 @default.
- W1497382039 creator A5084227795 @default.
- W1497382039 date "2006-01-01" @default.
- W1497382039 modified "2023-09-24" @default.
- W1497382039 title "Constraints in Procedural and Concurrent Languages" @default.
- W1497382039 cites W1525837752 @default.
- W1497382039 cites W1976195354 @default.
- W1497382039 cites W1982482731 @default.
- W1497382039 cites W1986739891 @default.
- W1497382039 cites W1990426442 @default.
- W1497382039 cites W1997697966 @default.
- W1497382039 cites W1997910015 @default.
- W1497382039 cites W2002157613 @default.
- W1497382039 cites W2010057075 @default.
- W1497382039 cites W2015939621 @default.
- W1497382039 cites W2053384008 @default.
- W1497382039 cites W2056750970 @default.
- W1497382039 cites W2076873328 @default.
- W1497382039 cites W2079333278 @default.
- W1497382039 cites W2090338624 @default.
- W1497382039 cites W2112957923 @default.
- W1497382039 cites W2119682742 @default.
- W1497382039 cites W2120656140 @default.
- W1497382039 cites W2134275387 @default.
- W1497382039 cites W2134287022 @default.
- W1497382039 cites W2134400899 @default.
- W1497382039 cites W2164297069 @default.
- W1497382039 cites W2327696470 @default.
- W1497382039 cites W2911865844 @default.
- W1497382039 cites W2142423074 @default.
- W1497382039 doi "https://doi.org/10.1016/s1574-6526(06)80017-9" @default.
- W1497382039 hasPublicationYear "2006" @default.
- W1497382039 type Work @default.
- W1497382039 sameAs 1497382039 @default.
- W1497382039 citedByCount "5" @default.
- W1497382039 countsByYear W14973820392018 @default.
- W1497382039 countsByYear W14973820392021 @default.
- W1497382039 crossrefType "book-chapter" @default.
- W1497382039 hasAuthorship W1497382039A5021717408 @default.
- W1497382039 hasAuthorship W1497382039A5032517478 @default.
- W1497382039 hasAuthorship W1497382039A5084227795 @default.
- W1497382039 hasConcept C126255220 @default.
- W1497382039 hasConcept C137631369 @default.
- W1497382039 hasConcept C146206909 @default.
- W1497382039 hasConcept C153083717 @default.
- W1497382039 hasConcept C154945302 @default.
- W1497382039 hasConcept C173404611 @default.
- W1497382039 hasConcept C176783269 @default.
- W1497382039 hasConcept C193702766 @default.
- W1497382039 hasConcept C199360897 @default.
- W1497382039 hasConcept C204306468 @default.
- W1497382039 hasConcept C2524010 @default.
- W1497382039 hasConcept C26713055 @default.
- W1497382039 hasConcept C2776036281 @default.
- W1497382039 hasConcept C33923547 @default.
- W1497382039 hasConcept C34165917 @default.
- W1497382039 hasConcept C41008148 @default.
- W1497382039 hasConcept C44616089 @default.
- W1497382039 hasConcept C49937458 @default.
- W1497382039 hasConcept C50033165 @default.
- W1497382039 hasConcept C80444323 @default.
- W1497382039 hasConcept C96315309 @default.
- W1497382039 hasConceptScore W1497382039C126255220 @default.
- W1497382039 hasConceptScore W1497382039C137631369 @default.
- W1497382039 hasConceptScore W1497382039C146206909 @default.
- W1497382039 hasConceptScore W1497382039C153083717 @default.
- W1497382039 hasConceptScore W1497382039C154945302 @default.
- W1497382039 hasConceptScore W1497382039C173404611 @default.
- W1497382039 hasConceptScore W1497382039C176783269 @default.
- W1497382039 hasConceptScore W1497382039C193702766 @default.
- W1497382039 hasConceptScore W1497382039C199360897 @default.
- W1497382039 hasConceptScore W1497382039C204306468 @default.
- W1497382039 hasConceptScore W1497382039C2524010 @default.
- W1497382039 hasConceptScore W1497382039C26713055 @default.
- W1497382039 hasConceptScore W1497382039C2776036281 @default.
- W1497382039 hasConceptScore W1497382039C33923547 @default.
- W1497382039 hasConceptScore W1497382039C34165917 @default.
- W1497382039 hasConceptScore W1497382039C41008148 @default.
- W1497382039 hasConceptScore W1497382039C44616089 @default.
- W1497382039 hasConceptScore W1497382039C49937458 @default.
- W1497382039 hasConceptScore W1497382039C50033165 @default.
- W1497382039 hasConceptScore W1497382039C80444323 @default.
- W1497382039 hasConceptScore W1497382039C96315309 @default.
- W1497382039 hasLocation W14973820391 @default.
- W1497382039 hasOpenAccess W1497382039 @default.
- W1497382039 hasPrimaryLocation W14973820391 @default.
- W1497382039 hasRelatedWork W1527862632 @default.
- W1497382039 hasRelatedWork W1652311832 @default.
- W1497382039 hasRelatedWork W2118300983 @default.
- W1497382039 hasRelatedWork W2135396778 @default.
- W1497382039 hasRelatedWork W2166247150 @default.
- W1497382039 hasRelatedWork W2243428364 @default.
- W1497382039 hasRelatedWork W2462453872 @default.
- W1497382039 hasRelatedWork W3207171446 @default.
- W1497382039 hasRelatedWork W4243252198 @default.