Relevant bibliographies by topics / Constraints satisfaction algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Constraints satisfaction algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Constraints satisfaction algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Constraints satisfaction algorithm"

1

LIU, BING. "SPECIFIC CONSTRAINT HANDLING IN CONSTRAINT SATISFACTION PROBLEMS." International Journal on Artificial Intelligence Tools 03, no. 01 (1994): 79–96. http://dx.doi.org/10.1142/s0218213094000066.

Full text
Abstract:
Abundant literatures exist on consistency techniques for solving Constraint Satisfaction Problems (CSPs). These literatures, however, focused mainly on finding efficient general techniques to achieve network consistency and to solve CSPs. So far, many techniques have been reported, e.g., node consistency, arc consistency, path consistency, k-consistency, forward checking, lookahead, partial lookahead, etc. Not enough attention has been given to individual constraints, and how constraint specific features may be exploited for more efficient consistency check. Many types of constraints exist in
APA, Harvard, Vancouver, ISO, and other styles
2

Gao, Yan, Xin Zhang, and Jian Zhong Xu. "An Improved Production Scheduling Algorithm Based on Resource Constraints." Applied Mechanics and Materials 455 (November 2013): 619–24. http://dx.doi.org/10.4028/www.scientific.net/amm.455.619.

Full text
Abstract:
For resource-constrained project scheduling problems, with aircraft assembly as its background, we established its mathematics model as constraint satisfaction problem. An improved critical path scheduling algorithm is proposed, considering the constraints of precedence relations, resource constraints and space constraints, through the two stages of planning, reaching for aircraft assembly task scheduling optimization objectives. Through the given numerical example results show that, when the objective consists in minimizing the project duration, the algorithm has better performance.
APA, Harvard, Vancouver, ISO, and other styles
3

STERGIOU, KOSTAS. "STRONG DOMAIN FILTERING CONSISTENCIES FOR NON-BINARY CONSTRAINT SATISFACTION PROBLEMS." International Journal on Artificial Intelligence Tools 17, no. 05 (2008): 781–802. http://dx.doi.org/10.1142/s0218213008004163.

Full text
Abstract:
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Although many such consistencies for binary constraints have been proposed and evaluated, the situation with non-binary constraints is quite different. Only very recently have domain filtering consistencies stronger than GAC started to attract interest. Following this line of research, we define a number of strong domain filtering consistencies for non-binary constraints and theoretically compare their pruning power. We p
APA, Harvard, Vancouver, ISO, and other styles
4

Juan, Yeh-Chun, and Yi-Rui Peng. "A Constraint Satisfaction Coordination Approach for Distributed Supply Chain Production Planning." Asia-Pacific Journal of Operational Research 31, no. 06 (2014): 1450041. http://dx.doi.org/10.1142/s0217595914500419.

Full text
Abstract:
Currently, distributed supply chain production planning (SCPP) is a practical problem affecting global supply chain production. Distributed SCPP is a complex constraint satisfaction problem (CSP) comprising a series of constraints intra- and inter-production members on orders, capacity, and materials. Previous studies have proposed various advanced planning and scheduling (APS) algorithms for companies to solve internal CSPs related to production planning. Distributed SCPP problems additionally require a coordination approach to resolve conflicts among the production plans of individual produc
APA, Harvard, Vancouver, ISO, and other styles
5

KÖKÉNY, TIBOR. "CONSTRAINT SATISFACTION PROBLEMS WITH ORDER-SORTED DOMAINS." International Journal on Artificial Intelligence Tools 04, no. 01n02 (1995): 55–72. http://dx.doi.org/10.1142/s0218213095000048.

Full text
Abstract:
In order to improve constraint satisfaction techniques, a promising way is to use special features of constraints and variable domains. This paper examines a special class of CSPs (Constraint Satisfaction Problems) in which a partial order is defined on each domain and the constraints are compatible with these orders. A special arc-consistency algorithm for this case is presented and some questions about finding all solutions are discussed. The presented ideas can be used in constraint systems implemented in an object-oriented language, where inheritance hierarchy of objects is a natural suppo
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Xiao Fei, Xi Zhang, Yue Bing Chen, Lei Zhang, and Chao Jing Tang. "Spectrum Assignment Algorithm Based on Clonal Selection in Cognitive Radio Networks." Advanced Materials Research 457-458 (January 2012): 931–39. http://dx.doi.org/10.4028/www.scientific.net/amr.457-458.931.

