Mateu Villaret

Int. J. Comput. Intell. Syst., 2022

The Impact of Implied Constraints on MaxSAT B2B Instances.

[BibT_eX]

[DOI]

Int. J. Comput. Intell. Syst., 2022

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2022

The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

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

[BibT_eX]

[DOI]

Artif. Intell., 2022

Plotting: A Planning Problem with Complex Transitions.

[BibT_eX]

[DOI]

Ian Miguel

Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

2021

Relaxing non-interference requirements in parallel plans.

[BibT_eX]

[DOI]

Log. J. IGPL, 2021

A Preliminary Case Study of Planning With Complex Transitions: Plotting.

[BibT_eX]

[DOI]

CoRR, 2021

Exploring Lifted Planning Encodings in Essence Prime.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2021

2020

SMT encodings for Resource-Constrained Project Scheduling Problems.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2020

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

[BibT_eX]

[DOI]

Artif. Intell. Rev., 2020

2019

New complexity results for Łukasiewicz logic.

[BibT_eX]

[DOI]

Soft Comput., 2019

SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

A Study on Implied Constraints in a MaxSAT Approach to B2B Problems.

[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

Relaxed Exists-Step Plans in Planning as SMT.

[BibT_eX]

[DOI]

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

Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

The Spanish Kidney Exchange Model: Study of Computation-Based Alternatives to the Current Procedure.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence in Medicine, 2017

2016

The RANTANPLAN planner: system description.

[BibT_eX]

[DOI]

Knowl. Eng. Rev., 2016

Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2016

Nominal Unification of Higher Order Expressions with Recursive Let.

[BibT_eX]

[DOI]

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

Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

A Semantic Notion of Interference for Planning Modulo Theories.

[BibT_eX]

[DOI]

Jesús Manuel Almendros-Jiménez

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2015

SAT and SMT Technology for Many-Valued Logics.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2015

Fuzzy XPath for the Automatic Search of Fuzzy Formulae Models.

[BibT_eX]

[DOI]

Alejandro Luna Tedesqui

Ginés Moreno

Carlos Vázquez

Proceedings of the Scalable Uncertainty Management - 9th International Conference, 2015

The Complexity of 3-Valued Łukasiewicz Rules.

[BibT_eX]

[DOI]

Proceedings of the Modeling Decisions for Artificial Intelligence, 2015

Finding Hard Instances of Satisfiability in Lukasiewicz Logics.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Symposium on Multiple-Valued Logic, 2015

MaxSAT-Based Scheduling of B2B Meetings.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014

Nominal Anti-Unification.

[BibT_eX]

[DOI]

Proceedings of the 28th International Workshop on Unification, 2014

Solving Intensional Weighted CSPs by Incremental Optimization with BDDs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

Scheduling B2B Meetings.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

Reformulation Based MaxSAT Robustness - (Extended Abstract).

[BibT_eX]

[DOI]

Dídac Busquets

Proceedings of the Principles and Practice of Constraint Programming, 2014

A System for Generation and Visualization of Resource-Constrained Projects.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2014

2013

Reformulation based MaxSAT robustness.

[BibT_eX]

[DOI]

Constraints An Int. J., 2013

Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories.

[BibT_eX]

[DOI]

Constraints An Int. J., 2013

A Variant of Higher-Order Anti-Unification.

[BibT_eX]

[DOI]

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

2012

Solving constraint satisfaction problems with SAT modulo theories.

[BibT_eX]

[DOI]

Constraints An Int. J., 2012

Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE International Symposium on Multiple-Valued Logic, 2012

2011

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

[BibT_eX]

[DOI]

Log. J. IGPL, 2011

Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, 2011

Anti-Unification for Unranked Terms and Hedges.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Symposium on Multiple-Valued Logic, 2011

2010

On the relation between Context and Sequence Unification.

[BibT_eX]

[DOI]

J. Symb. Comput., 2010

A System for Solving Constraint Satisfaction Problems with SMT.

[BibT_eX]

[DOI]

Josep Suy

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

An Efficient Nominal Unification Algorithm.

[BibT_eX]

[DOI]

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

A declarative approach to robust weighted Max-SAT.

[BibT_eX]

[DOI]

Dídac Busquets

Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2010

2009

Experimental analysis of optimization techniques on the road passenger transportation problem.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2009

Simplifying the signature in second-order unification.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2009

Auction Robustness through Satisability Modulo Theories.

[BibT_eX]

[DOI]

Dídac Busquets

Proceedings of the Second Workshop on Agreement Technologies, 2009

2008

The Complexity of Monadic Second-Order Unification.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

TILC: The Interactive Lambda-Calculus Tracer.

[BibT_eX]

[DOI]

David Ruiz

Proceedings of the Eighth Spanish Conference on Programming and Computer Languages, 2008

Nominal Unification from a Higher-Order Perspective.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2007

Sequence Unification Through Currying.

[BibT_eX]

[DOI]

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

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

Describing Lambda Terms in Context Unification.

[BibT_eX]

[DOI]

Joachim Niehren

Proceedings of the Logical Aspects of Computational Linguistics, 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

2002

Currying Second-Order Unification Problems.

[BibT_eX]

[DOI]

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

Parallelism and Tree Regular Constraints.

[BibT_eX]

[DOI]

Joachim Niehren

Proceedings of the Logic for Programming, 2002

2001

Context Unification and Traversal Equations.

[BibT_eX]

[DOI]

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

2000

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

[BibT_eX]

[DOI]