Jordi Levy; Mateu Villaret (2010). An Efficient Nominal Unification Algorithm. Proc. of the 21st International Conference on Rewriting Techniques and Applications, RTA'10. [PDF] [slides]
Kutsia, Temur; Jordi Levy; Mateu Villaret (2010). On the relation between Context and Sequence Unification. Journal of Symbolic Computation Vol. 45, pp. 74-95. [PDF]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy. On the Structure of Industrial SAT Instances. Proc. of the 15th Int. Conf. on Principles and Practice of Constraint Programming, CP'09. Lecture Notes in Computer Science, Vol. 5732, pp. 127-141. Springer. [PDF] [slides]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy. Towards Industrial-Like Random SAT Instances. Proc. of the 21st Int. Joint Conf. on Artificial Intelligence, IJCAI'09, AAAI Press, Pasadena, California, pp. 387-392. [PDF] [slides]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy. Solving (Weighted) Partial MaxSAT Through Satisfiability Testing. Proc. of the 20th Int. Conf. on Theory and Applications of Satisfiability Testing, SAT'09. Lecture Notes in Computer Science, Vol. 5584, pp. 427-440. Springer. [PDF] [slides]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy. On Solving MaxSAT Throught SAT Proc. of the 12th Int. Conf. of the ACIA, CCIA'09. IOS Press. [PDF]
Jordi Levy; Mateu Villaret (2009). Simplifying the Signature in Second-Order Unification. Applicable Algebra in Engineering, Communication and Computing, Vol 20, N. 5, pp. 427-445. [PDF]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy; Felip Manyà (2008). Measuring the Hardness of SAT Instances. Proc. of the 23th AAAI Conference on Artificial Intelligence, AAAI-08. Dieter Fox and Carla Gomes eds., AAAI Press. [PDF]
Jordi Levy; Mateu Villaret (2008). Nominal Unification from a Higher-Order Perspective. Proc. of the 19th International Conference on Rewriting Techniques and Applications, RTA'08. Lecture Notes in Computer Science, Vol. 5117, pp. 246-260. Springer. [PDF]
Jordi Levy; Manfred Schmidt-Schauss; Mateu Villaret (2008). The Complexity of Monadic Second-Order Unification. SIAM Journal on Computing, Vol. 38 N. 3 pp. 1113-1140. [PDF]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy; Felip Manyà (2007). The Logic behind Weighted CSP. Proc. of the 20th International Joint Conference on Artificial Intelligence, IJCAI'07. pp. 32-37. AAAI Press. [PDF]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy; Felip Manyà (2007). A Complete Resolution Calculus for Signed Max-SAT. Proc. of the 37th International Symposium on Multiple-Valued Logic, ISMVL'07. pp. 22. [PDF]
María Luisa Bonet; Jordi Levy; Felip Manyà (2007). Resolution for Max-SAT. Artificial Intelligence, Vol. 171, N. 8-9, pp. 606-618. [PDF]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy; Felip Manyà (2007). Mapping CSP into Many-Valued SAT. Proc. of the 10th International Conference on Theory and Applications of Satisfiability Testing, SAT'07. Lecture Notes in Computer Science, Vol. 4501, pp. 10-15. Springer. [PDF]
Kutsia, Temur; Jordi Levy; Mateu Villaret (2007). Sequence Unification Through Currying. Proc. of the 18th International Conference on Rewriting Techniques and Applications, RTA'07. Lecture Notes in Computer Science, Vol. 4533, pp. 288-302. Springer. [PDF]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy; Felip Manyà (2007). The Logic Behind Weighted CSP. Future and Trends in Constraint Programming. Frederic Benhamou, Narendra Jussien and Barry O'Sullivan eds., pp. 307-320. ISTE. [PDF]
Carlos Ansótegui; María Luisa Bonet; Jordi Levy; Felip Manyà (2007). Inference Rules for High-Order Consistency in Weighted CSP. Proc. of the 22th AAAI Conference on Artificial Intelligence. pp. 167-172. AAAI Press. [PDF]
María Luisa Bonet; Jordi Levy; Felip Manyà (2006). A Complete Calculus for Max-SAT. Proc. of the 9th International Conference on Theory and Applications of Satisfiability Testing, SAT'06. Lecture Notes in Computer Science, Vol. 4121, pp. 240-251. Springer-Verlag. [PDF]
Jordi Levy; Manfred Schmidt-Schauss; Mateu Villaret (2006). Bounded Second-Order Unification Is NP-Complete. Proc. of the 17th International Conference on Rewriting Techniques and Applications, RTA'06. Lecture Notes in Computer Science, Vol. 4098, pp. 400-414. Springer-Verlag. [PDF]
Jordi Levy; Manfred Schmidt-Schauss; Mateu Villaret (2006). Stratified Context Unification is NP-complete. Proc. of the 3rd International Joint Conference on Automated Reasoning, IJCAR'06. Lecture Notes in Computer Science, Vol. 4130, pp. 82-96. Springer-Verlag. [PDF]
Jordi Levy; Joachim Niehren (2005). Well-Nested Context Unification. Proc. of the 20th International Conference on Automated Deduction, CADE-20. Lecture Notes in Artificial Intelligence, Vol. 3632, pp. 149-163. Springer-Verlag. [PDF]
Jordi Levy; Manfred Schmidt-Schauss; Mateu Villaret (2004). Monadic Second-Order Unifications is NP Complete. Proc. of the 15th International Conference on Rewriting Techniques and Applications, RTA'04. Lecture Notes in Computer Science, Vol. 3091, pp. 55-69. Springer-Verlag. [PDF]
Atserias, Albert; María Luisa Bonet; Jordi Levy (2003). On chvátal rank and cutting planes proofs. Electronic Colloquium on Computational Complexity, Vol. 41, N. Report TR03-041, pp. 12. [PDF]
Jordi Levy; Mateu Villaret (2002). Currying Second-Order Unification Problems. Proc. of the 13th International Conference on Rewriting Techniques and Applications, RTA'02. Lecture Notes in Computer Science, Vol. 2378, pp. 326-339. Springer-Verlag. [PDF]
Jordi Levy; Mateu Villaret (2001). Context unification and Traversal Equations. Proc. of the 12th International Conference on Rewriting Techniques and Applications, RTA'01. Lecture Notes in Computer Science, Vol. 2051, pp. 169-184. Springer-Verlag. [PDF]
Jordi Levy; Mateu Villaret (2000). Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. Proc. of the 11th Int. Conf. on Rewriting Techniques and Applications, RTA'00. Lecture Notes in Computer Science, Vol. 1833, pp. 156-171. Springer-Verlag. [PDF]
Jordi Levy; Margus Veanes (2000). On the Undecidability of Second-Order Unification. Information and Computation, Vol. 159, N. 1-2, pp. 125-150. [PDF]
Jordi Levy; Margus Veanes (1998). On Unification Problems in Restricted Second-Order Languages. Annual Conference of the European Association for Computer Science Logic, CSL'98. [PDF]
Jordi Levy (1998). Decidable and Undecidable Second-Order Unification Problems. Proc. of the 9th International Conference on Rewriting Techniques and Applications, RTA'98. Lecture Notes in Computer Science, Vol. 1379, pp. 47-60. Springer-Verlag. [PDF]
Jordi Levy; Jaume Agustí-Cullell (1996). Bi-rewrite Systems. Journal of Symbolic Computation, Vol. 22, N. 3, pp. 279-314. [PDF]
Jordi Levy (1996). Linear Second Order Unification. Proc. of the 7th International Conference on Rewriting Techniques and Applications, RTA'96. Lecture Notes in Computer Science, Vol. 1103, pp. 332-346. Springer-Verlag. [PDF]
David Robertson; Jaume Agustí-Cullell; Jane Hesketh; Jordi Levy (1994). Expressing Program Requirements using Refinement Lattices. Fundamenta Informaticae, Vol. 21, N. 3, pp. 163-182. [PDF]
Jordi Levy (1994). The Calculus of Refinements, a Formal Specification Model Based on Inclusions. [PDF]
David Robertson; Jaume Agustí-Cullell; Jane Hesketh; Jordi Levy (1993). Expressing Program Requirements using Refinement Lattices. Proc. of the 7th Int. Symp. on Metodologies for Intelligent Systems, ISMIS'93. Lecture Notes in Artificial Intelligence, Vol. 689, pp. 245-254. Springer-Verlag. [PDF]
Jordi Levy; Jaume Agustí-Cullell (1993). Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations. Proc. of the 5th Int. Conf. on Rewriting Techniques and Applications, RTA'93. Lecture Notes in Computer Science, Vol. 690, pp. 17-31. Springer-Verlag. [PDF]
Jordi Levy; Jaume Agustí-Cullell (1992). Implementing Inequality and Nondeterministic Specifications with Bi-rewriting Systems. Proc. of the 4th Int. Workshop on Recent Trends in Data Type Specification, COMPASS'92. Lecture Notes in Computer Science, Vol. 785, pp. 252-267. Springer-Verlag. [PDF]