Miquel Bofill Arasa

Miquel Bofill Arasa

Universidad de Gerona

H-index: 16

Europe-Spain

About Miquel Bofill Arasa

Miquel Bofill Arasa, With an exceptional h-index of 16 and a recent h-index of 11 (since 2020), a distinguished researcher at Universidad de Gerona, specializes in the field of Automated Reasoning, Formal Methods, Automated Planning.

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

On Grid Graph Reachability and Puzzle Games

A good snowman is hard to plan

Constraint solving approaches to the business-to-business meeting scheduling problem

SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints

The impact of implied constraints on maxsat B2B instances

The sample analysis machine scheduling problem: definition and comparison of exact solving approaches

Relaxing non-interference requirements in parallel plans

SMT encodings for resource-constrained project scheduling problems

Miquel Bofill Arasa Information

University

Position

___

Citations(all)

842

Citations(since 2020)

379

Cited By

630

hIndex(all)

16

hIndex(since 2020)

11

i10Index(all)

31

i10Index(since 2020)

14

Email

University Profile Page

Universidad de Gerona

Google Scholar

View Google Scholar Profile

Miquel Bofill Arasa Skills & Research Interests

Automated Reasoning

Formal Methods

Automated Planning

Top articles of Miquel Bofill Arasa

Title

Journal

Author(s)

Publication Date

On Grid Graph Reachability and Puzzle Games

arXiv preprint arXiv:2310.01378

Miquel Bofill

Cristina Borralleras

Joan Espasa

Mateu Villaret

2023/10/2

A good snowman is hard to plan

arXiv preprint arXiv:2310.01471

Miquel Bofill

Cristina Borralleras

Joan Espasa

Gerard Martín

Gustavo Patow

...

2023/10/2

Constraint solving approaches to the business-to-business meeting scheduling problem

Journal of Artificial Intelligence Research

Miquel Bofill

Jordi Coll

Marc Garcia

Jesús Giráldez-Cru

Gilles Pesant

...

2022/5/26

SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints

© Artificial Intelligence, 2022, vol. 302, art. núm. 103604

Miquel Bofill Arasa

Jordi Coll Caballero

Peter Nightingale

Josep Suy Franch

Felix Ulrich-Oltean

...

2022

The impact of implied constraints on maxsat B2B instances

International Journal of Computational Intelligence Systems

Miquel Bofill

Jordi Coll

Jesús Giráldez-Cru

Josep Suy

Mateu Villaret

2022/8/11

The sample analysis machine scheduling problem: definition and comparison of exact solving approaches

Computers & Operations Research

Miquel Bofill

Jordi Coll

Gerard Martín

Josep Suy

Mateu Villaret

2022/6/1

Relaxing non-interference requirements in parallel plans

Logic Journal of the IGPL

Miquel Bofill

Joan Espasa

Mateu Villaret

2021/2

SMT encodings for resource-constrained project scheduling problems

Computers & Industrial Engineering

Miquel Bofill

Jordi Coll

Josep Suy

Mateu Villaret

2020/11/1

An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations

Artificial Intelligence Review

Miquel Bofill

Jordi Coll

Josep Suy

Mateu Villaret

2020/10

See List of Professors in Miquel Bofill Arasa University(Universidad de Gerona)

Co-Authors

H-index: 35
Robert Nieuwenhuis

Robert Nieuwenhuis

Universidad Politécnica de Cataluña

H-index: 27
Albert Oliveras

Albert Oliveras

Universidad Politécnica de Cataluña

H-index: 19
Mateu Villaret Auselle

Mateu Villaret Auselle

Universidad de Gerona

H-index: 13
Jesús Giráldez-Cru

Jesús Giráldez-Cru

Universidad de Granada

H-index: 7
Joan Espasa Arxer

Joan Espasa Arxer

University of St Andrews

academic-engine