- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j11 |      | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: SAT-based MaxSAT algorithms. Artif. Intell. 196: 77-105 (2013) |
| j10 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Resolution procedures for multiple-valued optimization. Inf. Sci. 227: 43-59 (2013) |
| 2012 | ||
| j9 | | Jordi Levy, Mateu Villaret: Nominal Unification from a Higher-Order Perspective. ACM Trans. Comput. Log. 13(2): 10 (2012) |
| c33 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Chu Min Li: Analysis and Generation of Pseudo-Industrial MaxSAT Instances. CCIA 2012: 173-184 |
| c32 | | Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy: Improving SAT-Based Weighted MaxSAT Solvers. CP 2012: 86-101 |
| c31 | | Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy: The Community Structure of SAT Formulas. SAT 2012: 410-423 |
| 2011 | ||
| j8 | | Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: On the complexity of Bounded Second-Order Unification and Stratified Context Unification. Logic Journal of the IGPL 19(6): 763-789 (2011) |
| c30 | | |
| c29 | | Temur Kutsia, Jordi Levy, Mateu Villaret: Anti-Unification for Unranked Terms and Hedges. RTA 2011: 219-234 |
| 2010 | ||
| j7 | | Temur Kutsia, Jordi Levy, Mateu Villaret: On the relation between Context and Sequence Unification. J. Symb. Comput. 45(1): 74-95 (2010) |
| c28 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: A New Algorithm for Weighted Partial MaxSAT. AAAI 2010 |
| c27 | | |
| i2 | | Jordi Levy, Mateu Villaret: Nominal Unification from a Higher-Order Perspective. CoRR abs/1005.3731 (2010) |
| 2009 | ||
| j6 | | Jordi Levy, Mateu Villaret: Simplifying the signature in second-order unification. Appl. Algebra Eng. Commun. Comput. 20(5-6): 427-445 (2009) |
| c26 | | |
| c25 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: On the Structure of Industrial SAT Instances. CP 2009: 127-141 |
| c24 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: Towards Industrial-Like Random SAT Instances. IJCAI 2009: 387-392 |
| c23 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: Solving (Weighted) Partial MaxSAT through Satisfiability Testing. SAT 2009: 427-440 |
| 2008 | ||
| j5 | | Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: The Complexity of Monadic Second-Order Unification. SIAM J. Comput. 38(3): 1113-1140 (2008) |
| c22 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Measuring the Hardness of SAT Instances. AAAI 2008: 222-228 |
| c21 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy: Random SAT Instances à la Carte. CCIA 2008: 109-117 |
| c20 | | |
| 2007 | ||
| j4 | | Maria Luisa Bonet, Jordi Levy, Felip Manyà: Resolution for Max-SAT. Artif. Intell. 171(8-9): 606-618 (2007) |
| c19 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172 |
| c18 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: What Is a Real-World SAT Instance? CCIA 2007: 19-28 |
| c17 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: The Logic Behind Weighted CSP. IJCAI 2007: 32-37 |
| c16 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22 |
| c15 | | |
| c14 | | Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà: Mapping CSP into Many-Valued SAT. SAT 2007: 10-15 |
| 2006 | ||
| c13 | | Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: Stratified Context Unification Is NP-Complete. IJCAR 2006: 82-96 |
| c12 | | Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: Bounded Second-Order Unification Is NP-Complete. RTA 2006: 400-414 |
| c11 | | |
| 2005 | ||
| c10 | | |
| 2004 | ||
| c9 | | Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: Monadic Second-Order Unification Is NP-Complete. RTA 2004: 55-69 |
| 2003 | ||
| i1 | | Albert Atserias, Maria Luisa Bonet, Jordi Levy: On Chvatal Rank and Cutting Planes Proofs. Electronic Colloquium on Computational Complexity (ECCC)(041) (2003) |
| 2002 | ||
| c8 | | |
| 2001 | ||
| c7 | | |
| 2000 | ||
| j3 | | Jordi Levy, Margus Veanes: On the Undecidability of Second-Order Unification. Inf. Comput. 159(1-2): 125-150 (2000) |
| c6 | | Jordi Levy, Mateu Villaret: Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. RTA 2000: 156-171 |
| 1998 | ||
| c5 | | |
| 1996 | ||
| j2 | | |
| c4 | | |
| 1994 | ||
| j1 | | David Stuart Robertson, Jaume Agustí-Cullell, Jane Hesketh, Jordi Levy: Expressing Program Requirements Using Refinement Lattices. Fundam. Inform. 21(3): 163-182 (1994) |
| 1993 | ||
| c3 | | David Stuart Robertson, Jaume Agustí-Cullell, Jane Hesketh, Jordi Levy: Expressing Program Requirements Using Refinement Lattices. ISMIS 1993: 245-254 |
| c2 | | Jordi Levy, Jaume Agustí-Cullell: Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations. RTA 1993: 17-31 |
| 1992 | ||
| c1 | | Jordi Levy, Jaume Agustí-Cullell: Implementing Inequality and Non-Deterministic Specifications with Bi-Rewriting Systems. COMPASS/ADT 1992: 252-267 |
Colors in the list of coauthors
Last update Sat May 25 17:07:00 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page