Journal articles on the topic 'Constraint satisfaction problem formalisms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Constraint satisfaction problem formalisms.'
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.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Kumar, Mohit, Samuel Kolb, Clement Gautrais, and Luc De Raedt. "Democratizing Constraint Satisfaction Problems through Machine Learning." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 18 (May 18, 2021): 16057–59. http://dx.doi.org/10.1609/aaai.v35i18.18011.
Full textEiter, Thomas, and Rafael Kiesel. "On the Complexity of Sum-of-Products Problems over Semirings." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 7 (May 18, 2021): 6304–11. http://dx.doi.org/10.1609/aaai.v35i7.16783.
Full textBożek, Andrzej, and Marian Wysocki. "Off-Line and Dynamic Production Scheduling – A Comparative Case Study." Management and Production Engineering Review 7, no. 1 (March 1, 2016): 21–32. http://dx.doi.org/10.1515/mper-2016-0003.
Full textArnaoutaki, Konstantina, Efthimios Bothos, Babis Magoutas, Attila Aba, Domokos Esztergár-Kiss, and Gregoris Mentzas. "A Recommender System for Mobility-as-a-Service Plans Selection." Sustainability 13, no. 15 (July 23, 2021): 8245. http://dx.doi.org/10.3390/su13158245.
Full textTkachov, Igor. "A New Approach to Solving the Problem of Generating Sets of Complex Structural Objects Based on a Quasi-Equivalent Transformation of a Labeling Scheme." Cybernetics and Computer Technologies, no. 1 (March 30, 2021): 43–53. http://dx.doi.org/10.34229/2707-451x.21.1.4.
Full textBocewicz, Grzegorz, Peter Nielsen, Małgorzata Jasiulewicz-Kaczmarek, and Zbigniew Banaszak. "Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty Constraints." Applied Sciences 10, no. 24 (December 11, 2020): 8872. http://dx.doi.org/10.3390/app10248872.
Full textRichta, Tomáš, and Martin Hrubý. "Dynamic object-oriented geospatial modeling." Geoinformatics FCE CTU 4 (February 1, 2009): 29–44. http://dx.doi.org/10.14311/gi.4.2.
Full textStolcke, Andreas. "Unification as Constraint Satisfaction in Structured Connectionist Networks." Neural Computation 1, no. 4 (December 1989): 559–67. http://dx.doi.org/10.1162/neco.1989.1.4.559.
Full textBarto, Libor. "Constraint satisfaction problem and universal algebra." ACM SIGLOG News 1, no. 2 (October 14, 2014): 14–24. http://dx.doi.org/10.1145/2677161.2677165.
Full textBARTO, LIBOR. "THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA." Bulletin of Symbolic Logic 21, no. 3 (September 2015): 319–37. http://dx.doi.org/10.1017/bsl.2015.25.
Full textHULUBEI, TUDOR, EUGENE C. FREUDER, and RICHARD J. WALLACE. "The Goldilocks problem." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 17, no. 1 (February 2003): 3–11. http://dx.doi.org/10.1017/s0890060403171028.
Full textĐapić, Petar, Petar Marković, and Barnaby Martin. "Quantified Constraint Satisfaction Problem on Semicomplete Digraphs." ACM Transactions on Computational Logic 18, no. 1 (April 13, 2017): 1–47. http://dx.doi.org/10.1145/3007899.
Full textSubramanian, S., and E. c. Freuder. "Compiling rules from constraint satisfaction problem solving." ACM SIGART Bulletin, no. 108 (April 1989): 177–78. http://dx.doi.org/10.1145/63266.63307.
Full textProsser, Patrick. "HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM." Computational Intelligence 9, no. 3 (August 1993): 268–99. http://dx.doi.org/10.1111/j.1467-8640.1993.tb00310.x.
Full textJiang, Xiao, Pingyuan Cui, Rui Xu, Ai Gao, and Shengying Zhu. "An Action Guided Constraint Satisfaction Technique for Planning Problem." International Journal of Software Science and Computational Intelligence 8, no. 3 (July 2016): 39–53. http://dx.doi.org/10.4018/ijssci.2016070103.
Full textGOMES, CARLA P. "Artificial intelligence and operations research: challenges and opportunities in planning and scheduling." Knowledge Engineering Review 15, no. 1 (March 2000): 1–10. http://dx.doi.org/10.1017/s0269888900001090.
Full textWESTFOLD, STEPHEN J., and DOUGLAS R. SMITH. "Synthesis of efficient constraint-satisfaction programs." Knowledge Engineering Review 16, no. 1 (March 2001): 69–84. http://dx.doi.org/10.1017/s0269888901000029.
Full textBaba, Satomi, Atsushi Iwasaki, Makoto Yokoo, Marius C. Silaghi, Katsutoshi Hirayama, and Toshihiro Matsui. "Cooperative Problem Solving against Adversary: Quantified Distributed Constraint Satisfaction Problem." Transactions of the Japanese Society for Artificial Intelligence 26 (2011): 136–46. http://dx.doi.org/10.1527/tjsai.26.136.
Full textKrokhin, Andrei, and Jakub Opršal. "An invitation to the promise constraint satisfaction problem." ACM SIGLOG News 9, no. 3 (July 2022): 30–59. http://dx.doi.org/10.1145/3559736.3559740.
Full textLiu, Ya'nan. "Sharp Thresholds for a Random Constraint Satisfaction Problem." Open Journal of Applied Sciences 07, no. 10 (2017): 574–84. http://dx.doi.org/10.4236/ojapps.2017.710041.
Full textSurgwon Sohn. "Constraint Satisfaction Optimization for RFID Reader Interference Problem." International Journal of Advancements in Computing Technology 3, no. 7 (August 31, 2011): 237–43. http://dx.doi.org/10.4156/ijact.vol3.issue7.28.
Full textYokoo, M., E. H. Durfee, T. Ishida, and K. Kuwabara. "The distributed constraint satisfaction problem: formalization and algorithms." IEEE Transactions on Knowledge and Data Engineering 10, no. 5 (1998): 673–85. http://dx.doi.org/10.1109/69.729707.
Full textHABBAS, ZINEB, MICHAËL KRAJECKI, and DANIEL SINGER. "SHARED MEMORY IMPLEMENTATION OF CONSTRAINT SATISFACTION PROBLEM RESOLUTION." Parallel Processing Letters 11, no. 04 (December 2001): 487–501. http://dx.doi.org/10.1142/s0129626401000749.
Full textBulatov, Andrei A. "The complexity of the counting constraint satisfaction problem." Journal of the ACM 60, no. 5 (October 2013): 1–41. http://dx.doi.org/10.1145/2528400.
Full textDjenouri, Youcef, Djamel Djenouri, Zineb Habbas, Jerry Chun-Wei Lin, Tomasz P. Michalak, and Alberto Cano. "When the Decomposition Meets the Constraint Satisfaction Problem." IEEE Access 8 (2020): 207034–43. http://dx.doi.org/10.1109/access.2020.3038228.
Full textPopescu, Ilié. "Using artificial neural networks for constraint satisfaction problem." Nonlinear Analysis: Theory, Methods & Applications 30, no. 5 (December 1997): 2937–44. http://dx.doi.org/10.1016/s0362-546x(97)00340-4.
Full textKelsey, Tom, and Lars Kotthoff. "Exact Closest String as a Constraint Satisfaction Problem." Procedia Computer Science 4 (2011): 1062–71. http://dx.doi.org/10.1016/j.procs.2011.04.113.
Full textGu, Jun, Xiaofei Huang, and Bin Du. "A quantitative solution to Constraint Satisfaction Problem (CSP)." New Generation Computing 13, no. 1 (December 1994): 99–115. http://dx.doi.org/10.1007/bf03038310.
Full textWang, Lin, Shi-Sheng Zhong, and Yong-Jian Zhang. "Process configuration based on generative constraint satisfaction problem." Journal of Intelligent Manufacturing 28, no. 4 (January 6, 2015): 945–57. http://dx.doi.org/10.1007/s10845-014-1031-3.
Full textLorterapong, Pasit, and Mongkol Ussavadilokrit. "Construction Scheduling Using the Constraint Satisfaction Problem Method." Journal of Construction Engineering and Management 139, no. 4 (April 2013): 414–22. http://dx.doi.org/10.1061/(asce)co.1943-7862.0000582.
Full textBergman, Clifford, and David Failing. "Commutative idempotent groupoids and the constraint satisfaction problem." Algebra universalis 73, no. 3-4 (April 29, 2015): 391–417. http://dx.doi.org/10.1007/s00012-015-0323-6.
Full textNešetřil, Jaroslav, Mark H. Siggers, and László Zádori. "A combinatorial constraint satisfaction problem dichotomy classification conjecture." European Journal of Combinatorics 31, no. 1 (January 2010): 280–96. http://dx.doi.org/10.1016/j.ejc.2009.02.007.
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 textBodirsky, Manuel, Hubie Chen, and Michał Wrona. "Tractability of quantified temporal constraints to the max." International Journal of Algebra and Computation 24, no. 08 (December 2014): 1141–56. http://dx.doi.org/10.1142/s0218196714500507.
Full textHyvönen, Eero. "Spreadsheets based on interval constraint satisfaction." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 8, no. 1 (1994): 27–34. http://dx.doi.org/10.1017/s0890060400000433.
Full textSudo, Yasuhiro, Masahito Kurihara, and Tamotsu Mitamura. "Extending Fuzzy Constraint Satisfaction Problems." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 4 (July 20, 2006): 465–71. http://dx.doi.org/10.20965/jaciii.2006.p0465.
Full textGao, Y., and J. Culberson. "Consistency and Random Constraint Satisfaction Models." Journal of Artificial Intelligence Research 28 (April 29, 2007): 517–57. http://dx.doi.org/10.1613/jair.2155.
Full textBarto, Libor, Jakub Bulín, Andrei Krokhin, and Jakub Opršal. "Algebraic Approach to Promise Constraint Satisfaction." Journal of the ACM 68, no. 4 (July 7, 2021): 1–66. http://dx.doi.org/10.1145/3457606.
Full textBrafman, Ronen, Enrico Pilotto, Francesca Rossi, Domenico Salvagnin, Kristen Venable, and Toby Walsh. "The Next Best Solution." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (August 4, 2011): 1537–40. http://dx.doi.org/10.1609/aaai.v25i1.7958.
Full textGorti, Sreenivasa Rao, Salal Humair, Ram D. Sriram, Sarosh Talukdar, and Sesh Murthy. "Solving constraint satisfaction problems using ATeams." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 10, no. 1 (January 1996): 1–19. http://dx.doi.org/10.1017/s0890060400001256.
Full textYeoh, William, and Makoto Yokoo. "Distributed Problem Solving." AI Magazine 33, no. 3 (September 20, 2012): 53. http://dx.doi.org/10.1609/aimag.v33i3.2429.
Full textQuach, Xuan Hung, and Thi Lan Giao Hoang. "Dealing with fuzzy ontology integration problem by using constraint satisfaction problem." International Journal of Advanced Computer Research 7, no. 30 (April 12, 2017): 81–87. http://dx.doi.org/10.19101/ijacr.2017.729009.
Full textDelafosse, Mélanie, Arnaud Clerentin, Laurent Delahoche, Eric Brassart, and Bruno Marhic. "The mobile robot localization problem treated as a constraint satisfaction problem." IFAC Proceedings Volumes 37, no. 8 (July 2004): 394–99. http://dx.doi.org/10.1016/s1474-6670(17)32008-6.
Full textBarták, Roman, Radomír Černoch, Ondřej Kuželka, and Filip Železný. "Formulating the template ILP consistency problem as a constraint satisfaction problem." Constraints 18, no. 2 (February 12, 2013): 144–65. http://dx.doi.org/10.1007/s10601-013-9141-7.
Full textChun, Andy. "Train Outstable Scheduling as Constraint Satisfaction." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 2 (July 14, 2013): 1513–18. http://dx.doi.org/10.1609/aaai.v27i2.18992.
Full textLARROSA, JAVIER, and GABRIEL VALIENTE. "Constraint satisfaction algorithms for graph pattern matching." Mathematical Structures in Computer Science 12, no. 4 (August 2002): 403–22. http://dx.doi.org/10.1017/s0960129501003577.
Full textDeruyver, A., and Y. Hodé. "Constraint satisfaction problem with bilevel constraint: application to interpretation of over-segmented images." Artificial Intelligence 93, no. 1-2 (June 1997): 321–35. http://dx.doi.org/10.1016/s0004-3702(97)00022-2.
Full textĎuriš, Viliam. "Algorithmic Verification of Constraint Satisfaction Method on Timetable Problem." Mathematics and Statistics 8, no. 6 (November 2020): 728–39. http://dx.doi.org/10.13189/ms.2020.080614.
Full textHelzerman, R. A., and M. P. Harper. "MUSE CSP: An Extension to the Constraint Satisfaction Problem." Journal of Artificial Intelligence Research 5 (November 1, 1996): 239–88. http://dx.doi.org/10.1613/jair.298.
Full textDyer, Martin, and David Richerby. "An Effective Dichotomy for the Counting Constraint Satisfaction Problem." SIAM Journal on Computing 42, no. 3 (January 2013): 1245–74. http://dx.doi.org/10.1137/100811258.
Full text