definitional constraint programming - definition. What is definitional constraint programming
Diclib.com
قاموس ChatGPT
أدخل كلمة أو عبارة بأي لغة 👆
اللغة:

ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT

في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:

  • كيف يتم استخدام الكلمة في اللغة
  • تردد الكلمة
  • ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
  • خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
  • أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
  • أصل الكلمة

%ما هو (من)٪ 1 - تعريف

PROGRAMMING PARADIGM WHICH COMBINES LOGIC PROGRAMMING AND CONSTRAINT SATISFACTION
Constraint Logic Programmimg; Constraint store; Constraint-logic programming; Finite constraint; Finite domain constraint; Constraint Logic Programming; CLP(FD)

definitional constraint programming      
<language> (DCP) A declarative, programming paradigm which integrates concurrent constraint programming, {constraint logic programming} and functional programming. In this setting a concurrent constraint language becomes a coordination system that organises the concurrent interaction of parallel functional computations. The language is also a generalisation of parallel functional programming languages, such as Id, where constraints and constraint abstractions are reused to define new constraints, as the means of programming logical variables for parallel coordination. Goffin is a DCP language. (1995-03-28)
Constraint programming         
PROGRAMMING PARADIGM WHEREIN RELATIONS BETWEEN VARIABLES ARE STATED IN THE FORM OF CONSTRAINTS
Constraint solving toolkit; Constraint solver; List of logic programming based constraint logic languages; Babelsberg (programming language); Constraint programming language; List of constraint programming libraries; Constraint modeling language
Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer science, and operations research. In constraint programming, users declaratively state the constraints on the feasible solutions for a set of decision variables.
CLP(R)         
DECLARATIVE PROGRAMMING LANGUAGE
Constraint logic programming (Real)
CLP(R) is a declarative programming language. It stands for constraint logic programming (Real) where real refers to the real numbers.

ويكيبيديا

Constraint logic programming

Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is A(X,Y) :- X+Y>0, B(X), C(Y). In this clause, X+Y>0 is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true.

As in regular logic programming, programs are queried about the provability of a goal, which may contain constraints in addition to literals. A proof for a goal is composed of clauses whose bodies are satisfiable constraints and literals that can in turn be proved using other clauses. Execution is performed by an interpreter, which starts from the goal and recursively scans the clauses trying to prove the goal. Constraints encountered during this scan are placed in a set called constraint store. If this set is found out to be unsatisfiable, the interpreter backtracks, trying to use other clauses for proving the goal. In practice, satisfiability of the constraint store may be checked using an incomplete algorithm, which does not always detect inconsistency.