The following pages link to Carlos Mencía (Q363572):
Displayed 12 items.
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Improving MCS enumeration via caching (Q1680254) (← links)
- On computing the union of MUSes (Q2181933) (← links)
- Reasoning about strong inconsistency in ASP (Q2661359) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (Q3453236) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules (Q4589102) (← links)
- A memetic algorithm for restoring feasibility in scheduling with limited makespan (Q6177176) (← links)