Faenza, Yuri; Muñoz, Gonzalo; Pokutta, Sebastian New limits of treewidth-based tractability in optimization. (English) Zbl 1489.90204 Math. Program. 191, No. 2 (A), 559-594 (2022). MSC: 90C35 90C05 90C22 PDFBibTeX XMLCite \textit{Y. Faenza} et al., Math. Program. 191, No. 2 (A), 559--594 (2022; Zbl 1489.90204) Full Text: DOI arXiv
Cohen, David A.; Cooper, Martin C.; Jeavons, Peter G.; Živný, Stanislav Galois connections for patterns: an algebra of labelled graphs. (English) Zbl 1467.68176 Cochez, Michael (ed.) et al., Graph structures for knowledge representation and reasoning. 6th international workshop, GKR 2020, virtual event, September 5, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12640, 125-150 (2021). MSC: 68T30 05C78 06A15 68R10 PDFBibTeX XMLCite \textit{D. A. Cohen} et al., Lect. Notes Comput. Sci. 12640, 125--150 (2021; Zbl 1467.68176) Full Text: DOI
Baruah, Sanjoy K.; Bonifaci, Vincenzo; Bruni, Renato; Marchetti-Spaccamela, Alberto ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors. (English) Zbl 1428.90068 J. Sched. 22, No. 2, 195-209 (2019). MSC: 90B35 68M20 90C05 90C10 PDFBibTeX XMLCite \textit{S. K. Baruah} et al., J. Sched. 22, No. 2, 195--209 (2019; Zbl 1428.90068) Full Text: DOI HAL
Stergiou, Kostas Neighborhood singleton consistencies. (English) Zbl 1468.68207 Constraints 24, No. 1, 94-131 (2019). MSC: 68T20 PDFBibTeX XMLCite \textit{K. Stergiou}, Constraints 24, No. 1, 94--131 (2019; Zbl 1468.68207) Full Text: DOI
Cohen, David A.; Cooper, Martin C.; Jeavons, Peter G.; Živný, Stanislav Binary constraint satisfaction problems defined by excluded topological minors. (English) Zbl 1408.68130 Inf. Comput. 264, 12-31 (2019). MSC: 68T20 05C83 68Q25 PDFBibTeX XMLCite \textit{D. A. Cohen} et al., Inf. Comput. 264, 12--31 (2019; Zbl 1408.68130) Full Text: DOI arXiv Link
Gonen, Tzlil; Oshman, Rotem Lower bounds for subgraph detection in the CONGEST model. (English) Zbl 1487.68179 Aspnes, James (ed.) et al., 21st international conference on principles of distributed systems, OPODIS 2017, Lisboa, Portugal, December 18–20, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 95, Article 6, 16 p. (2018). MSC: 68R10 68M14 68Q17 PDFBibTeX XMLCite \textit{T. Gonen} and \textit{R. Oshman}, LIPIcs -- Leibniz Int. Proc. Inform. 95, Article 6, 16 p. (2018; Zbl 1487.68179) Full Text: DOI
Jguirim, Wafa; Naanaa, Wady; Cooper, Martin C. A polynomial relational class of binary CSP. (English) Zbl 1484.68071 Ann. Math. Artif. Intell. 83, No. 1, 1-20 (2018). MSC: 68Q25 68Q27 68R07 PDFBibTeX XMLCite \textit{W. Jguirim} et al., Ann. Math. Artif. Intell. 83, No. 1, 1--20 (2018; Zbl 1484.68071) Full Text: DOI Link
Bienstock, Daniel; Muñoz, Gonzalo LP formulations for polynomial optimization problems. (English) Zbl 1395.80005 SIAM J. Optim. 28, No. 2, 1121-1150 (2018). Reviewer: Sorin-Mihai Grad (Chemnitz) MSC: 80M50 90C05 PDFBibTeX XMLCite \textit{D. Bienstock} and \textit{G. Muñoz}, SIAM J. Optim. 28, No. 2, 1121--1150 (2018; Zbl 1395.80005) Full Text: DOI
Cooper, Martin C.; Zivny, Stanislav Hybrid tractable classes of constraint problems. (English) Zbl 1482.68107 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 113-135 (2017). MSC: 68Q25 68R05 90C27 PDFBibTeX XMLCite \textit{M. C. Cooper} and \textit{S. Zivny}, Dagstuhl Follow-Ups 7, 113--135 (2017; Zbl 1482.68107) Full Text: DOI
Bessiere, Christian; Fargier, Hélène; Lecoutre, Christophe Computing and restoring global inverse consistency in interactive constraint satisfaction. (English) Zbl 1392.68382 Artif. Intell. 241, 153-169 (2016). MSC: 68T20 68Q25 PDFBibTeX XMLCite \textit{C. Bessiere} et al., Artif. Intell. 241, 153--169 (2016; Zbl 1392.68382) Full Text: DOI
Habbas, Zineb; Amroun, Kamal; Singer, Daniel Generalized hypertree decomposition for solving non binary CSP with compressed table constraints. (English) Zbl 1357.68207 RAIRO, Oper. Res. 50, No. 2, 241-267 (2016). MSC: 68T20 PDFBibTeX XMLCite \textit{Z. Habbas} et al., RAIRO, Oper. Res. 50, No. 2, 241--267 (2016; Zbl 1357.68207) Full Text: DOI
Escamocher, Guillaume; O’Sullivan, Barry On the minimal constraint satisfaction problem: complexity and generation. (English) Zbl 1473.68186 Lu, Zaixin (ed.) et al., Combinatorial optimization and applications. 9th international conference, COCOA 2015, Houston, TX, USA, December 18–20, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9486, 731-745 (2015). MSC: 68T20 68Q17 68Q25 PDFBibTeX XMLCite \textit{G. Escamocher} and \textit{B. O'Sullivan}, Lect. Notes Comput. Sci. 9486, 731--745 (2015; Zbl 1473.68186) Full Text: DOI
Dilkina, Bistra; Gomes, Carla P.; Sabharwal, Ashish Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search. (English) Zbl 1357.68205 Ann. Math. Artif. Intell. 70, No. 4, 399-431 (2014). MSC: 68T20 68T05 68T27 PDFBibTeX XMLCite \textit{B. Dilkina} et al., Ann. Math. Artif. Intell. 70, No. 4, 399--431 (2014; Zbl 1357.68205) Full Text: DOI
Jefferson, Christopher; Jeavons, Peter; Green, Martin J.; van Dongen, M. R. C. Representing and solving finite-domain constraint problems using systems of polynomials. (English) Zbl 1272.68327 Ann. Math. Artif. Intell. 67, No. 3-4, 359-382 (2013). MSC: 68R05 13P10 13P25 PDFBibTeX XMLCite \textit{C. Jefferson} et al., Ann. Math. Artif. Intell. 67, No. 3--4, 359--382 (2013; Zbl 1272.68327) Full Text: DOI Link
Kim, Eun Jung; Ordyniak, Sebastian; Szeider, Stefan Algorithms and complexity results for persuasive argumentation. (English) Zbl 1230.68189 Artif. Intell. 175, No. 9-10, 1722-1736 (2011). MSC: 68T27 68Q25 PDFBibTeX XMLCite \textit{E. J. Kim} et al., Artif. Intell. 175, No. 9--10, 1722--1736 (2011; Zbl 1230.68189) Full Text: DOI
Cooper, Martin C.; Jeavons, Peter G.; Salamon, András Z. Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination. (English) Zbl 1205.68372 Artif. Intell. 174, No. 9-10, 570-584 (2010). MSC: 68T20 PDFBibTeX XMLCite \textit{M. C. Cooper} et al., Artif. Intell. 174, No. 9--10, 570--584 (2010; Zbl 1205.68372) Full Text: DOI
Greco, Gianluigi; Scarcello, Francesco On the power of structural decompositions of graph-based representations of constraint problems. (English) Zbl 1207.68355 Artif. Intell. 174, No. 5-6, 382-409 (2010). MSC: 68T20 68R10 PDFBibTeX XMLCite \textit{G. Greco} and \textit{F. Scarcello}, Artif. Intell. 174, No. 5--6, 382--409 (2010; Zbl 1207.68355) Full Text: DOI
Samer, Marko; Szeider, Stefan Constraint satisfaction with bounded treewidth revisited. (English) Zbl 1186.68443 J. Comput. Syst. Sci. 76, No. 2, 103-114 (2010). MSC: 68T20 PDFBibTeX XMLCite \textit{M. Samer} and \textit{S. Szeider}, J. Comput. Syst. Sci. 76, No. 2, 103--114 (2010; Zbl 1186.68443) Full Text: DOI
Maher, Michael J. Local consistency for extended CSPs. (English) Zbl 1187.68556 Theor. Comput. Sci. 410, No. 46, 4769-4783 (2009). MSC: 68T20 PDFBibTeX XMLCite \textit{M. J. Maher}, Theor. Comput. Sci. 410, No. 46, 4769--4783 (2009; Zbl 1187.68556) Full Text: DOI
Bessiere, Christian; Stergiou, Kostas; Walsh, Toby Domain filtering consistencies for non-binary constraints. (English) Zbl 1182.68218 Artif. Intell. 172, No. 6-7, 800-822 (2008). MSC: 68T20 68Q25 PDFBibTeX XMLCite \textit{C. Bessiere} et al., Artif. Intell. 172, No. 6--7, 800--822 (2008; Zbl 1182.68218) Full Text: DOI
Scarcello, Francesco; Gottlob, Georg; Greco, Gianluigi Uniform constraint satisfaction problems and database theory. (English) Zbl 1171.68501 Creignou, Nadia (ed.) et al., Complexity of constraints. An overview of current research themes. Berlin: Springer (ISBN 978-3-540-92799-0/pbk). Lecture Notes in Computer Science 5250, 156-195 (2008). MSC: 68Q25 68P15 PDFBibTeX XMLCite \textit{F. Scarcello} et al., Lect. Notes Comput. Sci. 5250, 156--195 (2008; Zbl 1171.68501) Full Text: DOI
Cohen, David; Jeavons, Peter; Gyssens, Marc A unified theory of structural tractability for constraint satisfaction problems. (English) Zbl 1151.68640 J. Comput. Syst. Sci. 74, No. 5, 721-743 (2008). MSC: 68T20 PDFBibTeX XMLCite \textit{D. Cohen} et al., J. Comput. Syst. Sci. 74, No. 5, 721--743 (2008; Zbl 1151.68640) Full Text: DOI Link
Dilkina, Bistra; Gomes, Carla P.; Sabharwal, Ashish Tradeoffs in the complexity of backdoor detection. (English) Zbl 1145.68511 Bessière, Christian (ed.), Principles and practice of constraint programming – CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23–27, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74969-1/pbk). Lecture Notes in Computer Science 4741, 256-270 (2007). MSC: 68T20 68Q17 68Q25 PDFBibTeX XMLCite \textit{B. Dilkina} et al., Lect. Notes Comput. Sci. 4741, 256--270 (2007; Zbl 1145.68511) Full Text: DOI
Scarcello, Francesco; Greco, Gianluigi; Leone, Nicola Weighted hypertree decompositions and optimal query plans. (English) Zbl 1115.68068 J. Comput. Syst. Sci. 73, No. 3, 475-506 (2007). MSC: 68P15 PDFBibTeX XMLCite \textit{F. Scarcello} et al., J. Comput. Syst. Sci. 73, No. 3, 475--506 (2007; Zbl 1115.68068) Full Text: DOI
Dalmau, Víctor A new tractable class of constraint satisfaction problems. (English) Zbl 1075.68082 Ann. Math. Artif. Intell. 44, No. 1-2, 61-85 (2005). MSC: 68T20 03B05 68T15 PDFBibTeX XMLCite \textit{V. Dalmau}, Ann. Math. Artif. Intell. 44, No. 1--2, 61--85 (2005; Zbl 1075.68082) Full Text: DOI
Gottlob, Georg; Leone, Nicola; Scarcello, Francesco Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (English) Zbl 1054.68044 J. Comput. Syst. Sci. 66, No. 4, 775-808 (2003). MSC: 68P15 05C75 68R10 03B70 91A43 PDFBibTeX XMLCite \textit{G. Gottlob} et al., J. Comput. Syst. Sci. 66, No. 4, 775--808 (2003; Zbl 1054.68044) Full Text: DOI
Gottlob, Georg; Leone, Nicola; Scarcello, Francesco Hypertree decompositions and tractable queries. (English) Zbl 1052.68025 J. Comput. Syst. Sci. 64, No. 3, 579-627 (2002). MSC: 68P15 PDFBibTeX XMLCite \textit{G. Gottlob} et al., J. Comput. Syst. Sci. 64, No. 3, 579--627 (2002; Zbl 1052.68025) Full Text: DOI
Broxvall, Mathias; Jonsson, Peter; Renz, Jochen Disjunctions, independence, refinements. (English) Zbl 0999.68202 Artif. Intell. 140, No. 1-2, 153-173 (2002). MSC: 68T20 PDFBibTeX XMLCite \textit{M. Broxvall} et al., Artif. Intell. 140, No. 1--2, 153--173 (2002; Zbl 0999.68202) Full Text: DOI
Lebbah, Yahia; Lhomme, Olivier Accelerating filtering techniques for numeric CSPs. (English) Zbl 1015.68178 Artif. Intell. 139, No. 1, 109-132 (2002). MSC: 68T20 PDFBibTeX XMLCite \textit{Y. Lebbah} and \textit{O. Lhomme}, Artif. Intell. 139, No. 1, 109--132 (2002; Zbl 1015.68178) Full Text: DOI
Gottlob, Georg; Scarcello, Francesco; Sideri, Martha Fixed-parameter complexity in AI and nonmonotonic reasoning. (English) Zbl 0995.68118 Artif. Intell. 138, No. 1-2, 55-86 (2002). MSC: 68T37 PDFBibTeX XMLCite \textit{G. Gottlob} et al., Artif. Intell. 138, No. 1--2, 55--86 (2002; Zbl 0995.68118) Full Text: DOI
Frigioni, D.; Marchetti-Spaccamela, A.; Nanni, U. Dynamic algorithms for classes of constraint satisfaction problems. (English) Zbl 0973.68216 Theor. Comput. Sci. 259, No. 1-2, 287-305 (2001). MSC: 68T20 PDFBibTeX XMLCite \textit{D. Frigioni} et al., Theor. Comput. Sci. 259, No. 1--2, 287--305 (2001; Zbl 0973.68216) Full Text: DOI
Gottlob, G.; Leone, N.; Scarcello, F. A comparison of structural CSP decomposition methods. (English) Zbl 0952.68044 Artif. Intell. 124, No. 2, 243-282 (2000). MSC: 68P15 PDFBibTeX XMLCite \textit{G. Gottlob} et al., Artif. Intell. 124, No. 2, 243--282 (2000; Zbl 0952.68044) Full Text: DOI
Gent, I.; Stergiou, K.; Walsh, T. Decomposable constraints. (English) Zbl 0952.68130 Artif. Intell. 123, No. 1-2, 133-156 (2000). MSC: 68T20 PDFBibTeX XMLCite \textit{I. Gent} et al., Artif. Intell. 123, No. 1--2, 133--156 (2000; Zbl 0952.68130) Full Text: DOI
Brucker, Peter; Drexl, Andreas; Möhring, Rolf; Neumann, Klaus; Pesch, Erwin Resource-constrained project scheduling: Notation, classification, models, and methods. (English) Zbl 0937.90030 Eur. J. Oper. Res. 112, No. 1, 3-41 (1999). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} et al., Eur. J. Oper. Res. 112, No. 1, 3--41 (1999; Zbl 0937.90030) Full Text: DOI
Jeavons, Peter; Cohen, David; Cooper, Martin C. Constraints, consistency and closure. (English) Zbl 0909.68076 Artif. Intell. 101, No. 1-2, 251-265 (1998). MSC: 68Q15 PDFBibTeX XMLCite \textit{P. Jeavons} et al., Artif. Intell. 101, No. 1--2, 251--265 (1998; Zbl 0909.68076) Full Text: DOI
Dendris, Nick D.; Kirousis, Lefteris M.; Thilikos, Dimitrios M. Fugitive-search games on graphs and related parameters. (English) Zbl 0903.68052 Theor. Comput. Sci. 172, No. 1-2, 233-254 (1997). MSC: 68P10 68R10 PDFBibTeX XMLCite \textit{N. D. Dendris} et al., Theor. Comput. Sci. 172, No. 1--2, 233--254 (1997; Zbl 0903.68052) Full Text: DOI
Ben-Eliyahu, Rachel; Dechter, Rina Default reasoning using classical logic. (English) Zbl 1506.68131 Artif. Intell. 84, No. 1-2, 113-150 (1996). MSC: 68T27 03B60 68Q25 68T20 PDFBibTeX XMLCite \textit{R. Ben-Eliyahu} and \textit{R. Dechter}, Artif. Intell. 84, No. 1--2, 113--150 (1996; Zbl 1506.68131) Full Text: DOI
Ben-Eliyahu, Rachel; Dechter, Rina On computing minimal models. (English) Zbl 0891.68109 Ann. Math. Artif. Intell. 18, No. 1, 3-27 (1996). MSC: 68T30 68T27 PDFBibTeX XMLCite \textit{R. Ben-Eliyahu} and \textit{R. Dechter}, Ann. Math. Artif. Intell. 18, No. 1, 3--27 (1996; Zbl 0891.68109) Full Text: DOI
Dendris, Nick D.; Kirousis, Lefteris M.; Thilikos, Dimitris M. Fugitive-search games on graphs and related parameters. (English) Zbl 07784137 Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 331-342 (1995). MSC: 05C57 05C38 05C12 91A43 91A24 PDFBibTeX XMLCite \textit{N. D. Dendris} et al., Lect. Notes Comput. Sci. 903, 331--342 (1995; Zbl 07784137) Full Text: DOI
Jeavons, Peter; Cohen, David An algebraic characterization of tractable constraints. (English) Zbl 1527.68213 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 1st international conference, COCOON ’95, Xi’an, China, August 24–26, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 959, 633-642 (1995). MSC: 68T20 68Q25 PDFBibTeX XMLCite \textit{P. Jeavons} and \textit{D. Cohen}, Lect. Notes Comput. Sci. 959, 633--642 (1995; Zbl 1527.68213) Full Text: DOI
Jeavons, Peter G.; Cooper, Martin C. Tractable constraints on ordered domains. (English) Zbl 1508.68132 Artif. Intell. 79, No. 2, 327-339 (1995). MSC: 68Q25 68R07 68T20 PDFBibTeX XMLCite \textit{P. G. Jeavons} and \textit{M. C. Cooper}, Artif. Intell. 79, No. 2, 327--339 (1995; Zbl 1508.68132) Full Text: DOI
Jeavons, Peter G.; Cooper, Martin C. Tractable constraints on ordered domains. (English) Zbl 1013.68503 Artif. Intell. 79, No. 2, 327-339 (1995). MSC: 68Q25 68T20 68Q17 PDFBibTeX XMLCite \textit{P. G. Jeavons} and \textit{M. C. Cooper}, Artif. Intell. 79, No. 2, 327--339 (1995; Zbl 1013.68503) Full Text: DOI
Ben-Eliyahu, Rachel; Dechter, Rina Propositional semantics for disjunctive logic programs. (English) Zbl 0858.68012 Ann. Math. Artif. Intell. 12, No. 1-2, 53-87 (1994). MSC: 68N17 PDFBibTeX XMLCite \textit{R. Ben-Eliyahu} and \textit{R. Dechter}, Ann. Math. Artif. Intell. 12, No. 1--2, 53--87 (1994; Zbl 0858.68012) Full Text: DOI
Pesch, Erwin; Drexl, Andreas; Kolen, Antoon Model-based inference in CHARME. (Modellbasierte Inferenz in CHARME.) (German. English summary) Zbl 0938.68821 OR Spektrum 16, No. 3, 193-202 (1994). MSC: 68T15 PDFBibTeX XMLCite \textit{E. Pesch} et al., OR Spektrum 16, No. 3, 193--202 (1994; Zbl 0938.68821) Full Text: DOI
Cooper, Martin C.; Cohen, David A.; Jeavons, Peter G. Characterising tractable constraints. (English) Zbl 0803.68053 Artif. Intell. 65, No. 2, 347-361 (1994). MSC: 68Q25 68R10 68T20 PDFBibTeX XMLCite \textit{M. C. Cooper} et al., Artif. Intell. 65, No. 2, 347--361 (1994; Zbl 0803.68053) Full Text: DOI
Gyssens, Marc; Jeavons, Peter G.; Cohen, David A. Decomposing constraint satisfaction problems using database techniques. (English) Zbl 0803.68090 Artif. Intell. 66, No. 1, 57-89 (1994). MSC: 68R10 68Q25 68P15 05C65 PDFBibTeX XMLCite \textit{M. Gyssens} et al., Artif. Intell. 66, No. 1, 57--89 (1994; Zbl 0803.68090) Full Text: DOI
Kirousis, Lefteris M. Fast parallel constraint satisfaction. (English) Zbl 1422.68122 Lingas, Andrzej (ed.) et al., Automata, languages and programming. 20th international colloquium, ICALP 93, Lund, Sweden, July 5–9, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 700, 418-429 (1993). MSC: 68Q25 68R10 68W10 PDFBibTeX XMLCite \textit{L. M. Kirousis}, Lect. Notes Comput. Sci. 700, 418--429 (1993; Zbl 1422.68122) Full Text: DOI
Jeavons, Peter G. Counting representable sets on simple graphs. (English) Zbl 0792.05054 Discrete Appl. Math. 47, No. 1, 33-46 (1993). Reviewer: Liu Yanpei (Beijing) MSC: 05C15 05C50 05C38 PDFBibTeX XMLCite \textit{P. G. Jeavons}, Discrete Appl. Math. 47, No. 1, 33--46 (1993; Zbl 0792.05054) Full Text: DOI
Kirousis, Lefteris M. Fast parallel constraint satisfaction. (English) Zbl 0787.68091 Artif. Intell. 64, No. 1, 147-160 (1993). MSC: 68T20 68W15 PDFBibTeX XMLCite \textit{L. M. Kirousis}, Artif. Intell. 64, No. 1, 147--160 (1993; Zbl 0787.68091) Full Text: DOI
Galle, Per Branch & Sample: A simple strategy for constraint satisfaction. (English) Zbl 0677.68102 BIT 29, No. 3, 395-408 (1989). MSC: 68T20 68T99 68P10 68U99 PDFBibTeX XMLCite \textit{P. Galle}, BIT 29, No. 3, 395--408 (1989; Zbl 0677.68102) Full Text: DOI
Dechter, Rina; Pearl, Judea Network-based heuristics for constraint-satisfaction problems. (English) Zbl 0643.68156 Artif. Intell. 34, No. 1, 1-38 (1988). MSC: 68T20 PDFBibTeX XMLCite \textit{R. Dechter} and \textit{J. Pearl}, Artif. Intell. 34, No. 1, 1--38 (1988; Zbl 0643.68156) Full Text: DOI