Full text
Abstract:
An improved-immune-clonal-selection based spectrum assignment algorithm (IICSA) in cognitive radio networks is proposed, combing graph theory and immune optimization. It uses constraint satisfaction operation to make encoded antibody population satisfy constraints, and realizes the global optimization. The random-constraint satisfaction operator and fair-constraint satisfaction operator are designed to guarantee efficiency and fairness, respectively. Simulations are performed for performance comparison between the IICSA and the color-sensitive graph coloring algorithm. The results indicate tha
APA, Harvard, Vancouver, ISO, and other styles
7

Arangú, Marlene, and Miguel Salido. "A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems." International Journal of Applied Mathematics and Computer Science 21, no. 4 (2011): 733–44. http://dx.doi.org/10.2478/v10006-011-0058-2.

Full text
Abstract:
A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems Constraint programming is a powerful software technology for solving numerous real-life problems. Many of these problems can be modeled as Constraint Satisfaction Problems (CSPs) and solved using constraint programming techniques. However, solving a CSP is NP-complete so filtering techniques to reduce the search space are still necessary. Arc-consistency algorithms are widely used to prune the search space. The concept of arc-consistency is bidirectional, i.e., it must be ensured in both directions of
APA, Harvard, Vancouver, ISO, and other styles
8

Baykan, Can A., and Mark S. Fox. "Spatial synthesis by disjunctive constraint satisfaction." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 11, no. 4 (1997): 245–62. http://dx.doi.org/10.1017/s0890060400003206.

Full text
Abstract:
AbstractThe spatial synthesis problem addressed in this paper is the configuration of rectangles in 2D space, where the sides of the rectangles are parallel to an orthogonal coordinate system. Variables are the locations of the edges of the rectangles and their orientations. Algebraic constraints on these variables define a layout and constitute a constraint satisfaction problem. We give a new O(n2) algorithm for incremental path-consistency, which is applied after adding each algebraic constraint. Problem requirements are formulated as spatial relations between the rectangles, for example, ad
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Yongshuai, Jiaxin Ding, and Xin Liu. "IPO: Interior-Point Policy Optimization under Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (2020): 4940–47. http://dx.doi.org/10.1609/aaai.v34i04.5932.

Full text
Abstract:
In this paper, we study reinforcement learning (RL) algorithms to solve real-world decision problems with the objective of maximizing the long-term reward as well as satisfying cumulative constraints. We propose a novel first-order policy optimization method, Interior-point Policy Optimization (IPO), which augments the objective with logarithmic barrier functions, inspired by the interior-point method. Our proposed method is easy to implement with performance guarantees and can handle general types of cumulative multi-constraint settings. We conduct extensive evaluations to compare our approac
APA, Harvard, Vancouver, ISO, and other styles
10

Desaraju, Vishnu R., Alexander E. Spitzer, Cormac O’Meadhra, Lauren Lieu, and Nathan Michael. "Leveraging experience for robust, adaptive nonlinear MPC on computationally constrained systems with time-varying state uncertainty." International Journal of Robotics Research 37, no. 13-14 (2018): 1690–712. http://dx.doi.org/10.1177/0278364918793717.

Full text
Abstract:
This paper presents a robust-adaptive nonlinear model predictive control (MPC) technique that leverages past experiences to achieve tractability on computationally constrained systems. We propose a robust extension of the Experience-driven Predictive Control (EPC) algorithm via a Gaussian belief propagation strategy that computes an uncertainty set, bounding the evolution of the system state in the presence of time-varying state uncertainty. This uncertainty set is used to tighten the constraints in the predictive control formulation via a chance-constrained approach, thereby providing a proba
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Constraints satisfaction algorithm"

1

Van, Der Linden A. S. Janet. "Dynamic meta-constraints : an approach to dealing with non-standard constraint satisfaction problems." Thesis, Oxford Brookes University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.322242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mhedhbi, Imen. "Ordonnancement d'ateliers de traitements de surfaces pour une production mono-robot/multi-produits : Résolution et étude de la robustesse." Thesis, Ecole centrale de Lille, 2011. http://www.theses.fr/2011ECLI0004/document.

