Search Results - "Bofill, Miquel"

Biocatalytic synthesis of vanillin by an immobilised eugenol oxidase: High biocatalyst yield by enzyme recycling by García-Bofill, Miquel, Sutton, Peter W., Straatman, Harrie, Brummund, Jan, Schürmann, Martin, Guillén, Marina, Álvaro, Gregorio

“…[Display omitted] •Biosynthesis of vanillin using EUGO is optimised.•The best conditions allow an organic solvent free process of 9.9 g prod…”
Get full text

Enzymatic synthesis of a statin precursor by immobilised alcohol dehydrogenase with NADPH oxidase as cofactor regeneration system by García-Bofill, Miquel, Sutton, Peter W., Guillén, Marina, Álvaro, Gregorio

“…[Display omitted] •Development of an enzymatic synthesis of a statin precursor.•Process optimization by Design of Experiments.•Enzyme immobilisation improved…”
Get full text

An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations by Bofill, Miquel, Coll, Jordi, Suy, Josep, Villaret, Mateu

“…Pseudo-Boolean (PB) constraints are ubiquitous in Constraint Satisfaction Problems. Encoding such constraints to SAT has proved to be an efficient solving…”
Get full text

The Impact of Implied Constraints on MaxSAT B2B Instances by Bofill, Miquel, Coll, Jordi, Giráldez-Cru, Jesús, Suy, Josep, Villaret, Mateu

“…The B2B scheduling optimization problem consists of finding a schedule of a set of meetings between pairs of participants, minimizing their number of idle time…”
Get full text

SMT encodings for Resource-Constrained Project Scheduling Problems by Bofill, Miquel, Coll, Jordi, Suy, Josep, Villaret, Mateu

“…The Resource-Constrained Project Scheduling Problem (RCPSP) is a paradigmatic scheduling problem where the activities of a project have to be scheduled while…”
Get full text

SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints by Bofill, Miquel, Coll, Jordi, Nightingale, Peter, Suy, Josep, Ulrich-Oltean, Felix, Villaret, Mateu

“…When solving a combinatorial problem using propositional satisfiability (SAT), the encoding of the problem is of vital importance. We study encodings of…”
Get full text

The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches by Bofill, Miquel, Coll, Jordi, Martín, Gerard, Suy, Josep, Villaret, Mateu

“…Nowadays there exists a wide variety of automatic machines that perform analytical tests on liquid samples, such as water, blood, urines, saliva, etc. A test…”
Get full text

New complexity results for Łukasiewicz logic by Bofill, Miquel, Manyà, Felip, Vidal, Amanda, Villaret, Mateu

“…One aspect that has been poorly studied in multiple-valued logics, and in particular in Łukasiewicz logic, is the generation of instances of varying difficulty…”
Get full text

Enzymatic synthesis of vanillin catalysed by an eugenol oxidase by García-Bofill, Miquel, Sutton, Peter W., Guillén, Marina, Álvaro, Gregorio

“…[Display omitted] •A new biocatalytic process for natural vanillin synthesis catalyzed by an eugenol oxidase is presented.•EUGO immobilised onto…”
Get full text

Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem by Bofill, Miquel, Coll, Jordi, Garcia, Marc, Giráldez-Cru, Jesús, Pesant, Gilles, Suy, Josep, Villaret, Mateu

“…The Business-to-Business Meeting Scheduling problem consists of scheduling a set of meetings between given pairs of participants to an event, while taking into…”
Get full text

Relaxing non-interference requirements in parallel plans by Bofill, Miquel, Espasa, Joan, Villaret, Mateu

“…Abstract The aim of being able to reason about quantities, time or space has been the main objective of the many efforts on the integration of propositional…”
Get full text

Paramodulation with Non-Monotonic Orderings and Simplification by Bofill, Miquel, Rubio, Albert

“…Ordered paramodulation and Knuth-Bendix completion are known to remain complete when using non-monotonic orderings. However, these results do not imply the…”
Get full text

Solving constraint satisfaction problems with SAT modulo theories by Bofill, Miquel, Palahí, Miquel, Suy, Josep, Villaret, Mateu

“…Due to significant advances in SAT technology in the last years, its use for solving constraint satisfaction problems has been gaining wide acceptance. Solvers…”
Get full text

Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers by Ansótegui, Carlos, Bofill, Miquel, Manyà, Felip, Villaret, Mateu

“…There is a relatively large number of papers dealing with complexity and proof theory issues of multiple-valued logics. Nevertheless, little attention has been…”
Get full text

Finding Hard Instances of Satisfiability in Lukasiewicz Logics by Bofill, Miquel, Manya, Felip, Vidal, Amanda, Villaret, Mateu

“…One aspect that has been poorly studied in multiple-valued logics, and in particular in Lukasiewicz logics, is the generation of instances of varying…”
Get full text

Reformulation based MaxSAT robustness by Bofill, Miquel, Busquets, Dídac, Muñoz, Víctor, Villaret, Mateu

“…The presence of uncertainty in the real world makes robustness a desirable property of solutions to constraint satisfaction problems (CSP). A solution is said…”
Get full text

Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories by Ansótegui, Carlos, Bofill, Miquel, Palahí, Miquel, Suy, Josep, Villaret, Mateu

“…We introduce WSimply , a new framework for modelling and solving Weighted Constraint Satisfaction Problems (WCSP) using Satisfiability Modulo Theories (SMT)…”
Get full text

On Grid Graph Reachability and Puzzle Games by Bofill, Miquel, Borralleras, Cristina, Espasa, Joan, Villaret, Mateu

“…Many puzzle video games, like Sokoban, involve moving some agent in a maze. The reachable locations are usually apparent for a human player, and the difficulty…”
Get full text

The recursive path and polynomial ordering for first-order and higher-order terms by Bofill, M., Borralleras, C., Rodriguez-Carbonell, E., Rubio, A.

“…In most termination tools two ingredients, namely recursive path orderings (RPOs) and polynomial interpretation orderings (POLOs), are used in a consecutive…”
Get full text

Paramodulation with Well-founded Orderings by Bofill, Miquel, Rubio, Albert

“…For many years, all existing completeness results for Knuth–Bendix completion and ordered paramodulation required the term ordering ≻ to be well-founded,…”
Get full text