The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jordi Levy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jordi Levy, Joachim Niehren, Mateu Villaret
    Well-Nested Context Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:149-163 [Conf]
  2. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
    Stratified Context Unification Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:82-96 [Conf]
  3. Jordi Levy, Jaume Agustí-Cullell
    Implementing Inequality and Non-Deterministic Specifications with Bi-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    COMPASS/ADT, 1992, pp:252-267 [Conf]
  4. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
    The Logic Behind Weighted CSP. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:32-37 [Conf]
  5. David Stuart Robertson, Jaume Agustí-Cullell, Jane Hesketh, Jordi Levy
    Expressing Program Requirements Using Refinement Lattices. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1993, pp:245-254 [Conf]
  6. Jordi Levy
    Linear Second-Order Unification. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:332-346 [Conf]
  7. Jordi Levy
    Decidable and Undecidable Second-Order Unification Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:47-60 [Conf]
  8. Jordi Levy, Jaume Agustí-Cullell
    Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:17-31 [Conf]
  9. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
    Monadic Second-Order Unification Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:55-69 [Conf]
  10. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
    Bounded Second-Order Unification Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:400-414 [Conf]
  11. Jordi Levy, Mateu Villaret
    Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:156-171 [Conf]
  12. Jordi Levy, Mateu Villaret
    Context Unification and Traversal Equations. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:169-184 [Conf]
  13. Jordi Levy, Mateu Villaret
    Currying Second-Order Unification Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:326-339 [Conf]
  14. Maria Luisa Bonet, Jordi Levy, Felip Manyà
    A Complete Calculus for Max-SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:240-251 [Conf]
  15. Albert Atserias, Maria Luisa Bonet, Jordi Levy
    On Chvatal Rank and Cutting Planes Proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:041, pp:- [Journal]
  16. David Stuart Robertson, Jaume Agustí-Cullell, Jane Hesketh, Jordi Levy
    Expressing Program Requirements Using Refinement Lattices. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:21, n:3, pp:163-182 [Journal]
  17. Jordi Levy, Margus Veanes
    On the Undecidability of Second-Order Unification. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:159, n:1-2, pp:125-150 [Journal]
  18. Jordi Levy, Jaume Agustí-Cullell
    Bi-Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1996, v:22, n:3, pp:279-314 [Journal]
  19. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
    Inference Rules for High-Order Consistency in Weighted CSP. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:167-172 [Conf]
  20. Temur Kutsia, Jordi Levy, Mateu Villaret
    Sequence Unification Through Currying. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:288-302 [Conf]
  21. Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
    Mapping CSP into Many-Valued SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:10-15 [Conf]
  22. Maria Luisa Bonet, Jordi Levy, Felip Manyà
    Resolution for Max-SAT. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:8-9, pp:606-618 [Journal]

  23. Measuring the Hardness of SAT Instances. [Citation Graph (, )][DBLP]


  24. A New Algorithm for Weighted Partial MaxSAT. [Citation Graph (, )][DBLP]


  25. What Is a Real-World SAT Instance? [Citation Graph (, )][DBLP]


  26. Random SAT Instances à la Carte. [Citation Graph (, )][DBLP]


  27. On Solving MaxSAT Through SAT. [Citation Graph (, )][DBLP]


  28. On the Structure of Industrial SAT Instances. [Citation Graph (, )][DBLP]


  29. Towards Industrial-Like Random SAT Instances. [Citation Graph (, )][DBLP]


  30. A Complete Resolution Calculus for Signed Max-SAT. [Citation Graph (, )][DBLP]


  31. Nominal Unification from a Higher-Order Perspective. [Citation Graph (, )][DBLP]


  32. An Efficient Nominal Unification Algorithm. [Citation Graph (, )][DBLP]


  33. Solving (Weighted) Partial MaxSAT through Satisfiability Testing. [Citation Graph (, )][DBLP]


  34. Simplifying the signature in second-order unification. [Citation Graph (, )][DBLP]


  35. Nominal Unification from a Higher-Order Perspective [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002