Full text
Abstract:
Les travaux de recherche de ce mémoire portent sur la contribution à l’ordonnancement et à la robustesse d’ateliers de traitement de surface pour une production mono-robot/multi-produits.Une ligne de traitement de surface est constituée d’une succession de cuves dans lesquelles une opération chimique, de durée définie sur un intervalle de temps, appelé fenêtre, doit être réalisée. Ce type de ligne est en particulier contraint par un robot, se déplaçant sur un rail au dessus des cuves et assurant le transport du produit à traiter. Ce problème d’ordonnancement traité, appelé SHMP (Single-Hoist/M
APA, Harvard, Vancouver, ISO, and other styles
3

Thorstensen, Evgenij. "Hybrid tractability of constraint satisfaction problems with global constraints." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:05707b54-69e3-40eb-97e7-63b1a178c701.

Full text
Abstract:
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed combinations of values, or intensionally, whether by an equation, propositional logic formula, or other means. Intensionally represented constraints, known as global constraints, are a powerful modelling technique, and many modern CSP solvers provide them. We give examples to show how problems that deal with product configuration can be modelled with such const
APA, Harvard, Vancouver, ISO, and other styles
4

Lee, David Alexander James. "Hybrid algorithms for distributed constraint satisfaction." Thesis, Robert Gordon University, 2010. http://hdl.handle.net/10059/509.

Full text
Abstract:
A Distributed Constraint Satisfaction Problem (DisCSP) is a CSP which is divided into several inter-related complex local problems, each assigned to a different agent. Thus, each agent has knowledge of the variables and corresponding domains of its local problem together with the constraints relating its own variables (intra-agent constraints) and the constraints linking its local problem to other local problems (inter-agent constraints). DisCSPs have a variety of practical applications including, for example, meeting scheduling and sensor networks. Existing approaches to Distributed Constrain
APA, Harvard, Vancouver, ISO, and other styles
5

Sundmark, Niclas. "Design and implementation of a constraint satisfaction algorithm for meal planning." Thesis, Linköping University, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5185.

Full text
Abstract:
<p>The world’s population is ageing. Due to societal improvements in healthcare, living standards, and socio-economic status, more and more people are living to old age. The proportion of the world's population aged 65 or over is expected to increase from 11% in 1998 to 16% in 2025. This causes a major public health issue, because with increased age there is an increased risk of developing a number of age-related diseases. However, there is increasing scientific evidence that many of the biological changes and risks for chronic disease, which have traditionally been attributed to ageing, are i
APA, Harvard, Vancouver, ISO, and other styles
6

Kim, Eun Jung. "Parameterized algorithms on digraph and constraint satisfaction problems." Thesis, Royal Holloway, University of London, 2010. http://repository.royalholloway.ac.uk/items/4e3a1971-6e98-97a9-8e4f-9e1fdc76066a/9/.

Full text
Abstract:
While polynomial-time approximation algorithms remain a dominant notion in tackling computationally hard problems, the framework of parameterized complexity has been emerging rapidly in recent years. Roughly speaking, the analytic framework of parameterized complexity attempts to grasp the difference between problems which admit O(c^k . poly(n))-time algorithms such as Vertex Cover, and problems like Dominating Set for which essentially brute-force O(n^k)-algorithms are best possible until now. Problems of the former type is said to be fixed-parameter tractable (FPT) and those of the latter ty
APA, Harvard, Vancouver, ISO, and other styles
7

Budzynski, Louise. "Algorithmic barriers in random constraint satisfaction problems." Thesis, Université Paris sciences et lettres, 2020. http://www.theses.fr/2020UPSLE013.

Full text
Abstract:
La complexité typique des Problèmes de Satisfaction de Contraintes (CSP) peut être étudiée à l'aide d'ensembles aléatoires de contraintes. On observe un phénomène de seuil quand la densité de contraintes augmente. En particulier à la transition de clustering, l'ensemble des solutions typiques se fracture en groupes de solutions séparés les uns des autres. Dans cette thèse nous introduisons un biais qui brise l'uniformité entre les solutions d'une instance de CSP, et nous étudions son effet sur la valeur du seuil de clustering. Nous étudions en particulier le problème de bicoloriage de k-hyperg
APA, Harvard, Vancouver, ISO, and other styles
8

Latham, Richard Samuel. "Combinatorial algorithms for the analysis and satisfaction of geometric constraints." Thesis, Brunel University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.336642.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bain, Stuart, and n/a. "Evolving Algorithms for Over-Constrained and Satisfaction Problems." Griffith University. School of Information and Communication Technology, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20071126.080227.

Full text
Abstract:
The notion that a universally effective problem solver may still exist, and is simply waiting to be found, is slowly being abandoned in the light of a growing body of work reporting on the narrow applicability of individual heuristics. As the formalism of the constraint satisfaction problem remains a popular choice for the representation of problems to be solved algorithmically, there exists an ongoing need for new algorithms to effciently handle the disparate range of problems that have been posed in this representation. Given the costs associated with manually applying human algorithm develo
APA, Harvard, Vancouver, ISO, and other styles
10

Uppman, Hannes. "On Some Combinatorial Optimization Problems : Algorithms and Complexity." Doctoral thesis, Linköpings universitet, Programvara och system, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-116859.

Full text
Abstract:
This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems. A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). In this problem we are given a set of variables and a collection of constraints, each of which is constraining some variables with a relation in the language. The goal is to determine if domain values can be assigned to the variables in a way that satisfies all constraints. An import
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Constraints satisfaction algorithm"

