Academic literature on the topic 'Constraint satisfaction'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Constraint satisfaction.'
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 "Constraint satisfaction"
Pu, Jiantao, and Karthik Ramani. "Priority-Based Geometric Constraint Satisfaction." Journal of Computing and Information Science in Engineering 7, no. 4 (June 14, 2007): 322–29. http://dx.doi.org/10.1115/1.2795301.
Full textDetassis, Fabrizio, Michele Lombardi, and Michela Milano. "Teaching the Old Dog New Tricks: Supervised Learning with Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 5 (May 18, 2021): 3742–49. http://dx.doi.org/10.1609/aaai.v35i5.16491.
Full textFrank, Jeremy. "Revisiting dynamic constraint satisfaction for model-based planning." Knowledge Engineering Review 31, no. 5 (November 2016): 429–39. http://dx.doi.org/10.1017/s0269888916000242.
Full textLIU, BING. "SPECIFIC CONSTRAINT HANDLING IN CONSTRAINT SATISFACTION PROBLEMS." International Journal on Artificial Intelligence Tools 03, no. 01 (March 1994): 79–96. http://dx.doi.org/10.1142/s0218213094000066.
Full textBulatov, Andrei A., and Dániel Marx. "Constraint satisfaction problems and global cardinality constraints." Communications of the ACM 53, no. 9 (September 2010): 99–106. http://dx.doi.org/10.1145/1810891.1810914.
Full textDeville, Yves, Olivier Barette, and Pascal Van Hentenryck. "Constraint satisfaction over connected row-convex constraints." Artificial Intelligence 109, no. 1-2 (June 1999): 243–71. http://dx.doi.org/10.1016/s0004-3702(99)00012-0.
Full textBrito, Ismel, Amnon Meisels, Pedro Meseguer, and Roie Zivan. "Distributed constraint satisfaction with partially known constraints." Constraints 14, no. 2 (May 15, 2008): 199–234. http://dx.doi.org/10.1007/s10601-008-9048-x.
Full textRossi, Francesca, Kristen Brent Venable, and Toby Walsh. "Preferences in Constraint Satisfaction and Optimization." AI Magazine 29, no. 4 (December 28, 2008): 58. http://dx.doi.org/10.1609/aimag.v29i4.2202.
Full textBaykan, Can A., and Mark S. Fox. "Spatial synthesis by disjunctive constraint satisfaction." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 11, no. 4 (September 1997): 245–62. http://dx.doi.org/10.1017/s0890060400003206.
Full textDuffy, Ken R., Charles Bordenave, and Douglas J. Leith. "Decentralized Constraint Satisfaction." IEEE/ACM Transactions on Networking 21, no. 4 (August 2013): 1298–308. http://dx.doi.org/10.1109/tnet.2012.2222923.
Full textDissertations / Theses on the topic "Constraint satisfaction"
Pang, Wanlin. "Constraint structure in constraint satisfaction problems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0012/NQ39165.pdf.
Full textBodirsky, Manuel. "Constraint satisfaction with infinite domains." Doctoral thesis, [S.l. : s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=973605413.
Full textNightingale, Peter. "Consistency and the quantified constraint satisfaction problem /." St Andrews, 2007. http://hdl.handle.net/10023/759.
Full textEngebretsen, Lars. "Approximate constraint satisfaction." Doctoral thesis, KTH, Numerical Analysis and Computer Science, NADA, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2950.
Full textThornton, John Richard, and n/a. "Constraint Weighting Local Search for Constraint Satisfaction." Griffith University. School of Computing and Information Technology, 2000. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20050901.142439.
Full textThornton, John. "Constraint Weighting Local Search for Constraint Satisfaction." Thesis, Griffith University, 2000. http://hdl.handle.net/10072/367954.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Computing and Information Technology
Science, Environment, Engineering and Technology
Full Text
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 textGharbi, Nebras. "On compressing and parallelizing constraint satisfaction problems." Thesis, Artois, 2015. http://www.theses.fr/2015ARTO0406/document.
Full textConstraint Programming (CP) is a powerful paradigm used for modelling and solving combinatorial constraint problems that relies on a wide range of techniques coming from artificial intelligence, operational research, graph theory,..., etc. The basic idea of constraint programming is that the user expresses its constraints and a constraint solver seeks a solution. Constraint Satisfaction Problems (CSP), is a framework at the heart of CP problems. They correspond to decision problems where we seek for states or objects satisfying a number of constraints or criteria. These decision problems have two answers to the question they encode: true, if the problem admits a solution, false, otherwise. CSPs are the subject of intense research in both artificial intelligence and operations research. Many CSPs require the combination of heuristics and combinatorial optimization methods to solve them in a reasonable time.With the improvement of computers, larger and larger problems can be solved. However, the size of industrial problems grow faster which requires a vast amount of memory space to store them and entail great difficulties to solve them. In this thesis, our contributions can be divided into two main parts. In the first part, we deal with the most used kind of constraints, which are table constraints. We proposed two compressed forms of table constraints. Both of them are based on frequent patterns search in order to avoid redundancy. However, the manner of defining pattern, the patterns-detecting process and the new compact representation differ significantly. For each form, we propose a filtering algorithm. In the second part, we explore another way to optimize CSP solving which is the use of a parallel architecture. In fact, we enhance the solving process by establishing parallel consistencies. Different workers send to their master the result of establishing partial consistencies as new discovered facts. The master, in its turns tries to benefit from them by removing corresponding values
Fowler, David W. "Branching constraint satisfaction problems : sequential constrained decision making under uncertainty." Thesis, University of Aberdeen, 2002. http://digitool.abdn.ac.uk/R?func=search-advanced-go&find_code1=WSN&request1=AAIU153443.
Full textEgri, László. "The complexity of constraint satisfaction problems and symmetric Datalog /." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101843.
Full textIn recent years, logical and algebraic perspectives have been particularly successful in classifying CSPs. A major weapon in the arsenal of the logical perspective is the database-theory-inspired logic programming language called Datalog. A Datalog program can be used to solve a restricted class of CSPs by either accepting or rejecting a (suitably encoded) set of input constraints. Inspired by Dalmau's work on linear Datalog and Reingold's breakthrough that undirected graph connectivity is in logarithmic space, we use a new restriction of Datalog called symmetric Datalog to identify a class of CSPs solvable in logarithmic space. We establish that expressibility in symmetric Datalog is equivalent to expressibility in a specific restriction of second order logic called Symmetric Restricted Krom Monotone SNP that has already received attention for its close relationship with logarithmic space.
We also give a combinatorial description of a large class of CSPs lying in L by showing that they are definable in symmetric Datalog. The main result of this thesis is that directed st-connectivity and a closely related CSP cannot be defined in symmetric Datalog. Because undirected st-connectivity can be defined in symmetric Datalog, this result also sheds new light on the computational differences between the undirected and directed st-connectivity problems.
Books on the topic "Constraint satisfaction"
Ghédira, Khaled, and Bernard Dubuisson, eds. Constraint Satisfaction Problems. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118574522.
Full textYokoo, Makoto. Distributed Constraint Satisfaction. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2.
Full textTsang, Edward. Foundations of constraint satisfaction. Colchester: The author, 1996.
Find full textJermann, Christophe, Arnold Neumaier, and Djamila Sam, eds. Global Optimization and Constraint Satisfaction. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b136292.
Full textBliek, Christian, Christophe Jermann, and Arnold Neumaier, eds. Global Optimization and Constraint Satisfaction. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/b94062.
Full textHentenryck, Pascal Van. Constraint satisfaction in logic programming. Cambridge, Mass: MIT Press, 1989.
Find full textPetke, Justyna. Bridging Constraint Satisfaction and Boolean Satisfiability. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21810-6.
Full textHyafil, Nathanael. Probabilistic planning with constraint satisfaction techniques. Ottawa: National Library of Canada, 2003.
Find full textGüsgen, Hans Werner. CONSAT: A system for constraint satisfaction. London: Pitman, 1989.
Find full textGüsgen, Hans Werner. CONSAT: A system for constraint satisfaction. London: Pitman, 1989.
Find full textBook chapters on the topic "Constraint satisfaction"
Yokoo, Makoto. "Constraint Satisfaction Problem." In Distributed Constraint Satisfaction, 1–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_1.
Full textYokoo, Makoto. "Distributed Constraint Satisfaction Problem." In Distributed Constraint Satisfaction, 47–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_2.
Full textYokoo, Makoto. "Asynchronous Backtracking." In Distributed Constraint Satisfaction, 55–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_3.
Full textYokoo, Makoto. "Asynchronous Weak-Commitment Search." In Distributed Constraint Satisfaction, 69–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_4.
Full textYokoo, Makoto. "Distributed Breakout." In Distributed Constraint Satisfaction, 81–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_5.
Full textYokoo, Makoto. "Distributed Consistency Algorithm." In Distributed Constraint Satisfaction, 93–100. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_6.
Full textYokoo, Makoto. "Handling Multiple Local Variables." In Distributed Constraint Satisfaction, 101–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_7.
Full textYokoo, Makoto. "Handling Over-Constrained Situations." In Distributed Constraint Satisfaction, 113–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_8.
Full textYokoo, Makoto. "Summary and Future Issues." In Distributed Constraint Satisfaction, 133–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59546-2_9.
Full textGhédira, Khaled, and Bernard Dubuisson. "Foundations of CSP." In Constraint Satisfaction Problems, 1–28. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118574522.ch1.
Full textConference papers on the topic "Constraint satisfaction"
Marsden, Gary C., F. Kiamilev, S. Esener, and Sing H. Lee. "Optical Matrix Encoding for Constraint Satisfaction." In Optical Computing. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/optcomp.1989.mc2.
Full textGao, Shiqing, Jiaxin Ding, Luoyi Fu, Xinbing Wang, and Chenghu Zhou. "Exterior Penalty Policy Optimization with Penalty Metric Network under Constraints." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/443.
Full textHosobe, Hiroshi. "Hierarchical nonlinear constraint satisfaction." In the 2004 ACM symposium. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/967900.967907.
Full textRouahi, Aouatef, Kais Ben Salah, and Khaled Ghedira. "Belief Constraint Satisfaction Problems." In 2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA). IEEE, 2015. http://dx.doi.org/10.1109/aiccsa.2015.7507108.
Full textLöffler, Sven, Ke Liu, and Petra Hofstedt. "Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems." In 11th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2019. http://dx.doi.org/10.5220/0007455907550761.
Full textCodognet, Philippe. "Quantum Annealing for Constraint Satisfaction and Constrained Optimization." In 15th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2023. http://dx.doi.org/10.5220/0011925200003393.
Full textDev Gupta, Sharmi, Begum Genc, and Barry O'Sullivan. "Explanation in Constraint Satisfaction: A Survey." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/601.
Full textSample, Timothy, and Malak Mouhoub. "Augmenting spreadsheets with constraint satisfaction." In 2011 24th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE). IEEE, 2011. http://dx.doi.org/10.1109/ccece.2011.6030616.
Full textKlin, Bartek, Eryk Kopczynski, Joanna Ochremiak, and Szymon Torunczyk. "Locally Finite Constraint Satisfaction Problems." In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2015. http://dx.doi.org/10.1109/lics.2015.51.
Full textPrager, John, Jennifer Chu-Carroll, and Krzysztof Czuba. "Question answering using constraint satisfaction." In the 42nd Annual Meeting. Morristown, NJ, USA: Association for Computational Linguistics, 2004. http://dx.doi.org/10.3115/1218955.1219028.
Full textReports on the topic "Constraint satisfaction"
Cheng, Cheng-Chung, and Stephen F. Smith. Applying Constraint Satisfaction Techniques to Job Shop Scheduling. Fort Belvoir, VA: Defense Technical Information Center, January 1995. http://dx.doi.org/10.21236/ada293583.
Full textSadeh, Norman, Katia Sycara, and Yalin Xiong. Backtracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem. Fort Belvoir, VA: Defense Technical Information Center, January 1994. http://dx.doi.org/10.21236/ada289435.
Full textBlower, David J. Using Constraint Satisfaction Networks to Study Aircrew Selection for Advanced Cockpits. Fort Belvoir, VA: Defense Technical Information Center, January 1992. http://dx.doi.org/10.21236/ada258151.
Full textBritton, Bruce K., and F. J. Eisenhart. Expertise, Text Coherence, and Constraint Satisfaction: Effects on Harmony and Settling Rate. Fort Belvoir, VA: Defense Technical Information Center, March 1993. http://dx.doi.org/10.21236/ada262703.
Full textSadeh, Norman M., and Mark S. Fox. Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem. Fort Belvoir, VA: Defense Technical Information Center, November 1995. http://dx.doi.org/10.21236/ada311303.
Full textChaudhari, Gunavant. Simulation and emulation of massively parallel processor for solving constraint satisfaction problems based on oracles. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.11.
Full text