default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMateu Villaret
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j25]Irene Unceta
, Bernat Salbanya, Jordi Coll, Mateu Villaret, Jordi Nin:
Optimizing resource allocation in home care services using MaxSAT. Cogn. Syst. Res. 88: 101291 (2024)- 2023
- [c47]Marc Cané, Jordi Coll, Marc Rojo, Mateu Villaret:
SAT-IT: The Interactive SAT Tracer. CCIA 2023: 337-346 - [c46]Miquel Bofill, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret:
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract). IJCAI 2023: 6851-6852 - [c45]Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret:
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract). IJCAI 2023: 6853-6857 - [i9]Miquel Bofill, Cristina Borralleras, Joan Espasa, Mateu Villaret:
On Grid Graph Reachability and Puzzle Games. CoRR abs/2310.01378 (2023) - [i8]Joan Espasa, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret:
Challenges in Modelling and Solving Plotting with PDDL. CoRR abs/2310.01470 (2023) - [i7]Miquel Bofill, Cristina Borralleras, Joan Espasa, Gerard Martín, Gustavo Patow, Mateu Villaret:
A Good Snowman is Hard to Plan. CoRR abs/2310.01471 (2023) - [i6]Joan Espasa, Ian P. Gent, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret:
Towards a Model of Puzznic. CoRR abs/2310.01503 (2023) - 2022
- [j24]Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret:
SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints. Artif. Intell. 302: 103604 (2022) - [j23]Miquel Bofill, Jordi Coll, Gerard Martín, Josep Suy, Mateu Villaret:
The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches. Comput. Oper. Res. 142: 105730 (2022) - [j22]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus D. K. Kutz:
Nominal Unification and Matching of Higher Order Expressions with Recursive Let. Fundam. Informaticae 185(3): 247-283 (2022) - [j21]Miquel Bofill, Jordi Coll, Jesús Giráldez-Cru, Josep Suy, Mateu Villaret:
The Impact of Implied Constraints on MaxSAT B2B Instances. Int. J. Comput. Intell. Syst. 15(1): 63 (2022) - [j20]Aïda Valls, Cèsar Fernández, Mateu Villaret:
New Reasoning Models: Improving Optimisation and Decision Support with the Management of Uncertainty and Constraints. Int. J. Comput. Intell. Syst. 15(1): 107 (2022) - [j19]Miquel Bofill, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret:
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem. J. Artif. Intell. Res. 74: 263-301 (2022) - [c44]Joan Espasa, Ian Miguel, Mateu Villaret:
Plotting: A Planning Problem with Complex Transitions. CP 2022: 22:1-22:17 - 2021
- [j18]Miquel Bofill, Joan Espasa, Mateu Villaret:
Relaxing non-interference requirements in parallel plans. Log. J. IGPL 29(1): 45-71 (2021) - [c43]Joan Espasa, Jordi Coll, Ian Miguel, Mateu Villaret:
Exploring Lifted Planning Encodings in Essence Prime. CCIA 2021: 66-75 - [e2]Mateu Villaret, Teresa Alsinet, Cèsar Fernández, Aïda Valls:
Artificial Intelligence Research and Development - Proceedings of the 23rd International Conference of the Catalan Association for Artificial Intelligence, CCIA 2021, Virtual Event, 20-22 October, 2021. Frontiers in Artificial Intelligence and Applications 339, IOS Press 2021, ISBN 978-1-64368-210-5 [contents] - [i5]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus D. K. Kutz:
Nominal Unification and Matching of Higher Order Expressions with Recursive Let. CoRR abs/2102.08146 (2021) - [i4]Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret:
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints. CoRR abs/2110.08068 (2021) - [i3]Jordi Coll, Joan Espasa, Ian Miguel, Mateu Villaret:
A Preliminary Case Study of Planning With Complex Transitions: Plotting. CoRR abs/2110.14397 (2021) - 2020
- [j17]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations. Artif. Intell. Rev. 53(7): 5157-5188 (2020) - [j16]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
SMT encodings for Resource-Constrained Project Scheduling Problems. Comput. Ind. Eng. 149: 106777 (2020)
2010 – 2019
- 2019
- [j15]Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret:
New complexity results for Łukasiewicz logic. Soft Comput. 23(7): 2187-2197 (2019) - [c42]Miquel Bofill, Jesús Giráldez-Cru, Josep Suy, Mateu Villaret:
A Study on Implied Constraints in a MaxSAT Approach to B2B Problems. CCIA 2019: 183-192 - [c41]Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret:
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. CP 2019: 20-36 - [c40]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations. CPAIOR 2019: 112-128 - 2018
- [c39]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Term-Graph Anti-Unification. FSCD 2018: 9:1-9:17 - 2017
- [j14]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Higher-Order Pattern Anti-Unification in Linear Time. J. Autom. Reason. 58(2): 293-310 (2017) - [c38]Miquel Bofill, Marcos Calderón, Francesc Castro, Esteve del Acebo, Pablo Delgado, Marc Garcia, Marta García, Marc Roig, María O. Valentín, Mateu Villaret:
The Spanish Kidney Exchange Model: Study of Computation-Based Alternatives to the Current Procedure. AIME 2017: 272-277 - [c37]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
An Efficient SMT Approach to Solve MRCPSP/max Instances with Tight Constraints on Resources. CP 2017: 71-79 - [c36]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems. IJCAI 2017: 555-562 - [c35]Miquel Bofill, Joan Espasa, Mateu Villaret:
Relaxed Exists-Step Plans in Planning as SMT. IJCAI 2017: 563-570 - 2016
- [j13]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret:
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. Fuzzy Sets Syst. 292: 32-48 (2016) - [j12]Miquel Bofill, Joan Espasa, Mateu Villaret:
The RANTANPLAN planner: system description. Knowl. Eng. Rev. 31(5): 452-464 (2016) - [c34]Miquel Bofill, Joan Espasa, Mateu Villaret:
A Semantic Notion of Interference for Planning Modulo Theories. ICAPS 2016: 56-64 - [c33]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT. ICTAI 2016: 239-246 - [c32]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Unification of Higher Order Expressions with Recursive Let. LOPSTR 2016: 328-344 - [i2]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Unification of Higher Order Expressions with Recursive Let. CoRR abs/1608.03771 (2016) - 2015
- [j11]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret:
SAT and SMT Technology for Many-Valued Logics. J. Multiple Valued Log. Soft Comput. 24(1-4): 151-172 (2015) - [c31]Miquel Bofill, Marc Garcia, Josep Suy, Mateu Villaret:
MaxSAT-Based Scheduling of B2B Meetings. CPAIOR 2015: 65-73 - [c30]Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret:
Finding Hard Instances of Satisfiability in Lukasiewicz Logics. ISMVL 2015: 30-35 - [c29]Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret:
The Complexity of 3-Valued Łukasiewicz Rules. MDAI 2015: 221-229 - [c28]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Anti-Unification. RTA 2015: 57-73 - [c27]Jesús Manuel Almendros-Jiménez, Miquel Bofill, Alejandro Luna Tedesqui, Ginés Moreno, Carlos Vázquez, Mateu Villaret:
Fuzzy XPath for the Automatic Search of Fuzzy Formulae Models. SUM 2015: 385-398 - 2014
- [j10]Temur Kutsia, Jordi Levy, Mateu Villaret:
Anti-unification for Unranked Terms and Hedges. J. Autom. Reason. 52(2): 155-190 (2014) - [c26]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
A System for Generation and Visualization of Resource-Constrained Projects. CCIA 2014: 237-246 - [c25]Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving Intensional Weighted CSPs by Incremental Optimization with BDDs. CP 2014: 207-223 - [c24]Miquel Bofill, Joan Espasa, Marc Garcia, Miquel Palahí, Josep Suy, Mateu Villaret:
Scheduling B2B Meetings. CP 2014: 781-796 - [c23]Miquel Bofill, Dídac Busquets, Mateu Villaret:
Reformulation Based MaxSAT Robustness - (Extended Abstract). CP 2014: 908-912 - [c22]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Anti-Unification. UNIF 2014: 62-68 - 2013
- [j9]Miquel Bofill, Dídac Busquets, Víctor Muñoz, Mateu Villaret:
Reformulation based MaxSAT robustness. Constraints An Int. J. 18(2): 202-235 (2013) - [j8]Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories. Constraints An Int. J. 18(2): 236-268 (2013) - [c21]Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
A Variant of Higher-Order Anti-Unification. RTA 2013: 113-127 - 2012
- [j7]Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving constraint satisfaction problems with SAT modulo theories. Constraints An Int. J. 17(3): 273-303 (2012) - [j6]Jordi Levy, Mateu Villaret:
Nominal Unification from a Higher-Order Perspective. ACM Trans. Comput. Log. 13(2): 10:1-10:31 (2012) - [c20]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret:
Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. ISMVL 2012: 25-30 - [e1]Vicenç Torra, Yasuo Narukawa, Beatriz López, Mateu Villaret:
Modeling Decisions for Artificial Intelligence - 9th International Conference, MDAI 2012, Girona, Catalonia, Spain, November 21-23, 2012. Proceedings. Lecture Notes in Computer Science 7647, Springer 2012, ISBN 978-3-642-34619-4 [contents] - 2011
- [j5]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
On the complexity of Bounded Second-Order Unification and Stratified Context Unification. Log. J. IGPL 19(6): 763-789 (2011) - [c19]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret:
Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL 2011: 230-235 - [c18]Temur Kutsia, Jordi Levy, Mateu Villaret:
Anti-Unification for Unranked Terms and Hedges. RTA 2011: 219-234 - [c17]Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem. SARA 2011 - 2010
- [j4]Temur Kutsia, Jordi Levy, Mateu Villaret:
On the relation between Context and Sequence Unification. J. Symb. Comput. 45(1): 74-95 (2010) - [c16]Miquel Bofill, Dídac Busquets, Mateu Villaret:
A declarative approach to robust weighted Max-SAT. PPDP 2010: 67-76 - [c15]Jordi Levy, Mateu Villaret:
An Efficient Nominal Unification Algorithm. RTA 2010: 209-226 - [c14]Miquel Bofill, Josep Suy, Mateu Villaret:
A System for Solving Constraint Satisfaction Problems with SMT. SAT 2010: 300-305 - [i1]Jordi Levy, Mateu Villaret:
Nominal Unification from a Higher-Order Perspective. CoRR abs/1005.3731 (2010)
2000 – 2009
- 2009
- [j3]Jordi Levy, Mateu Villaret:
Simplifying the signature in second-order unification. Appl. Algebra Eng. Commun. Comput. 20(5-6): 427-445 (2009) - [j2]Beatriz López, Víctor Muñoz, Javier Murillo, Federico Barber, Miguel A. Salido, Montserrat Abril, Mariamar Cervantes, Luis F. Caro, Mateu Villaret:
Experimental analysis of optimization techniques on the road passenger transportation problem. Eng. Appl. Artif. Intell. 22(3): 374-388 (2009) - [c13]Miquel Bofill, Dídac Busquets, Mateu Villaret:
Auction Robustness through Satisability Modulo Theories. WAT 2009: 33-44 - 2008
- [j1]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
The Complexity of Monadic Second-Order Unification. SIAM J. Comput. 38(3): 1113-1140 (2008) - [c12]Jordi Levy, Mateu Villaret:
Nominal Unification from a Higher-Order Perspective. RTA 2008: 246-260 - [c11]David Ruiz, Mateu Villaret:
TILC: The Interactive Lambda-Calculus Tracer. PROLE 2008: 173-183 - 2007
- [c10]Temur Kutsia, Jordi Levy, Mateu Villaret:
Sequence Unification Through Currying. RTA 2007: 288-302 - 2006
- [c9]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Stratified Context Unification Is NP-Complete. IJCAR 2006: 82-96 - [c8]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Bounded Second-Order Unification Is NP-Complete. RTA 2006: 400-414 - 2005
- [c7]Jordi Levy, Joachim Niehren, Mateu Villaret:
Well-Nested Context Unification. CADE 2005: 149-163 - [c6]Joachim Niehren, Mateu Villaret:
Describing Lambda Terms in Context Unification. LACL 2005: 221-237 - 2004
- [c5]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Monadic Second-Order Unification Is NP-Complete. RTA 2004: 55-69 - 2002
- [c4]Joachim Niehren, Mateu Villaret:
Parallelism and Tree Regular Constraints. LPAR 2002: 311-326 - [c3]Jordi Levy, Mateu Villaret:
Currying Second-Order Unification Problems. RTA 2002: 326-339 - 2001
- [c2]Jordi Levy, Mateu Villaret:
Context Unification and Traversal Equations. RTA 2001: 169-184 - 2000
- [c1]Jordi Levy, Mateu Villaret:
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. RTA 2000: 156-171
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
