Jordi Levy

J. Artif. Intell. Res., 2024

SAT, Gadgets, Max2XOR, and Quantum Annealers.

[BibT_eX]

[DOI]

CoRR, 2024

2023

The impact of heterogeneity and geometry on the proof complexity of random satisfiability.

[BibT_eX]

[DOI]

Random Struct. Algorithms, December, 2023

Is Shortest Always Best? The Role of Brevity in Logic-to-Text Generation.

[BibT_eX]

[DOI]

Proceedings of the The 12th Joint Conference on Lexical and Computational Semantics, 2023

Polynomial Calculus for MaxSAT.

[BibT_eX]

[DOI]

Ilario Bonacina

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

General Boolean Formula Minimization with QBF Solvers.

[BibT_eX]

[DOI]

Eduardo Calò

Proceedings of the Artificial Intelligence Research and Development, 2023

On the Density of States of Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2023

2022

Nominal Unification and Matching of Higher Order Expressions with Recursive Let.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2022

Reducing SAT to Max2XOR.

[BibT_eX]

[DOI]

CoRR, 2022

Multi-objective vehicle routing with automated negotiation.

[BibT_eX]

[DOI]

Dave de Jonge

Filippo Bistaffa

Appl. Intell., 2022

Scale-Free Random SAT Instances.

[BibT_eX]

[DOI]

Algorithms, 2022

Yet Another (Fake) Proof of P=NP.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2022

2021

Popularity-similarity random SAT formulas.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Reducing SAT to Max2SAT.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

A Heuristic Algorithm for Multi-Agent Vehicle Routing with Automated Negotiation.

[BibT_eX]

[DOI]

Dave de Jonge

Filippo Bistaffa

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Equivalence Between Systems Stronger Than Resolution.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

2019

Community Structure in Industrial SAT Instances.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Phase Transition in Realistic Random SAT Models.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2019

2018

Term-Graph Anti-Unification.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017

Higher-Order Pattern Anti-Unification in Linear Time.

[BibT_eX]

[DOI]

J. Autom. Reason., 2017

Structure features for SAT instances classification.

[BibT_eX]

[DOI]

J. Appl. Log., 2017

Percolation and Phase Transition in SAT.

[BibT_eX]

[DOI]

CoRR, 2017

Locality in Random SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

Exploiting subproblem optimization in SAT-based MaxSAT algorithms.

[BibT_eX]

[DOI]

Joel Gabàs

J. Heuristics, 2016

Community Structure in Industrial SAT Instances.

[BibT_eX]

[DOI]

CoRR, 2016

Generating SAT instances with community structure.

[BibT_eX]

[DOI]

Artif. Intell., 2016

Nominal Unification of Higher Order Expressions with Recursive Let.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2016

2015

Using Community Structure to Detect Relevant Learnt Clauses.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

A Modularity-Based Random SAT Instances Generator.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On the Classification of Industrial SAT Families.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2015

2014

Anti-unification for Unranked Terms and Hedges.

[BibT_eX]

[DOI]

J. Autom. Reason., 2014

On the Limits of Second-Order Unification.

[BibT_eX]

[DOI]

Proceedings of the 28th International Workshop on Unification, 2014

Nominal Anti-Unification.

[BibT_eX]

[DOI]

Proceedings of the 28th International Workshop on Unification, 2014

The Fractal Dimension of SAT Formulas.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013

Resolution procedures for multiple-valued optimization.

[BibT_eX]

[DOI]

Inf. Sci., 2013

SAT-based MaxSAT algorithms.

[BibT_eX]

[DOI]

Artif. Intell., 2013

A Variant of Higher-Order Anti-Unification.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Improving WPM2 for (Weighted) Partial MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

2012

Nominal Unification from a Higher-Order Perspective.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2012

The Community Structure of SAT Formulas.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Improving SAT-Based Weighted MaxSAT Solvers.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

Analysis and Generation of Pseudo-Industrial MaxSAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2012

2011

On the complexity of Bounded Second-Order Unification and Stratified Context Unification.

[BibT_eX]

[DOI]

Log. J. IGPL, 2011

On the Modularity of Industrial SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2011

2010

On the relation between Context and Sequence Unification.

[BibT_eX]

[DOI]

J. Symb. Comput., 2010

An Efficient Nominal Unification Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

A New Algorithm for Weighted Partial MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Simplifying the signature in second-order unification.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2009

Solving (Weighted) Partial MaxSAT through Satisfiability Testing.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Towards Industrial-Like Random SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

On the Structure of Industrial SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

On Solving MaxSAT Through SAT.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2009

2008

The Complexity of Monadic Second-Order Unification.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Random SAT Instances à la Carte.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2008

Measuring the Hardness of SAT Instances.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Resolution for Max-SAT.

[BibT_eX]

[DOI]

Felip Manyà

Artif. Intell., 2007

Mapping CSP into Many-Valued SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Sequence Unification Through Currying.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

A Complete Resolution Calculus for Signed Max-SAT.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

The Logic Behind Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

What Is a Real-World SAT Instance?

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2007

Inference Rules for High-Order Consistency in Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

A Complete Calculus for Max-SAT.

[BibT_eX]

[DOI]

Felip Manyà

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Bounded Second-Order Unification Is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Stratified Context Unification Is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005

Well-Nested Context Unification.

[BibT_eX]

[DOI]

Joachim Niehren

Proceedings of the Automated Deduction, 2005

2004

Monadic Second-Order Unification Is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

2003

On Chvatal Rank and Cutting Planes Proofs

[BibT_eX]

[DOI]

Albert Atserias

Electron. Colloquium Comput. Complex., 2003

2002

Currying Second-Order Unification Problems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001

Context Unification and Traversal Equations.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

2000

On the Undecidability of Second-Order Unification.

[BibT_eX]

[DOI]

Margus Veanes

Inf. Comput., 2000

Linear Second-Order Unification and Context Unification with Tree-Regular Constraints.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

1998

Decidable and Undecidable Second-Order Unification Problems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

1996

Bi-Rewrite Systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 1996

Linear Second-Order Unification.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

1995

A Decidable Second-Order Unification Problem.

[BibT_eX]

Proceedings of the 9th International Workshop on Unification, 1995

1994

Expressing Program Requirements Using Refinement Lattices.

[BibT_eX]

[DOI]

David Stuart Robertson

Jane Hesketh

Fundam. Informaticae, 1994

1993

Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

1992

Implementing Inequality and Non-Deterministic Specifications with Bi-Rewriting Systems.

[BibT_eX]

[DOI]