Josep Suy

Orcid: 0000-0002-9318-1124

According to our database1, Josep Suy authored at least 24 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem.
J. Artif. Intell. Res., 2022

The Impact of Implied Constraints on MaxSAT B2B Instances.
Int. J. Comput. Intell. Syst., 2022

The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches.
Comput. Oper. Res., 2022

SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints.
Artif. Intell., 2022

2020
SMT encodings for Resource-Constrained Project Scheduling Problems.
Comput. Ind. Eng., 2020

An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations.
Artif. Intell. Rev., 2020

2019
SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2019

A Study on Implied Constraints in a MaxSAT Approach to B2B Problems.
Proceedings of the Artificial Intelligence Research and Development, 2019

2017
Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

An Efficient SMT Approach to Solve MRCPSP/max Instances with Tight Constraints on Resources.
Proceedings of the Principles and Practice of Constraint Programming, 2017

2016
Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

2015
MaxSAT-Based Scheduling of B2B Meetings.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014
Solving Intensional Weighted CSPs by Incremental Optimization with BDDs.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Scheduling B2B Meetings.
Proceedings of the Principles and Practice of Constraint Programming, 2014

A System for Generation and Visualization of Resource-Constrained Projects.
Proceedings of the Artificial Intelligence Research and Development, 2014

2013
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories.
Constraints An Int. J., 2013

2012
A satisfiability modulo theories approach to constraint programming.
PhD thesis, 2012

Solving constraint satisfaction problems with SAT modulo theories.
Constraints An Int. J., 2012

2011
Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem.
Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, 2011

2010
A System for Solving Constraint Satisfaction Problems with SMT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

1996
An object-oriented approach for teaching visibility computation algorithms.
Comput. Graph., 1996


  Loading...