BibSLEIGH — Jordi

Travelled to:

1 × Canada
1 × Denmark
1 × Estonia
1 × France
1 × Germany
1 × Italy
1 × Japan
1 × Poland
1 × Portugal
1 × Serbia
2 × Austria
2 × The Netherlands
3 × United Kingdom
5 × USA

Collaborated with:

M.Villaret C.Ansótegui T.Kutsia M.L.Bonet M.Schmidt-Schauß ∅ J.Giráldez-Cru F.Manyà A.Baumgartner J.Agustí-Cullell J.Niehren L.Simon

Talks about:

unif (16) order (9) second (6) sat (5) context (4) complet (4) nomin (3) anti (3) communiti (2) structur (2)

Person: Jordi Levy

DBLP: Levy:Jordi

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2002

2001

2000

1998

1996

1993

Wrote 22 papers:

RTA-2015-BaumgartnerKLV #anti: Nominal Anti-Unification (AB, TK, JL, MV), pp. 57–73.
SAT-2015-AnsoteguiGLS #community #detection #using: Using Community Structure to Detect Relevant Learnt Clauses (CA, JGC, JL, LS), pp. 238–254.
IJCAR-2014-AnsoteguiBGL #satisfiability: The Fractal Dimension of SAT Formulas (CA, MLB, JGC, JL), pp. 107–121.
RTA-2013-BaumgartnerKLV #anti #higher-order: A Variant of Higher-Order Anti-Unification (AB, TK, JL, MV), pp. 113–127.
SAT-2012-AnsoteguiGL #community #satisfiability: The Community Structure of SAT Formulas (CA, JGC, JL), pp. 410–423.
RTA-2011-KutsiaLV: Anti-Unification for Unranked Terms and Hedges (TK, JL, MV), pp. 219–234.
RTA-2010-LevyV #algorithm #performance #unification: An Efficient Nominal Unification Algorithm (JL, MV), pp. 209–226.
SAT-2009-AnsoteguiBL #satisfiability #testing: Solving (Weighted) Partial MaxSAT through Satisfiability Testing (CA, MLB, JL), pp. 427–440.
RTA-2008-LevyV #higher-order #perspective #unification: Nominal Unification from a Higher-Order Perspective (JL, MV), pp. 246–260.
RTA-2007-KutsiaLV #sequence #unification: Sequence Unification Through Currying (TK, JL, MV), pp. 288–302.
SAT-2007-AnsoteguiBLM #csp #satisfiability: Mapping CSP into Many-Valued SAT (CA, MLB, JL, FM), pp. 10–15.
IJCAR-2006-LevySV #unification: Stratified Context Unification Is NP-Complete (JL, MSS, MV), pp. 82–96.
RTA-2006-LevySV #bound #higher-order #unification: Bounded Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 400–414.
SAT-2006-BonetLM #calculus #satisfiability: A Complete Calculus for Max-SAT (MLB, JL, FM), pp. 240–251.
CADE-2005-LevyNV #unification: Well-Nested Context Unification (JL, JN, MV), pp. 149–163.
RTA-2004-LevySV #higher-order #monad #unification: Monadic Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 55–69.
RTA-2002-LevyV #higher-order #problem #unification: Currying Second-Order Unification Problems (JL, MV), pp. 326–339.
RTA-2001-LevyV #equation #traversal #unification: Context Unification and Traversal Equations (JL, MV), pp. 169–184.
RTA-2000-LevyV #constraints #higher-order #linear #unification: Linear Second-Order Unification and Context Unification with Tree-Regular Constraints (JL, MV), pp. 156–171.
RTA-1998-Levy #decidability #higher-order #problem #unification: Decidable and Undecidable Second-Order Unification Problems (JL), pp. 47–60.
RTA-1996-Levy #higher-order #linear #unification: Linear Second-Order Unification (JL), pp. 332–346.
RTA-1993-LevyA #order #term rewriting: Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations (JL, JAC), pp. 17–31.