1

Wahbi, Mohamed. Algorithms and ordering heuristics for distributed constraint satisfaction problems. ISTE, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wahbi, Mohamed. Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118753620.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wahbi, Mohamed. Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. Wiley & Sons, Incorporated, John, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wahbi, Mohamed. Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. Wiley & Sons, Incorporated, John, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Constraints satisfaction algorithm"

1

Yokoo, Makoto. "Distributed Consistency Algorithm." In Distributed Constraint Satisfaction. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ghédira, Khaled, and Bernard Dubuisson. "CSP Solving Algorithms." In Constraint Satisfaction Problems. John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118574522.ch3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Schmied, Aurélien. "A Global Constrained Optimization Algorithm for Engine Calibration." In Global Optimization and Constraint Satisfaction. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39901-8_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wahbi, Mohamed. "Constraint Satisfaction Problems." In Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118753620.ch1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wahbi, Mohamed. "Distributed Constraint Satisfaction Problems." In Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118753620.ch2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lau, Hoong Chuin, and Osamu Watanabe. "Randomized approximation of the constraint satisfaction problem." In Algorithm Theory — SWAT'96. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61422-2_122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bazgan, Cristina, and Marek Karpinski. "On the Complexity of Global Constraint Satisfaction." In Algorithms and Computation. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11602613_63.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gutin, Gregory. "Kernelization, Constraint Satisfaction Problems Parameterized above Average." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_524.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gutin, Gregory. "Kernelization: Constraint Satisfaction Problems Parameterized Above Average." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_524-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bulatov, Andrei A. "Constraint Satisfaction Problems: Complexity and Algorithms." In Language and Automata Theory and Applications. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77313-1_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Constraints satisfaction algorithm"

1

HasanzadeZonuzy, Aria, Dileep Kalathil, and Srinivas Shakkottai. "Model-Based Reinforcement Learning for Infinite-Horizon Discounted Constrained Markov Decision Processes." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/347.

Full text
Abstract:
In many real-world reinforcement learning (RL) problems, in addition to maximizing the objective, the learning agent has to maintain some necessary safety constraints. We formulate the problem of learning a safe policy as an infinite-horizon discounted Constrained Markov Decision Process (CMDP) with an unknown transition probability matrix, where the safety requirements are modeled as constraints on expected cumulative costs. We propose two model-based constrained reinforcement learning (CRL) algorithms for learning a safe policy, namely, (i) GM-CRL algorithm, where the algorithm has access to
APA, Harvard, Vancouver, ISO, and other styles
2

Thornton, Anna C. "A Support Tool for Constraint Processes in Embodiment Design." In ASME 1994 Design Technical Conferences collocated with the ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/detc1994-0023.

Full text
Abstract:
Abstract Embodiment design of mechanical systems can be viewed as a process of constraint specification and satisfaction of highly coupled equality and inequality constraints. A set of methods and tools developed to support this process are described in this paper. These methods include a product model capable of supporting the necessary design information, the use of generic components to rapidly specify design constraints, and SANCS (Simulated Annealing Network Constraint Satisfier), an algorithm developed to automate the satisfaction of large sets of design constraints.
APA, Harvard, Vancouver, ISO, and other styles
3

D’Ambrosio, Joseph, Timothy Darr, and William Birmingham. "A Constraint Satisfaction Approach for Multi-Attribute Design Optimization Problems." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/dtm-3887.

Full text
Abstract:
Abstract In this paper, we describe a multi-attribute domain CSP approach for solving a class of discrete, constrained, optimization problems. The multi-attribute domain CSP formulation provides a compact representation for design problems characterized by multiple, conflicting attributes. Design trade-off information is represented by a multi-attribute value function. Necessary conditions for an optimal solution, defined in terms of the value function, are represented as constraints. This provides a uniform problem-solving approach (constraint satisfaction) for identifying solutions that are
APA, Harvard, Vancouver, ISO, and other styles
4

