標題: Titlebook: Constraint Programming: Basics and Trends; 1994 Chatillon Sprin Andreas Podelski Conference proceedings 1995 Springer-Verlag Berlin Heidelb [打印本頁] 作者: TINGE 時間: 2025-3-21 16:57
書目名稱Constraint Programming: Basics and Trends影響因子(影響力)
書目名稱Constraint Programming: Basics and Trends影響因子(影響力)學科排名
書目名稱Constraint Programming: Basics and Trends網(wǎng)絡(luò)公開度
書目名稱Constraint Programming: Basics and Trends網(wǎng)絡(luò)公開度學科排名
書目名稱Constraint Programming: Basics and Trends被引頻次
書目名稱Constraint Programming: Basics and Trends被引頻次學科排名
書目名稱Constraint Programming: Basics and Trends年度引用
書目名稱Constraint Programming: Basics and Trends年度引用學科排名
書目名稱Constraint Programming: Basics and Trends讀者反饋
書目名稱Constraint Programming: Basics and Trends讀者反饋學科排名
作者: Polydipsia 時間: 2025-3-21 20:54 作者: Acetaldehyde 時間: 2025-3-22 03:20
Interval constraint logic programming,aint solving over continuous and discrete quantities, we establish a strong ling between approximations and local consistency notions and show that arc-consistency is an instance of the approximation framework. We finally describe recent work on different variants of the initial algorithm proposed b作者: 相一致 時間: 2025-3-22 04:48 作者: inhumane 時間: 2025-3-22 10:08
International Studies in Entrepreneurshipl-known abstract domain . showing that combining finite domain symbolic constraints with bottom-up abstract interpretation provides analyses that are at the same time accurate, efficient and specializable. (Such analyses are called on-line, goal-independent or condensing.)作者: Charitable 時間: 2025-3-22 14:10 作者: Charitable 時間: 2025-3-22 20:40
Abstract interpretation and finite domain symbolic constraints,l-known abstract domain . showing that combining finite domain symbolic constraints with bottom-up abstract interpretation provides analyses that are at the same time accurate, efficient and specializable. (Such analyses are called on-line, goal-independent or condensing.)作者: pineal-gland 時間: 2025-3-23 00:28 作者: organism 時間: 2025-3-23 02:00
Solving pseudo-Boolean constraints, the domain {0,1} originating from mathematical programming. The key concepts are the generation of strong valid inequalities for the solution set of a constraint system and the notion of branch-and-cut.作者: Madrigal 時間: 2025-3-23 08:35
Toupie: A constraint language for model checking,uations, that are not available in CLP languages. In this paper, we present, the language Toupie that is designed to solve such constraints. Toupie uses an extension of Bryant‘s binary decision diagrams to encode relations which makes it possible to handle relations with huge numbers of elements.作者: 縮影 時間: 2025-3-23 11:36
Ultrashort Pulse Laser Technologyf CLP programs with negation. We derive from these results a complete scheme for optimization higher-order predicates in CLP languages, and an operational semantics for concurrent constraint (CC) languages extended with negation and optimization higher-order agents.作者: Dungeon 時間: 2025-3-23 15:51
https://doi.org/10.1007/978-3-319-17713-7s with linear constraints CHIP, CLP(R) and Prolog III. The third form was proposed by JL. Imbert and P. Van Hentenryck in 1991 [8]. We discuss the advantages and disadvantages of each and present the results of some comparative tests.作者: Freeze 時間: 2025-3-23 20:49 作者: 極微小 時間: 2025-3-24 02:06
In the Crucible of Confucianismuccess occurs. Disjunctive constraints are handled by backtracking. Operational semantics and terminating conditions of such systems are discussed. Message processing is detailed for both the general case where several non-deterministic solvers are involved in the cooperation, and for more specialized architectures.作者: 流動性 時間: 2025-3-24 06:15
The Mirror Universes of East and Weste values and constraints Oz computes with. The Oz calculus models computation in Oz as rewriting of a class of expressions modulo a structural congruence. The actor model is the informal computation model underlying Oz. It introduces notions like computation spaces, actors, blackboards, and threads.作者: Rejuvenate 時間: 2025-3-24 06:34 作者: patella 時間: 2025-3-24 12:55 作者: N防腐劑 時間: 2025-3-24 16:28 作者: Annotate 時間: 2025-3-24 23:04
An architecture for cooperating constraint solvers on reals,uccess occurs. Disjunctive constraints are handled by backtracking. Operational semantics and terminating conditions of such systems are discussed. Message processing is detailed for both the general case where several non-deterministic solvers are involved in the cooperation, and for more specialized architectures.作者: octogenarian 時間: 2025-3-25 00:53
The definition of Kernel Oz,e values and constraints Oz computes with. The Oz calculus models computation in Oz as rewriting of a class of expressions modulo a structural congruence. The actor model is the informal computation model underlying Oz. It introduces notions like computation spaces, actors, blackboards, and threads.作者: IST 時間: 2025-3-25 06:20 作者: inventory 時間: 2025-3-25 09:22 作者: 高興去去 時間: 2025-3-25 13:35
0302-9743 new area accessible to all interested computer scientists and report the state of the art in this exciting new field, particularly in the subfield of constraint logic programming.978-3-540-59155-9978-3-540-49200-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: FAST 時間: 2025-3-25 18:14 作者: 公共汽車 時間: 2025-3-25 23:18 作者: offense 時間: 2025-3-26 03:08
0302-9743 ool was the 22nd event in a series of advanced seminars presenting important new areas of research to the theoretical computer science community..The interdisciplinary area of constraint (logic) programming and constraint-based systems has recently developed a discernible identity, which is promisin作者: Pert敏捷 時間: 2025-3-26 05:43 作者: 等待 時間: 2025-3-26 09:55
International Studies in Entrepreneurshipuations, that are not available in CLP languages. In this paper, we present, the language Toupie that is designed to solve such constraints. Toupie uses an extension of Bryant‘s binary decision diagrams to encode relations which makes it possible to handle relations with huge numbers of elements.作者: cataract 時間: 2025-3-26 16:22
Interval constraint logic programming,nciple is to approximate n-ary relations over . with Cartesian products of intervals whose bounds are taken in a finite subset of .. Variables represent real values whose domains are intervals defined in the same manner. Narrowing operators are defined from approximations. These operators compute, f作者: 膽大 時間: 2025-3-26 19:43
Solving pseudo-Boolean constraints,aints, on the other hand, they are a restricted form of finite domain constraints. In this paper, we present special constraint solving techniques for the domain {0,1} originating from mathematical programming. The key concepts are the generation of strong valid inequalities for the solution set of 作者: Sarcoma 時間: 2025-3-26 22:32
Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods,. constraint-solver of the clp(FD) system. Besides the clp(FD) . encoding (partial) arc-consistency methods, we introduce new primitive constraints, that we call ., which encode path-consistency methods. These new constraints increase the constraint-solving power and the extensibility of the clp(FD)作者: 蹣跚 時間: 2025-3-27 03:46 作者: ALIAS 時間: 2025-3-27 05:59 作者: 一夫一妻制 時間: 2025-3-27 12:33
Linear constraint solving in CLP-Languages,rally called solved forms, since a satisfiable linear constraint system can be rewritten under one of these forms, and reciprocally, a linear constraint system of one of these forms is satisfiable. This paper aims to present three different solved forms two of which are used in the main CLP language作者: DEFT 時間: 2025-3-27 17:21
On the use of constraints in automated deduction,rategies using constraints is shown through the example of a completion process using ordered and basic strategies. The schematization of complex unification problems through constraints is illustrated by the example of an equational theorem prover with associativity and commutativity axioms. The in作者: output 時間: 2025-3-27 17:55
Abstract interpretation and finite domain symbolic constraints,n symbolic constraints constitute a restricted class of first order formulas which enjoy efficient representations. In this paper, it is shown how finite domain symbolic constraints can be used to implement a whole class of abstract domains applicable to any programming paradigm. Some interesting ac作者: peptic-ulcer 時間: 2025-3-28 00:17
Concurrency and Concurrent Constraint Programming,language, and to describe a particular approach which makes some specific choices in order to give a semantics to the class of CC languages. In particular, we will discuss how to handle the issues of concurrency and nondeterminism, and we will examine in detail the formalism of Petri nets, which, su作者: 思考而得 時間: 2025-3-28 02:33 作者: 季雨 時間: 2025-3-28 06:29 作者: 謙虛的人 時間: 2025-3-28 13:33
An architecture for cooperating constraint solvers on reals,ation of . makes it possible to solve problems that none of these solvers can tackle alone. Then, we specify a cooperative architecture which allows . when handling constraints over the reals. This architecture is based upon agents that communicate via .. Agent are synchronized when a failure or a s作者: aerobic 時間: 2025-3-28 15:30 作者: neologism 時間: 2025-3-28 18:48
Design, implementation, and evaluation of the constraint language cc(FD),nstraint logic language over finite domains based on the cc framework [28], an extension of the CLP scheme [17]. Its constraint solver includes (non-linear) arithmetic constraints over natural numbers which are approximated using domain and interval consistency. The main novelty of cc(FD) is the inc作者: Nefarious 時間: 2025-3-29 00:53 作者: Spinous-Process 時間: 2025-3-29 03:33
High Power Femtosecond Diode Lasers. constraint-solver of the clp(FD) system. Besides the clp(FD) . encoding (partial) arc-consistency methods, we introduce new primitive constraints, that we call ., which encode path-consistency methods. These new constraints increase the constraint-solving power and the extensibility of the clp(FD) language.作者: Contracture 時間: 2025-3-29 08:40 作者: 啞巴 時間: 2025-3-29 13:55 作者: BARK 時間: 2025-3-29 18:26 作者: genesis 時間: 2025-3-29 20:42
High Power Femtosecond Diode Lasers. constraint-solver of the clp(FD) system. Besides the clp(FD) . encoding (partial) arc-consistency methods, we introduce new primitive constraints, that we call ., which encode path-consistency methods. These new constraints increase the constraint-solving power and the extensibility of the clp(FD)作者: Folklore 時間: 2025-3-30 00:50
Ultrashort Pulse Laser Technologytructive negation by pruning provides a generic operational semantics which is correct and complete w.r.t. Kunen‘s threevalued logic semantics. We emphasis a full abstraction result which permits to go beyond the theorem proving point of view and to completely characterize the operational behavior o作者: 注入 時間: 2025-3-30 06:58 作者: Adjourn 時間: 2025-3-30 11:31 作者: Acetaldehyde 時間: 2025-3-30 14:04 作者: 吞吞吐吐 時間: 2025-3-30 18:50 作者: 無禮回復(fù) 時間: 2025-3-30 21:59
David Audretsch,Erik Lehmann,Silvio Vismaralanguage, and to describe a particular approach which makes some specific choices in order to give a semantics to the class of CC languages. In particular, we will discuss how to handle the issues of concurrency and nondeterminism, and we will examine in detail the formalism of Petri nets, which, su作者: exceptional 時間: 2025-3-31 02:41 作者: 大氣層 時間: 2025-3-31 06:30
In the Crucible of Confucianismrogramming language (CLP). The conditions are that the equality theory must contain axiom ., and the formula language must depart from Horn clauses and accept universal quantifications and implications in goals. In short, CLP(.,≡.) must be close to λProlog.作者: 榨取 時間: 2025-3-31 12:27 作者: 說不出 時間: 2025-3-31 15:17
The Mirror Universes of East and Westte sublanguage of Oz. It was an important design requirement that Oz be definable by reduction to a lean kernel language. The definition of Kernel Oz introduces three essential abstractions: the Oz universe, the Oz calculus, and the actor model. The Oz universe is a first-order structure defining th
