Miquel Bofill

From MaRDI portal
(Redirected from Miquel Bofill)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Efficient SMT formulations for classical planning
Journal of Logical and Algebraic Methods in Programming
2026-08-27Paper
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem
Journal of Artificial Intelligence Research
2022-08-02Paper
The sample analysis machine scheduling problem: definition and comparison of exact solving approaches
Computers & Operations Research
2022-06-22Paper
Relaxing non-interference requirements in parallel plans
Logic Journal of the IGPL
2021-12-22Paper
SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
Artificial Intelligence
2021-12-13Paper
Resource analysis driven by (conditional) termination proofs
Theory and Practice of Logic Programming
2020-05-04Paper
SAT encodings of pseudo-Boolean constraints with at-most-one relations2019-10-14Paper
New complexity results for Łukasiewicz logic
Soft Computing
2019-08-12Paper
SAT and SMT technology for many-valued logics2018-09-03Paper
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
Fuzzy Sets and Systems
2018-02-19Paper
The complexity of 3-valued Łukasiewicz rules
Modeling Decisions for Artificial Intelligence
2017-06-20Paper
MaxSAT-based scheduling of B2B meetings
Integration of AI and OR Techniques in Constraint Programming
2016-07-25Paper
Solving constraint satisfaction problems with SAT modulo theories
Constraints
2015-01-22Paper
Reformulation based MaxSat robustness
Constraints
2015-01-22Paper
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
Constraints
2015-01-22Paper
Paramodulation with non-monotonic orderings and simplification
Journal of Automated Reasoning
2013-07-05Paper
The recursive path and polynomial ordering for first-order and higher-order terms
Journal Of Logic And Computation
2013-04-19Paper
A system for solving constraint satisfaction problems with SMT
Theory and Applications of Satisfiability Testing – SAT 2010
2010-09-29Paper
Paramodulation with Well-founded Orderings
Journal Of Logic And Computation
2009-04-16Paper
Automated Reasoning
Lecture Notes in Computer Science
2007-09-25Paper
scientific article; zbMATH DE number 2090319 (Why is no real title available?)2004-08-12Paper
Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings
Journal of Automated Reasoning
2003-06-09Paper
scientific article; zbMATH DE number 1754647 (Why is no real title available?)2002-06-12Paper
scientific article; zbMATH DE number 1538015 (Why is no real title available?)2000-12-03Paper


Research outcomes over time


This page was built for person: Miquel Bofill