, THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.18, issue.03, pp.265-298, 2004.
DOI : 10.1142/S0218001404003228
URL : https://hal.archives-ouvertes.fr/hal-01408706
, Constraint satisfaction algorithms for graph pattern matching, Mathematical Structures in Computer Science, vol.12, issue.04, pp.403-422, 2002.
DOI : 10.1017/S0960129501003577
, The Taming of the (X)OR, Computational Logic ? CL 2000, pp.508-522, 2000.
DOI : 10.1007/3-540-44957-4_34
, An extensible sat-solver [ver 1.2, SAT 2003, pp.502-508, 2003.
, Bipartitions et equations lineaires, Programmation en logique avec contraintes, pp.299-302, 2003.
, Aligning CNF- and Equivalence-Reasoning, Seventh International Conference on Theory and Applications of Satisfiability Testing, 2004.
DOI : 10.1007/11527695_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.2212
, The puzzling role of simplification in propositional satisfiability, EPIA'01 Workshop on Constraint Satisfaction and Operational Research Techniques for Problem Solving (EPIA-CSOR), 2001.
, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, 2001.
DOI : 10.1145/378239.379017
, Boolean ring satisfiability, Seventh International Conference on Theory and Applications of Satisfiability Testing, pp.281-286, 2004.
, Parts Inference: Closed and Semi-closed Partitioning graphs, Proceedings of the 7th IJCAI, pp.304-309, 1981.
, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350
, NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances, Selected Revised Papers of International Conference on Theory and Applications of Satisfiability Testing Conference (Springer LNCS), pp.276-291, 2004.
DOI : 10.1007/11527695_22
, A two-phase algorithm for solving a class of hard satisfiability problems, Operations Research Letters, vol.23, issue.3-5, pp.81-88, 1998.
DOI : 10.1016/S0167-6377(98)00052-2
, Approximating propositional knowledge with affine formulas, Proc. 15th European Conference on Artificial Intelligence (ECAI'02), pp.287-291, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00995239
, %0)($2%)&0$)20, 8& $0& %/K& 6."H$.& :"%0)($2%)0& $%=& 0/$(:-& )/:-%2L7/0&$%0)($2%)%0)($2%)0& 2%&702"%08& $%=&%0)($2%)& #"=/.& K2)-& N0%2L7/& 20& %")& "%.4& :"#G./)/.4& 2%=%0)($2%)&, pp.2-6
, &2#G&RSI&$%=&T5& 0, 2%6& )$0+.$)2"%&07:-&$0&=2%6&$%=&H=2%6& N2%)("=7:/=& 2%& XC[Z& $%=& ;"(#$..4& =/0:(2H/=& 2%& X\ZP?& 107$..4& )#7.$)2"%& 20& 7G& )"& )-/& 70/(& H4& 702%6& )/:-%2L7/0&07:-&$0&$==2%6&04##/)(4&H(/$+2%6&"(&2#G.2/=&:"%0)($2%)08&/%:"=2%6&G$(, p.70
, 2)&2%;"(#$)2"%&, %0)($2%)0&$%6/(& :"%020)/%:4& )/:-%2L7/8&%020)/%:4& 2%0)/$=& ";& $(:& :"%020)/%:4?& M"K/3/(8& )-/& #$2%& G("H./#& K2)-& 0)("%6/(& :"%020)/%:4& )/:-%2L7/0& 20& )-/2(& )2#/& $%=& 0G$:/& :"#G./J2)4& K-2:-& =20L7$.248& 0)32%6&2%2)2$..4&2%:"%020)/%)&3$.7/0&;("#&3$%0)($2%)0& )-$)& $(/& =/=7:/=& =7(2%6& )-/& 2%2)2$.& :"%020)/%:4& G%0)($2%)&%& $(:& :"%020)/%:4&XBZ&)"&=%0)($2%)0&H%&3$&_G.$2%`&:"%020)/%:4&)/:-%2L7/0&07:-&$0&$(:& :"%020)/%:4&"(&G$)-&:"%020)/%:4P?&I-%020)/%:4& 20& $%&%0)($2%)0&)-$)&K/&$8& 2#G.2:$)2"%8& $%=& /J:.702"%& :"%0)($2%)0?2H7)/0&$&.")&)"&(/#"32%6&2%2)2$.& 2%:"%020)%0)($2%)0&=#&RS,&:$%&G& 2%&G("H./#&0".32%6?& I-/&G$G/(&20&"(6$%2F/=&$0&K0?&S;)/(&6232%6&)-/&2%2)2$.&#")23$)2"%&;"(&"7(&K, pp.3-3
URL : https://hal.archives-ouvertes.fr/hal-00093459
, &H($%:-2%6P?&I, 2=2)4&3$%0)($2%)0&0G%0)($2%)&&3$.2=2)4&3$
, %0)($2%), 0& )-$)& :$%& =/=7:/& 2#G.2/=& :"%0)($2%)0& 2#G2=2)4& 0)$)70& 20& 2=0&$%=&/J:.702"%0?& I-/& $H"3/& G("H./#& 20& %")& )-/& "%.4& G("H./#& :"#H2%2%6& '""./$%& $%=& )/#G"($.&, pp.2-926770
, %:2.2$)2, %& 3$.2=2), p.4
, %:2.2$)2"%&G, =&, vol.2, issue.00204223, pp.7-13
, %& $, R5&$%=&2)0&S,&$%=&RS
, %O 2%0)$%)2$)/=& N, %020)/%)&3$.7
, *) 8'&, &0$#/&3$.7/&2%& $%4&0".7)2"%&0"&K/&:$%&G7)&/L7$.2)4&:"%0)($2%)&H&2%0)$%)2$)%& 3$(2$H./0& 2%& 58& ="#0N5P& $(/& ="#$2%0& ";& 58& Q d & c& ebf& #/$%0& )-$)& )-/& ="#$2%&, p.7
, %&, %0)($2%)&
, =>$!?56:4)4@@43$($4, p.4
, %&20&3, %0)($2%)& 0
, %&";&0, %0)($2%)
, HBCHHEGD
, %0)($2%)0?&V&0, pp.4-6
, %0)($2%)0& 702%6&, 7%=$)2"%& 7%=/(&)-/&:"%)($:)&%
, ++1+K&"%K5)12.8H&& & !%
, ++1+K& F)5G%$8, #15)&56& "&4$)2"1+& "K$+2& 1/& )$R(1)$9H& Q2& 1/& 2.$& 4+9& #$.14%$, p.62
, 4215+& 56& 2, %K5)12.8H& J$& $T"42%*& 65%%5L& 2.$& 5)1K1+"%& M)"F.!%"+& "%K5)12.8& $T4$F2& 22& F)5S$4215+& 45+/1/2$+4*& `L12.& )$/F$42& 25& F)5S$4215+& 65)& "& /5%(215+& 56& 2.$& /(FF5)2/& F)5G%$8H& J.$+$#$)& 2.$& G"4,2)"4,1+K&"%K5)12.8&8FF5)21+K&"4215+&65)&"+&"258&1/&/$%$42$9a&, pp.9-41
, 12$b&, pp.218-866
, 4215+& L12+&$T2)"4215+&F, 9#"+2"K$&5+&.")9&F)&1/&(F& 25&"G5(2& !&&&3 H&75)$5#$)&L$&4"+&2&2.$&%")K$)&2.$&F5)215+&56&218$&1/&/F$+2&G*& /$")4.&2.$&G$22$)&2.$&18F)5#$8$+2&G*&(/$&56&F)
, 4214$H& 75& `g*+"814a& -'!b& fTF%5121+K& fZ_@& ggZ& "+9& 52++1+K&`f++1+K&`f-!N^ea@& =\CN=e=@& _P-'& AX[B@& 'F)1+K$)Nl$)%"K@&A^^eH& AAH& k"(2D@&dH&UH@&'$%8"+@&ZHb&0+16*1+K&)+"215+"%& m51+2& -5+6$)$+4$& 5+& U)216141"%& Q+2$%%1K$+4$& `Qm-UQN^^a@& XABNX=?@& 75)K"+&k, ++1+K&-58F$21215+H&f#$+2& 1+& 28F"21@& 'H@& !"),$)@& fH@& _"8G)$4.2@& fHb& 0+9$)/2"+91+K& "+9& fT2$+91+K& M)"F.!%"+H& Q+& !)54$$91+K/& 56& [2.& f()5F$"+& -5+6$)$+4$& 5+& !%44.(/@& 3Hb& M$+$)"%1D1+K& M)"F.!%"+& G*& 35)8(%"21+K& !%H& Q+& !)54$$91+K/& 56& 2.$& AB2.& Q+2$)+"215+"%& m51+2& -5+6$)$+4$& 5+& U)216141"%& Q+2$%%1K$+4$& `Qm-UQN=CCXa@&^?[N^\C@&75)K"+&k"(68"++&!(G%11+2/&56&g166$)$+4$H&Q+&!)54$$91+K/&56&2.$&A=2.& P"215+"%&-5+6$)$+4$&5+&U)216141"%&Q+2$%%1K$+4$&`UUUQN^[a@&X\=NX\e@&UUUQ&!)$//@&A^^[H& A\H& '812.@& gH& fH@& J$%9@& gH& 'Hb& O$8F5)"%& !%"++1+K& L12.&%& fT4%(/15+& E$"/5+1+KH& Q+& !)5N 4$$91+K/& 56& 2.$& A\2.& Q+2$)+"215+"%& m51+2& -5+6$)$+4$& 5+& U)216141"%& Q+2$%%1K$+4$& `Qm-UQN^^a@& X=\NXXe@&75)K"+&k"(68"++@&A^^^H& AeH& '()*+$&9()1+K& '$")4.H&U44$F2$9&25&2.$&=C2.&3_UQE'&45+6$)$+4$@&k$*&J$/2@&3%5)19"@&0'U@&=CCeH&O$4.+14"%& )$F5)2& +5H& X=B@& QOQ& '$)1$/@& .22Fb>>121H866H4(+1H4D>/$)1$/>1+9$TH.28%@& -.")%$/& 0+1#$)/12*@& !)"N K($@&-D$4.&E$F(G%14@&=CCeH& ABH& '()*+$,@&!Hb&-5+/2)"1+2&Z"/$9&E$"/5+1+K&5#$)&7(2$T&E$%"215+/&1+&!%"++1+K&M)"F./&9()1+K& '$")4.H&O$4.+14"%&)$F5)2&+5H&X=^@&QOQ&'$)1$/@&.22Fb>>121H866H4(+1H4D>/$)1$/>1+9$TH.28%@&-.")%$/& 0+1#$)/12*@&!)"K($@&-D$4.&E$F
, %& )$F5)2& +5H& X[C@& QOQ& '$)1$/@&, 4215+@& E$65)8(%"215+@& "+9& UFF)5T18"215+&`'215+&`'UEUN=CCea@& -"+"9"@& =CCeH& O$41+2&!)5K)"881+K&UFF)5"4.&25&!%"++1+KH&Q+&!)5N 4$$91+K/& 56& 2.$& A\2.& P"215+"%& -5+6$)$+4$& 5+& U)216141"%& Q+2$%%1K$+4$& `UUUQN^^a@& ?B?N?^C@& UUUQ&!)$//@&A^^^H& References 1. Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. Proc. of ISMIS'93, pp.350-361, 1993.
, Symmetry breaking predicates for search problems, Proc. of the 5th Int. Conf. on Knowledge Representation and Reasoning, pp.148-159, 1996.
, Breaking Row and Column Symmetries in Matrix Models, 8th Int. Conf. on Principles and Practices of Constraint Programming, 2002.
DOI : 10.1007/3-540-46135-3_31
, Global Constraints for Integer and Set Value Precedence, Proc. of 10th Int. Conf. on Principles and Practice of Constraint Programming, pp.362-376, 2004.
DOI : 10.1007/978-3-540-30201-8_28
, Symmetry Breaking, Proc. of 7th Int. Conf. on Principles and Practice of Constraint Programming (CP2001), pp.93-107, 2001.
DOI : 10.1007/3-540-45578-7_7
, Symmetry breaking in constraint programming, Proc. of ECAI-2000, pp.599-603, 2000.
, Tractable symmetry breaking using restricted search trees, Proc. of ECAI-2004, 2004.
, Breaking Value Symmetry, NICTA and UNSW, 2007.
DOI : 10.1007/978-3-540-74970-7_67
, Static and dynamic structural symmetry breaking, Proc. of 12th Int. Conf. on Principles and Practice of Constraint Programming (CP2006), 2006.
, Structural symmetry breaking, Proc. of 19th IJCAI, 2005.
, A Regular Language Membership Constraint for Finite Sequences of Variables, Proc. of 10th Int. Conf. on Principles and Practice of Constraint Programming, pp.482-295, 2004.
DOI : 10.1007/978-3-540-30201-8_36
, Global Grammar Constraints, 12th Int. Conf. on Principles and Practices of Constraint Programming, p.-Verlag, 2006.
DOI : 10.1007/11889205_64
, Propagation algorithms for lexicographic ordering constraints, Artificial Intelligence, vol.170, issue.10, pp.803-908, 2006.
DOI : 10.1016/j.artint.2006.03.002
, Symmetry breaking using value precedence, Proc. of the 17th ECAI, 2006.
, Improved Algorithms for the Global Cardinality Constraint, Proc. of 10th Int. Conf. on Principles and Practice of Constraint Programming, 2004.
DOI : 10.1007/978-3-540-30201-8_40
, Breaking All Value Symmetries in Surjection Problems, Proc. of 11th Int. Conf. on Principles and Practice of Constraint Programming (CP2005), 2005.
DOI : 10.1007/11564751_37
, Using Constraints to Break Value Symmetries in Constraint Satisfaction Problems, 2005.
, Generating effective symmetry-breaking predicates for search problems, Proc. of LICS workshop on Theory and Applications of Satisfiability Testing, 2001.
, Breaking symmetries in all different problems, Proc. of 19th IJCAI, pp.272-277, 2005.
, Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction, Constraints, vol.10, issue.1, pp.221-267, 2006.
DOI : 10.1007/s10601-006-7095-8
, A Discrete Stochastic Neural Network Algorithm for Constraint Satisfaction Problems, proceedings of the international Joint Conference on Neural Networks, 1990.
, Dynamic Variable Ordering in CSPs, Proceedings the First International Conference on Principle and Practice of Constraint Programming, pp.258-275, 1995.
, on forward checking for non-binary constraint satisfaction, Larrosa J. Artificial Intelligence, vol.141, pp.205-224, 2002.
, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problem, CP'96, 1996.
, An Optimal Coarse-grained Arc Consistency Algorithm, Artificial Intelligence, vol.165, issue.2, pp.165-185, 2001.
, Random Constraint Satisfaction: Flaws and Structure, Journal of Constraints, vol.6, issue.4, pp.345-372, 2001.
, A Study of backtracking based informed algorithms, 2004.
, How easy is local search, Journal of Computer and System Sciences, vol.37, pp.79-100, 1988.
, Optimization by simulated annealing: An experimental evaluation, part II, Journal of Operations Research, 1990.
, Analysing a heuristic strategy for constraint-satisfaction and scheduling Intelligent scheduling p, pp.257-290, 1994.
, Solving large scale constraint satisfaction and scheduling problems using a heuristic repair method, proceedings AAAI- 90, pp.17-24, 1990.
, Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems, Artificial Intelligence, vol.58, pp.161-205, 1992.
, A new method for solving hard satisfiability problems, proceedings AAAI-92, 1992.
, A polynomial time algorithm for the n-queens problem, 1990.
, Foundations of Constraint Satisfaction Problems Increasing tree search efficiency for constraint satisfaction problems, References 1. R. Haralick, pp.263-313, 1980.
, Contradicting conventional wisdom in constraint satisfaction, Proc. of ECAI, pp.125-129, 1994.
DOI : 10.1007/3-540-58601-6_86
, Tree clustering for constraint networks, Artificial Intelligence, vol.38, issue.3, pp.353-366, 1989.
DOI : 10.1016/0004-3702(89)90037-4
, A comparison of structural CSP decomposition methods, Artificial Intelligence, vol.124, issue.2, pp.343-282, 2000.
DOI : 10.1016/S0004-3702(00)00078-3
, Combining hypertree, bicomp and hinge decomposition, Proc. of ECAI, pp.161-165, 2002.
, Hybrid backtracking bounded by tree-decomposition of constraint networks, Artificial Intelligence, vol.146, issue.1, pp.43-75, 2003.
DOI : 10.1016/S0004-3702(02)00400-9
, Constraint processing, 2003.
, HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational Intelligence, vol.1, issue.4, pp.268-299, 1993.
DOI : 10.1016/0004-3702(77)90007-8
, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, issue.3, pp.273-312, 1990.
DOI : 10.1016/0004-3702(90)90046-3
, Backtracking Throught Biconnected Components of a Constraint Graph, Proc. of IJCAI, pp.291-296, 2001.
, A sufficient condition for backtrack-bounded search, Journal of the ACM, vol.32, issue.4, pp.755-761, 1985.
DOI : 10.1145/4221.4225
, Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems, Proc. of IJCAI, pp.1076-1078, 1985.
, A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraints Satisfaction Problem, Proc. of AAAI, pp.298-304, 1996.
, AND/OR search spaces for graphical models, Artificial Intelligence, vol.171, issue.2-3, pp.73-106, 2007.
DOI : 10.1016/j.artint.2006.11.003
, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4
, Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs, Proc. of IJCAI, pp.112-117, 2007.
, Decomposing constraint satisfaction problems using database techniques, Artificial Intelligence, vol.66, issue.1, pp.57-89, 1994.
DOI : 10.1016/0004-3702(94)90003-5
, Some NP-complete Problems on Graphs, Proc. of the Conference on Information Sciences and Systems, pp.91-95, 1977.
, Nogood Recording for Static and Dynamic Constraint Satisfaction Problems, IJAIT, vol.3, issue.2, pp.187-207, 1994.
, Dynamic Backtracking, Journal of Artificial Intelligence Research, vol.1, pp.25-46, 1993.
, Semiring-based CSPs and valued CSPs: Basic properties and comparison, LNCS, pp.1106-121, 1996.
DOI : 10.1007/3-540-61479-6_19
, Term Rewriting and All That, 1998.
, Extending arbitrary solvers with constraint handling rules, Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming , PPDP '03, pp.79-90, 2003.
DOI : 10.1145/888251.888260
, The Refined Operational Semantics of Constraint Handling Rules, LNCS, vol.3132, pp.90-104, 2004.
DOI : 10.1007/978-3-540-27775-0_7
, On the sequential nature of unification, The Journal of Logic Programming, vol.1, issue.1, pp.35-50, 1984.
DOI : 10.1016/0743-1066(84)90022-0
, Theory and practice of constraint handling rules, The Journal of Logic Programming, vol.37, issue.1-3, pp.95-138, 1998.
DOI : 10.1016/S0743-1066(98)10005-5
, Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis, ICLP 2005, pp.113-127, 2005.
DOI : 10.1007/11562931_11
, Specialization of Concurrent Guarded Multi-set Transformation Rules, LNCS, vol.3573, pp.133-148, 2004.
DOI : 10.1007/11506676_9
, Essentials of Constraint Programming, 2003.
DOI : 10.1007/978-3-662-05138-2
, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM, vol.27, issue.4, pp.797-821, 1980.
DOI : 10.1145/322217.322230
, Unification: a multidisciplinary survey, ACM Computing Surveys, vol.21, issue.1, pp.93-124, 1989.
DOI : 10.1145/62029.62030
, Complete axiomatizations of the algebras of finite, rational and infinite trees, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, pp.348-357, 1988.
DOI : 10.1109/LICS.1988.5132
, Efficient unification with infinite terms in logic programming, FGCS'84, pp.202-209, 1984.
, Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees, Recent Advances in Constraints, of LNCS
DOI : 10.1007/978-3-540-73817-6_9
URL : https://hal.archives-ouvertes.fr/hal-00202313
, The K.U.Leuven CHR system: implementation and application, CHR 2004, Selected Contributions, 2004.
, Optimal union-find in Constraint Handling Rules, Theory and Practice of Logic Programming, vol.6, issue.1-2, pp.213-224, 2006.
DOI : 10.1017/S1471068405002541
, The Constraint Handling Rules (CHR) web page, 2007.
, Worst-case Analysis of Set Union Algorithms, Journal of the ACM, vol.31, issue.2, pp.245-281, 1984.
DOI : 10.1145/62.2160
, Linear objects: Logical processes with built-in inheritance, New Generation Computing, vol.9, pp.445-473, 1991.
, Concurrent constraint programming with information removal, Proceedings of Coordination, Lecture Notes in Computer Science, 1997.
, GNU Prolog user's manual, 1999.
, A higher-order module discipline with separate compilation, dynamic linking, and pickling, 1998.
, Prolog: The Standard, 1996.
, Linear Concurrent Constraint Programming: Operational and Phase Semantics, Information and Computation, vol.165, issue.1, pp.14-41, 2001.
DOI : 10.1006/inco.2000.3002
URL : https://hal.archives-ouvertes.fr/hal-01431358
, Linear logic, Theoretical Computer Science, vol.50, issue.1, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966
, ICLP 2005 Doctoral Consortium, Proceedings of International Conference on Logic Programming ICLP 2005, pp.448-449, 2005.
DOI : 10.1007/11562931_50
, Modules for Prolog Revisited, Proceedings of International Conference on Logic Programming ICLP 2006, number 4079 in Lecture Notes in Computer Science, pp.41-55, 2006.
DOI : 10.1007/11799573_6
, A Proof-Theoretic Approach to Logic Programming, Journal of Logic and Computation, vol.1, issue.5, pp.635-660, 1991.
DOI : 10.1093/logcom/1.5.635
, Programming in Lygon: An overview, Proceedings of the Fifth International Conference on Algebraic Methodology and Software Technology, pp.391-405, 1996.
DOI : 10.1007/BFb0014329
, Logic Programming in a Fragment of Intuitionistic Linear Logic, Information and Computation, vol.110, issue.2, pp.327-365, 1994.
DOI : 10.1006/inco.1994.1036
, A modular module system, Journal of Functional Programming, vol.10, issue.3, pp.269-303, 2000.
DOI : 10.1017/S0956796800003683
URL : https://hal.archives-ouvertes.fr/inria-00073825
, On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.59-68, 2006.
DOI : 10.1109/LICS.2006.39
URL : https://hal.archives-ouvertes.fr/inria-00201096
, Logic programming in the context of multiparadigm programming: the Oz experience, Theory and Practice of Logic Programming, vol.3, issue.6, pp.715-763, 2003.
, Concurrent constraint programming ACM Doctoral Dissertation Awards, 1993.
, Higher-order linear concurrent constraint programming, 1992.
, A prolog technology theorem prover For the left hand side premise, let {x 1 , x 1 } be a partition of x such as x 1 = x?V P (d 1 ) and x 1 = x\V P (d 1 ) and {t 1 , t 1 } the corresponding partition of t. Hence, we have V P (d 1 [x 1 \t 1 ]) = V P (d 1 ) and therefore by induction hypothesis V P (t 1 ) ? A(V P (d 1 ), ? 1 ) Using, the same reasoning we infer that V P (t 2 ) ? A(V P (d 2 ), ? 2 ) where t 2 is the subsequence of t which corresponds to x 2 = x ? V P (d 2 ). By hypothesis we have x ? V P (d 1 ? d 2 ) an then V P (t) ? (A(V P (d 1 ), ? 1 ) ? A(V P (d 2 ), ? 2 )) ? A(V P, pp.353-380, 1988.
, Properties (i-iv) hold in state S 0 by our encoding of the initial pre-flow
, Confluence and semantics of constraint simplification rules, Constraints, vol.4, issue.2, pp.133-165, 1999.
DOI : 10.1023/A:1009842826135
, On the parallel implementation of Goldberg's maximum flow algorithm, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures , SPAA '92, pp.168-177, 1992.
DOI : 10.1145/140901.140919
, Principles of Chemical Programming, Electronic Notes in Theoretical Computer Science, vol.124, issue.1, pp.133-147, 2004.
DOI : 10.1016/j.entcs.2004.07.019
, A Linear-Logic Semantics for Constraint Handling Rules, CP 2005, pp.137-151, 2005.
DOI : 10.1007/11564751_13
, Introduction to Algorithms, 2001.
, Theory and practice of constraint handling rules, The Journal of Logic Programming, vol.37, issue.1-3, pp.95-138, 1998.
DOI : 10.1016/S0743-1066(98)10005-5
, Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis, ICLP 2005, pp.113-127, 2005.
DOI : 10.1007/11562931_11
, A new approach to the maximum-flow problem, Journal of the ACM, vol.35, issue.4, pp.921-940, 1988.
DOI : 10.1145/48014.61051
, Fine-grained parallel implementation of the preflow-push algorithm in CHR, INFSYS Research Report, pp.1843-1849, 2006.
, A filtering algorithm for constraints of difference in CSPs, AAAI 1994, pp.362-367, 1994.
, Concurrent constraint programming, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, 1993.
DOI : 10.1145/96709.96733
, Denotational Semantics: A Methodology for Language Development, 1986.
, Optimal union-find in Constraint Handling Rules, Theory and Practice of Logic Programming, vol.6, issue.1-2, pp.213-224, 2006.
DOI : 10.1017/S1471068405002541
, The alldifferent constraint: A survey, ERCIM Working Group on Constraints, 6th Annual Workshop, 2001.
, Mixed-initiative planning and scheduling for the mars exploration rover mission, IEEE Intelligent Systems, vol.19, issue.1, pp.8-12, 2004.
, Task scheduling for a temporal workflow management system, Proc. of TIME'06, pp.61-68, 2006.
, Fuzzy fundamentals, IEEE Spectrum, vol.29, issue.10, pp.58-61, 1992.
DOI : 10.1109/6.158640
, Temporal constraint networks, Artificial Intelligence, vol.49, issue.1-3, pp.61-95, 1991.
DOI : 10.1016/0004-3702(91)90006-6
, What are fuzzy rules and how to use them. Fuzzy Sets and Systems, pp.169-185, 1996.
, Temporal constraint reasoning with preferences, IJCAI01, pp.322-327, 2001.
, Fuzzy logic in control systems: fuzzy logic controller. I, IEEE Transactions on Systems, Man, and Cybernetics, vol.20, issue.2, pp.404-435, 1990.
DOI : 10.1109/21.52551
, Low-cost addition of preferences to dtps and tcsps, Proc. of AAAI'-04, pp.723-728, 2004.
, Autominder: an intelligent cognitive orthotic system for people with memory impairment, Robotics and Autonomous Systems, vol.44, issue.3-4, pp.3-4273, 2003.
DOI : 10.1016/S0921-8890(03)00077-0
, Uncertainty in soft temporal constraint problems: a general framework and controllability algorithms for the fuzzy case, Journal of AI Research, vol.27, pp.617-674, 2006.
, Backtracking algorithms for disjunctions of temporal constraints, Artificial Intelligence, vol.120, issue.1, pp.81-117, 2000.
DOI : 10.1016/S0004-3702(00)00019-9
, Constraint-Based Temporal Reasoning Algorithms with Applications to Planning, 2001.
, Ctp: A new constraint-based formalism for conditional, temporal planning, Constraints, vol.8, issue.4, pp.365-388, 2003.
DOI : 10.1023/A:1025894003623
, Handling contingency in temporal constraint networks: from consistency to controllabilities, Journal of Experimental & Theoretical Artificial Intelligence, vol.6, issue.1, pp.23-45, 0201.
DOI : 10.1016/0933-3657(91)90004-U
, Practical Bilevel Optimization: Algorithms and Applications, 1998.
DOI : 10.1007/978-1-4757-2836-1
, Preface to topics in data envelopment analysis, Annals of Operations Research, vol.2, issue.1, pp.59-94, 1985.
DOI : 10.1007/BF01874733
, Measuring the efficiency of decision making units, European Journal of Operational Research, vol.2, issue.6, pp.429-444, 1978.
DOI : 10.1016/0377-2217(78)90138-8
, On the Use of Ordinal Data in Data Envelopment Analysis, Journal of the Operational Research Society, vol.44, issue.2, pp.133-140, 1993.
DOI : 10.1057/jors.1993.25
, Data Envelopment Analysis in the Presence of Both Quantitative and Qualitative Factors, Journal of the Operational Research Society, vol.47, issue.7, pp.945-953, 1996.
DOI : 10.1057/jors.1996.120
, An Illustrative Application of Idea (Imprecise Data Envelopment Analysis) to a Korean Mobile Telecommunication Company, Operations Research, vol.49, issue.6, pp.807-820, 2001.
DOI : 10.1287/opre.49.6.807.10022
, IDEA (Imprecise Data Envelopment Analysis) with CMDs (Column Maximum Decision Making Units), Journal of the Operational Research Society, vol.52, issue.2, pp.178-181, 2001.
DOI : 10.1057/palgrave.jors.2601070
, IDEA and AR-IDEA: Models for Dealing with Imprecise Data in DEA, Management Science, vol.45, issue.4, pp.597-607, 1999.
DOI : 10.1287/mnsc.45.4.597
, Data Envelopment Analysis: A taxonomy, A meta review and an extension (Confident-DEA) with application to predicting cross (OECD) country banking systems' efficiency, Ph.D. Dissertation, 2002.
, Content analysis of data envelopment analysis literature and its comparison with that of other OR/MS fields, Modeling, Computation and Optimization in Information Systems and Management Sciences, pp.911-932, 2004.
DOI : 10.1080/002075497194787
, Epistemology of data envelopment analysis and comparison with other fields of OR/MS for relevance to applications, Socio-Economic Planning Sciences, vol.38, issue.2-3, pp.123-140, 2004.
DOI : 10.1016/S0038-0121(03)00021-1
, Note???A Note on Including Ordinal Relations Among Multipliers in Data Envelopment Analysis, Management Science, vol.34, issue.8, pp.1029-1033, 1988.
DOI : 10.1287/mnsc.34.8.1029
, Genetic algorithms in search, optimization and machine learning, 1989.
, New Branch-and-Bound Rules for Linear Bilevel Programming, SIAM Journal on Scientific and Statistical Computing, vol.13, issue.5, pp.1194-1217, 1992.
DOI : 10.1137/0913069
, Adaptation in Natural and Artificial Systems, 1992.
, The polynomial hierarchy and a simple model for competitive analysis, Mathematical Programming, pp.146-164, 1985.
DOI : 10.1007/BF01586088
, An application of data envelopment analysis in telephone officesevaluation with partial data, Computers & Operations Research, vol.26, issue.1, pp.59-72, 1999.
DOI : 10.1016/S0305-0548(98)00041-0
, Identification of inefficiencies in an additive model based IDEA (imprecise data envelopment analysis), Computers & Operations Research, vol.29, issue.12, pp.1661-76, 2002.
DOI : 10.1016/S0305-0548(01)00049-1
, Genetic algorithms: concepts and designs, 1999.
DOI : 10.1007/978-1-4471-0577-0
, Performance benchmarking using interactive data envelopment analysis, European Journal of Operational Research, vol.115, issue.3, pp.472-487, 1999.
DOI : 10.1016/S0377-2217(98)00022-8