Carlos Mencía

Orcid: 0000-0001-7361-5709

According to our database1, Carlos Mencía authored at least 42 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Surrogate model for memetic genetic programming with application to the one machine scheduling problem with time-varying capacity.
Expert Syst. Appl., December, 2023

Efficient Reasoning about Infeasible One Machine Sequencing.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
A memetic algorithm for restoring feasibility in scheduling with limited makespan.
Nat. Comput., 2022

Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling.
Nat. Comput., 2022

2021
Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity.
Swarm Evol. Comput., 2021

Learning ensembles of priority rules for online scheduling by hybrid evolutionary algorithms.
Integr. Comput. Aided Eng., 2021

Efficient repairs of infeasible job shop problems by evolutionary algorithms.
Eng. Appl. Artif. Intell., 2021

The optimal filtering set problem with application to surrogate evaluation in genetic programming.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020
Reasoning About Strong Inconsistency in ASP.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Reasoning About Inconsistent Formulas.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Exhaustive Search of Priority Rules for On-Line Scheduling.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Evolutionary one-machine scheduling in the context of electric vehicles charging.
Integr. Comput. Aided Eng., 2019

Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time.
Appl. Soft Comput., 2019

On Computing the Union of MUSes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Repairing Infeasibility in Scheduling via Genetic Algorithms.
Proceedings of the From Bioinspired Systems and Biomedical Applications to Machine Learning, 2019

Computing Shortest Resolution Proofs.
Proceedings of the Progress in Artificial Intelligence, 2019

2018
Premise Set Caching for Enumerating Minimal Correction Subsets.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Minimal sets on propositional formulae. Problems and reductions.
Artif. Intell., 2017

Improving MCS Enumeration via Caching.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Genetic Algorithm for Scheduling Charging Times of Electric Vehicles Subject to Time Dependent Power Availability.
Proceedings of the Natural and Artificial Computation for Biomedicine and Neuroscience, 2017

Lean Kernels in Description Logics.
Proceedings of the Semantic Web - 14th International Conference, 2017

Debugging EL+ Ontologies through Horn MUS Enumeration.
Proceedings of the 30th International Workshop on Description Logics, 2017

2016
Genetic algorithms for the scheduling problem with arbitrary precedence relations and skilled operators.
Integr. Comput. Aided Eng., 2016

MCS Extraction with Sublinear Oracle Queries.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

BEACON: An Efficient SAT-Based Tool for Debugging <i>EL</i>^+ Ontologies.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Efficient Reasoning for Inconsistent Horn Formulae.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

2015
New schedule generation schemes for the job-shop problem with operators.
J. Intell. Manuf., 2015

Memetic algorithms for the job shop scheduling problem with operators.
Appl. Soft Comput., 2015

Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules.
AI Commun., 2015

SAT-Based Horn Least Upper Bounds.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Efficient Axiom Pinpointing with EL2MCS.
Proceedings of the KI 2015: Advances in Artificial Intelligence, 2015

Literal-Based MCS Extraction.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Schedule Generation Schemes and Genetic Algorithm for the Scheduling Problem with Skilled Operators and Arbitrary Precedence Relations.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

2014
A genetic algorithm for job-shop scheduling with operators enhanced by weak Lamarckian evolution and search space narrowing.
Nat. Comput., 2014

Intensified iterative deepening A* with application to job shop scheduling.
J. Intell. Manuf., 2014

Efficient Relaxations of Over-constrained CSPs.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2013
Depth-first heuristic search for the job shop scheduling problem.
Ann. Oper. Res., 2013

2012
Robust Solutions to Job-Shop Scheduling Problems with Operators.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

2011
Genetic Algorithm for Job-Shop Scheduling with Operators.
Proceedings of the New Challenges on Bioinspired Applications, 2011

Optimally Scheduling a Job-Shop with Operators and Total Flow Time Minimization.
Proceedings of the Advances in Artificial Intelligence, 2011

2010
Partially Informed Depth-First Search for the Job Shop Problem.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010


  Loading...