Carlos Mencía

Available identifiers

Publication	Date of Publication	Type
A memetic algorithm for restoring feasibility in scheduling with limited makespan	2023-08-31	Paper
Reasoning about strong inconsistency in ASP	2021-04-07	Paper
On computing the union of MUSes	2020-05-20	Paper
Minimal sets on propositional formulae. Problems and reductions	2017-11-21	Paper
Improving MCS enumeration via caching	2017-11-15	Paper
Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules	2017-11-07	Paper
Efficient reasoning for inconsistent Horn formulae	2016-11-30	Paper
BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies	2016-09-05	Paper
MCS Extraction with Sublinear Oracle Queries	2016-09-05	Paper
Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing	2015-11-20	Paper
SAT-Based Horn Least Upper Bounds	2015-11-20	Paper
Depth-first heuristic search for the job shop scheduling problem	2013-09-03	Paper

This page was built for person: Carlos Mencía