Mhedhbi, Imen, Herve Camus, Etienne Craye, and Mohamed Benrejeb. "SHMP solution for surface treatment line using an hybrid constraints satisfaction algorithm." In 2011 International Conference on Communications, Computing and Control Applications (CCCA). IEEE, 2011. http://dx.doi.org/10.1109/ccca.2011.6031222.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mukherjee, Rudranarayan, and Pawel Malczyk. "Parallel Algorithm for Modeling Multi-Rigid Body System Dynamics With Nonholonomic Constraints." In ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-13305.

Full text
Abstract:
This paper presents a new algorithm for serial or parallel implementation of computer simulations of the dynamics of multi-rigid body systems subject to nonholonomic and holonomic constraints. The algorithm presents an elegant approach for eliminating the nonholonomic constraints explicitly from the equations of motion and implicitly expressing them in terms of nonlinear coupling in the operational inertias of the bodies subject to these constraints. The resulting equations are in the same form as those of a body subject to kinematic joint constraints. This enables the nonholohomic constraints
APA, Harvard, Vancouver, ISO, and other styles
6

Sridhar, Natarajan, Rajiv Agrawal, and Gary L. Kinzel. "An Automatic Approach to Handling Inequality Constraints in an Interactive Design Environment." In ASME 1991 Design Technical Conferences. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/detc1991-0089.

Full text
Abstract:
Abstract A general mechanical design can be characterized by a set of equality and inequality constraints. Constraint Management algorithms have been successfully applied for the satisfaction of equality constraints. The goal of this paper is to extend the ideas of constraint management to handle inequality constraints. Past research shows that the handling of inequality constraints has been restricted to optimization and symbolic frameworks. As opposed to the traditional optimization schemes in which all the inequality constraints are converted to equalities, our approach introduces slack var
APA, Harvard, Vancouver, ISO, and other styles
7

Gamba, Emilio, Bart Bogaerts, and Tias Guns. "Efficiently Explaining CSPs with Unsatisfiable Subset Optimization." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/191.

Full text
Abstract:
We build on a recently proposed method for explaining solutions of constraint satisfaction problems. An explanation here is a sequence of simple inference steps, where the simplicity of an inference step is measured by the number and types of constraints and facts used, and where the sequence explains all logical consequences of the problem. We build on these formal foundations and tackle two emerging questions, namely how to generate explanations that are provably optimal (with respect to the given cost metric) and how to generate them efficiently. To answer these questions, we develop 1) an
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Xizhe, Qian Li, and Weixiong Zhang. "A Fast Algorithm for Generalized Arc Consistency of the Alldifferent Constraint." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/194.

Full text
Abstract:
The alldifferent constraint is an essential ingredient of most Constraints Satisfaction Problems (CSPs). It has been known that the generalized arc consistency (GAC) of alldifferent constraints can be reduced to the maximum matching problem in a value graph. The redundant edges, which do not appear in any maximum matching of the value graph, can and should be removed from the graph. The existing methods attempt to identify these redundant edges by computing the strongly connected components after finding a maximum matching for the graph. Here, we present a novel theorem for identification of t
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Xizhe, Jian Gao, Yizhi Lv, and Weixiong Zhang. "Early and Efficient Identification of Useless Constraint Propagation for Alldifferent Constraints." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/157.

Full text
Abstract:
Constraints propagation and backtracking are two basic techniques for solving constraint satisfaction problems (CSPs). During the search for a solution, the variable and value pairs that do not belong to any solution can be discarded by constraint propagation to ensure generalized arc consistency so as to avoid the fruitless search. However, constraint propagation is frequently invoked often with little effect on many CSPs. Much effort has been devoted to predicting when to invoke constraint propagation for solving a CSP; however, no effective approach has been developed for the alldifferent c
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Po-Chih, Chia-Ou Chang, Wen-Tien Chang Chien, and Chan-Shin Chou. "Molecular/Mechanical Dynamics Simulations With Nonholonomic Constraints." In ASME 2010 International Mechanical Engineering Congress and Exposition. ASMEDC, 2010. http://dx.doi.org/10.1115/imece2010-38469.

Full text
Abstract:
In this paper a new method of incorporating linear/nonlinear nonholonomic constraints into the mechanical/molecular dynamical systems is presented. We first introduce the mass-weighted coordinates such that acceleration and forces are scaled to have the same units, and can be operated in the same space. Then we use the projector formalism and Gauss’s principle of least constraint to derive the constraint force in the explicit form so that the equations of motion are free of Lagrange multipliers. The use of mass-weighted coordinates enable the equation of the constraint forces to be expressed i
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography