Javier Larrosa

About Javier Larrosa

Javier Larrosa, With an exceptional h-index of 29 and a recent h-index of 12 (since 2020), a distinguished researcher at Universidad Politécnica de Cataluña, specializes in the field of Artificial Intelligence, Constraint Programming, combinatorial optimization.

His recent articles reflect a diverse array of research interests and contributions to the field:

Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving

On Learning When to Decompose Graphical Models

Check for updates On Learning When to Decompose Graphical Models

Proof complexity for the maximum satisfiability problem and its use in SAT refutations

Choosing the Root of the Tree Decomposition When Solving WCSPs: Preliminary Results

Augmenting the power of (partial) MaxSAT resolution with extension

Towards a better understanding of (partial weighted) MaxSAT proof systems

Javier Larrosa Information

University

Position

Professor of Computer Science

Citations(all)

3542

Citations(since 2020)

429

Cited By

3241

hIndex(all)

29

hIndex(since 2020)

12

i10Index(all)

59

i10Index(since 2020)

15

Email

University Profile Page

Universidad Politécnica de Cataluña

Google Scholar

View Google Scholar Profile

Javier Larrosa Skills & Research Interests

Artificial Intelligence

Constraint Programming

combinatorial optimization

Top articles of Javier Larrosa

Title

Journal

Author(s)

Publication Date

Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving

Proceedings of the AAAI Conference on Artificial Intelligence

Javier Larrosa

Conrado Martínez

Emma Rollon

2024/3/24

On Learning When to Decompose Graphical Models

Aleksandra Petrova

Javier Larrosa

2023/6/4

Check for updates On Learning When to Decompose Graphical Models

Learning and Intelligent Optimization: 17th International Conference, LION 17, Nice, France, June 4–8, 2023, Revised Selected Papers

Aleksandra Petrova iD

Javier Larrosa

2023/10/24

Proof complexity for the maximum satisfiability problem and its use in SAT refutations

Journal of Logic and Computation

Emma Rollon

Javier Larrosa

2022/10

Choosing the Root of the Tree Decomposition When Solving WCSPs: Preliminary Results

Artificial Intelligence Research and Development: Proceedings of the 23rd International Conference of the Catalan Association for Artificial Intelligence

M Villaret

2021/10/14

Augmenting the power of (partial) MaxSAT resolution with extension

Proceedings of the AAAI Conference on Artificial Intelligence

Javier Larrosa

Emma Rollon

2020/4/3

Towards a better understanding of (partial weighted) MaxSAT proof systems

Javier Larrosa

Emma Rollon

2020

See List of Professors in Javier Larrosa University(Universidad Politécnica de Cataluña)