Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJordi Levy
Person information
- affiliation: Spanish National Research Council (CSIC), Artificial Intelligence Research Institute (IIIA), Barcelona, Spain
- affiliation (former): Polytechnic University of Catalonia (UPC), Department of Languages and Computer Systems, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c55]Ilario Bonacina, Maria Luisa Bonet, Jordi Levy:
Polynomial Calculus for MaxSAT. SAT 2023: 5:1-5:17- [c54]Eduardo Calò, Jordi Levy, Albert Gatt, Kees van Deemter:
Is Shortest Always Best? The Role of Brevity in Logic-to-Text Generation. *SEM@ACL 2023: 180-192 - [i10]Eduardo Calò, Jordi Levy:
General Boolean Formula Minimization with QBF Solvers. CoRR abs/2303.06643 (2023) - 2022
- [j21]Carlos Ansótegui
, Maria Luisa Bonet, Jordi Levy:
Scale-Free Random SAT Instances. Algorithms 15(6): 219 (2022) - [j20]Dave de Jonge, Filippo Bistaffa, Jordi Levy:
Multi-objective vehicle routing with automated negotiation. Appl. Intell. 52(14): 16916-16939 (2022) - [j19]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus D. K. Kutz:
Nominal Unification and Matching of Higher Order Expressions with Recursive Let. Fundam. Informaticae 185(3): 247-283 (2022) - [c53]Carlos Ansótegui, Jordi Levy:
Yet Another (Fake) Proof of P=NP. CCIA 2022: 25-34 - [i9]Carlos Ansótegui, Jordi Levy:
Reducing SAT to Max2XOR. CoRR abs/2204.01774 (2022) - 2021
- [j18]Jesús Giráldez-Cru, Jordi Levy:
Popularity-similarity random SAT formulas. Artif. Intell. 299: 103537 (2021) - [c52]Dave de Jonge, Filippo Bistaffa, Jordi Levy:
A Heuristic Algorithm for Multi-Agent Vehicle Routing with Automated Negotiation. AAMAS 2021: 404-412 - [c51]Carlos Ansótegui, Jordi Levy:
Reducing SAT to Max2SAT. IJCAI 2021: 1367-1373 - [c50]Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. SODA 2021: 42-53 - [i8]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus D. K. Kutz:
Nominal Unification and Matching of Higher Order Expressions with Recursive Let. CoRR abs/2102.08146 (2021) - 2020
- [c49]Maria Luisa Bonet, Jordi Levy:
Equivalence Between Systems Stronger Than Resolution. SAT 2020: 166-181 - [i7]Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. CoRR abs/2004.07319 (2020)
2010 – 2019
- 2019
- [j17]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon:
Community Structure in Industrial SAT Instances. J. Artif. Intell. Res. 66: 443-472 (2019) - [c48]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
Phase Transition in Realistic Random SAT Models. CCIA 2019: 213-222 - 2018
- [c47]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Term-Graph Anti-Unification. FSCD 2018: 9:1-9:17 - 2017
- [j16]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy:
Structure features for SAT instances classification. J. Appl. Log. 23: 27-39 (2017) - [j15]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Higher-Order Pattern Anti-Unification in Linear Time. J. Autom. Reason. 58(2): 293-310 (2017) - [c46]Jesús Giráldez-Cru, Jordi Levy:
Locality in Random SAT Instances. IJCAI 2017: 638-644 - [i6]Jordi Levy:
Percolation and Phase Transition in SAT. CoRR abs/1708.06805 (2017) - 2016
- [j14]Jesús Giráldez-Cru, Jordi Levy:
Generating SAT instances with community structure. Artif. Intell. 238: 119-134 (2016) - [j13]Carlos Ansótegui, Joel Gabàs, Jordi Levy:
Exploiting subproblem optimization in SAT-based MaxSAT algorithms. J. Heuristics 22(1): 1-53 (2016) - [c45]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Unification of Higher Order Expressions with Recursive Let. LOPSTR 2016: 328-344 - [i5]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy:
Community Structure in Industrial SAT Instances. CoRR abs/1606.03329 (2016) - [i4]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Unification of Higher Order Expressions with Recursive Let. CoRR abs/1608.03771 (2016) - 2015
- [c44]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy:
On the Classification of Industrial SAT Families. CCIA 2015: 163-172 - [c43]Jesús Giráldez-Cru, Jordi Levy:
A Modularity-Based Random SAT Instances Generator. IJCAI 2015: 1952-1958 - [c42]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Anti-Unification. RTA 2015: 57-73 - [c41]Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon:
Using Community Structure to Detect Relevant Learnt Clauses. SAT 2015: 238-254 - 2014
- [j12]Temur Kutsia, Jordi Levy, Mateu Villaret:
Anti-unification for Unranked Terms and Hedges. J. Autom. Reason. 52(2): 155-190 (2014) - [c40]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy:
The Fractal Dimension of SAT Formulas. IJCAR 2014: 107-121 - [c39]Jordi Levy:
On the Limits of Second-Order Unification. UNIF 2014: 5-14 - [c38]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Anti-Unification. UNIF 2014: 62-68 - 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) - [c37]Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy:
Improving WPM2 for (Weighted) Partial MaxSAT. CP 2013: 117-132 - [c36]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
A Variant of Higher-Order Anti-Unification. RTA 2013: 113-127 - [i3]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy:
The Fractal Dimension of SAT Formulas. CoRR abs/1308.5046 (2013) - 2012
- [j9]Jordi Levy, Mateu Villaret:
Nominal Unification from a Higher-Order Perspective. ACM Trans. Comput. Log. 13(2): 10:1-10:31 (2012) - [c35]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Chu Min Li:
Analysis and Generation of Pseudo-Industrial MaxSAT Instances. CCIA 2012: 173-184 - [c34]Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy:
Improving SAT-Based Weighted MaxSAT Solvers. CP 2012: 86-101 - [c33]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. Log. J. IGPL 19(6): 763-789 (2011) - [c32]Carlos Ansótegui, Jordi Levy:
On the Modularity of Industrial SAT Instances. CCIA 2011: 11-20 - [c31]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) - [c30]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
A New Algorithm for Weighted Partial MaxSAT. AAAI 2010: 3-8 - [c29]Jordi Levy, Mateu Villaret:
An Efficient Nominal Unification Algorithm. RTA 2010: 209-226 - [c28]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
On Solving MaxSAT Through SAT. POS@SAT 2010: 41-48 - [i2]Jordi Levy, Mateu Villaret:
Nominal Unification from a Higher-Order Perspective. CoRR abs/1005.3731 (2010)
2000 – 2009
- 2009
- [j6]Jordi Levy, Mateu Villaret:
Simplifying the signature in second-order unification. Appl. Algebra Eng. Commun. Comput. 20(5-6): 427-445 (2009) - [c27]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
On Solving MaxSAT Through SAT. CCIA 2009: 284-292 - [c26]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
On the Structure of Industrial SAT Instances. CP 2009: 127-141 - [c25]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
Towards Industrial-Like Random SAT Instances. IJCAI 2009: 387-392 - [c24]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) - [c23]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Measuring the Hardness of SAT Instances. AAAI 2008: 222-228 - [c22]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
Random SAT Instances à la Carte. CCIA 2008: 109-117 - [c21]Jordi Levy, Mateu Villaret:
Nominal Unification from a Higher-Order Perspective. RTA 2008: 246-260 - 2007
- [j4]Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Resolution for Max-SAT. Artif. Intell. 171(8-9): 606-618 (2007) - [c20]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172 - [c19]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
What Is a Real-World SAT Instance? CCIA 2007: 19-28 - [c18]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
The Logic Behind Weighted CSP. IJCAI 2007: 32-37 - [c17]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22 - [c16]Temur Kutsia, Jordi Levy, Mateu Villaret:
Sequence Unification Through Currying. RTA 2007: 288-302 - [c15]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Mapping CSP into Many-Valued SAT. SAT 2007: 10-15 - 2006
- [c14]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Stratified Context Unification Is NP-Complete. IJCAR 2006: 82-96 - [c13]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Bounded Second-Order Unification Is NP-Complete. RTA 2006: 400-414 - [c12]Maria Luisa Bonet, Jordi Levy, Felip Manyà:
A Complete Calculus for Max-SAT. SAT 2006: 240-251 - 2005
- [c11]Jordi Levy, Joachim Niehren, Mateu Villaret:
Well-Nested Context Unification. CADE 2005: 149-163 - 2004
- [c10]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. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c9]Jordi Levy, Mateu Villaret:
Currying Second-Order Unification Problems. RTA 2002: 326-339 - 2001
- [c8]Jordi Levy, Mateu Villaret:
Context Unification and Traversal Equations. RTA 2001: 169-184 - 2000
- [j3]Jordi Levy, Margus Veanes:
On the Undecidability of Second-Order Unification. Inf. Comput. 159(1-2): 125-150 (2000) - [c7]Jordi Levy, Mateu Villaret:
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. RTA 2000: 156-171
1990 – 1999
- 1998
- [c6]Jordi Levy:
Decidable and Undecidable Second-Order Unification Problems. RTA 1998: 47-60 - 1996
- [j2]Jordi Levy, Jaume Agustí-Cullell:
Bi-Rewrite Systems. J. Symb. Comput. 22(3): 279-314 (1996) - [c5]Jordi Levy:
Linear Second-Order Unification. RTA 1996: 332-346 - 1995
- [c4]Jordi Levy:
A Decidable Second-Order Unification Problem. UNIF 1995: 33 - 1994
- [j1]David Stuart Robertson, Jaume Agustí-Cullell, Jane Hesketh, Jordi Levy:
Expressing Program Requirements Using Refinement Lattices. Fundam. Informaticae 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-22 21:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
