Extremal CSPsPRCOVIC, Nicolas.Lecture notes in computer science. 2005, pp 807-811, issn 0302-9743, isbn 3-540-29238-1, 1Vol, 5 p.Conference Paper

Distributed constraint satisfactionFALTINGS, Boi; YOKOO, Makoto.Artificial intelligence. 2005, Vol 161, Num 1-2, issn 0004-3702, 251 p.Serial Issue

Distributed constraint satisfaction with cooperating asynchronous solversRINGWELSKI, Georg.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 777Conference Paper

Distributed splitting of constraint satisfaction problemsARBAB, Farhad; MONFROY, Eric.Lecture notes in computer science. 2000, pp 115-132, issn 0302-9743, isbn 3-540-41020-1Conference Paper

Distributed constraint satisfaction as a computational model of negotiation via argumentationJUNG, Hyuckchul.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 767Conference Paper

International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2005)BARTAK, Roman; MILANO, Michela.Constraints (Dordrecht). 2006, Vol 11, Num 4, issn 1383-7133, 106 p.Conference Proceedings

On Identifying Infeasible Subsets in Constraint Satisfaction ProblemsHU, J; GALINIER, P; CAMINADA, A et al.Artificial intelligence. International conferenceWorldComp'2010. 2010, pp 615-619, isbn 1-60132-146-5 1-60132-147-3 1-60132-148-1, 5 p.Conference Paper

Constraint programming next challenge: Simplicity of usePUGET, Jean-Francois.Lecture notes in computer science. 2004, pp 5-8, issn 0302-9743, isbn 3-540-23241-9, 4 p.Conference Paper

Circuit consistenciesIDRISSI, Abdellah; BEN HASSINE, Ahlem.Lecture notes in computer science. 2004, pp 124-133, issn 0302-9743, isbn 3-540-22817-9, 10 p.Conference Paper

Separating search and strategy in solver cooperationsPAJOT, Brice; MONFROY, Eric.Lecture notes in computer science. 2003, pp 401-414, issn 0302-9743, isbn 3-540-20813-5, 14 p.Conference Paper

Special Issue on Constraint Satisfaction for Planning and Scheduling ProblemsBARTAK, Roman; SALIDO, Miguel A.Constraints (Dordrecht). 2011, Vol 16, Num 3, issn 1383-7133, 119 p.Serial Issue

Asynchronous backtracking without adding links: a new member in the ABT familyBESSIERE, Christian; MAESTRE, Arnold; BRITO, Ismel et al.Artificial intelligence. 2005, Vol 161, Num 1-2, pp 7-24, issn 0004-3702, 18 p.Article

Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solvingWALLACE, Richard J; FREUDER, Eugene C.Artificial intelligence. 2005, Vol 161, Num 1-2, pp 209-227, issn 0004-3702, 19 p.Article

Consistency for quantified constraint satisfaction problemsNIGHTINGALE, Peter.Lecture notes in computer science. 2005, pp 792-796, issn 0302-9743, isbn 3-540-29238-1, 1Vol, 5 p.Conference Paper

High-order consistency in valued constraint satisfactionCOOPER, Martin C.Constraints (Dordrecht). 2005, Vol 10, Num 3, pp 283-305, issn 1383-7133, 23 p.Article

Maximum constraint satisfaction on diamondsKROKHIN, Andrei; LAROSE, Benoit.Lecture notes in computer science. 2005, pp 388-402, issn 0302-9743, isbn 3-540-29238-1, 1Vol, 15 p.Conference Paper

A comparative study of arithmetic constraints on integer intervalsAPT, Krzysztof R; ZOETEWEIJ, Peter.Lecture notes in computer science. 2004, pp 1-24, issn 0302-9743, isbn 3-540-21834-3, 24 p.Conference Paper

Learning approximate consistenciesLALLOUET, Arnaud; LEGTCHENKO, Andreï; DAO, Thi-Bich-Hanh et al.Lecture notes in computer science. 2004, pp 87-106, issn 0302-9743, isbn 3-540-21834-3, 20 p.Conference Paper

The impact of AND/OR search spaces on constraint satisfaction and countingDECHTER, Rina; MATEESCU, Robert.Lecture notes in computer science. 2004, pp 731-736, issn 0302-9743, isbn 3-540-23241-9, 6 p.Conference Paper

Interchangeability in soft CSPsBISTARELLI, Stefano; FALTINGS, Boi; NEAGU, Nicoleta et al.Lecture notes in computer science. 2003, pp 31-46, issn 0302-9743, isbn 3-540-00986-8, 16 p.Conference Paper

Global optimization and constraint satisfaction (Valbonne-Sophia Antipolis, 2-4 October 2002, revised selected papers)Bliek, Christian; Jermann, Christophe; Neumaier, Arnold et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20463-6, XII, 238 p, isbn 3-540-20463-6Conference Proceedings

(IN)Effectiveness of look-ahead techniques in a modern SAT solverGIUNCHIGLIA, Enrico; MARATEA, Marco; TACCHELLA, Armando et al.Lecture notes in computer science. 2003, pp 842-846, issn 0302-9743, isbn 3-540-20202-1, 5 p.Conference Paper

Solving difficult SAT instances in the presence of symmetryALOUL, Fadi A; RAMANI, Arathi; MARKOV, Igor L et al.Design automation conference. 2002, pp 731-736, isbn 1-58113-461-4, 6 p.Conference Paper

On the dynamic detection of interchangeability in finite constraint satisfaction problemsBECKWITH, Amy M; CHOUEIRY, Berthe Y.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 760Conference Paper

Translations for comparing soft frameworksGENNARI, Rosella.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 764Conference Paper