A5058622165- Formal Methods in Verification
- Constraint Satisfaction and Optimization
- Logic, programming, and type systems
- Logic, Reasoning, and Knowledge
- Software Testing and Debugging Techniques
- Advanced Software Engineering Methodologies
- Scheduling and Optimization Algorithms
- Genetic Associations and Epidemiology
- AI-based Problem Solving and Planning
- Gene expression and cancer classification
- Bayesian Modeling and Causal Inference
- Gene Regulatory Network Analysis
- Advanced Multi-Objective Optimization Algorithms
- Software Engineering Research
- Model-Driven Software Engineering Techniques
- Software System Performance and Reliability
- Natural Language Processing Techniques
- Semantic Web and Ontologies
- Software Reliability and Analysis Research
- Machine Learning in Bioinformatics
- Bioinformatics and Genomic Networks
- Service-Oriented Architecture and Web Services
- Advanced Database Systems and Queries
- Microbial Metabolic Engineering and Bioproduction
- Scheduling and Timetabling Solutions
University of Lisbon
2015-2024
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento
2015-2024
Instituto Politécnico de Lisboa
2005-2024
University of Oxford
2015
Instituto Superior Técnico
2007
Minimally Unsatisfiable Subformulas (MUS) find a wide range of practical applications, including product configuration, knowledge-based validation, and hardware software design verification. MUSes also application in recent Maximum Satis
The problem of propositional satisfiability (SAT) has found a number applications in both theoretical and practical computer science. In many applications, however, knowing formula's alone is insufficient. Often, some other proper
Preprocessing is an often used approach for solving hard instances of propositional satisfiability (SAT). can be reducing the number variables and drastically modifying set clauses, either by eliminating irrelevant clauses or inferring new clauses. Over years, a large formula manipulation techniques has been proposed, that in some situations have allowed not otherwise solvable with state-of-the-art SAT solvers. This paper proposes probing-based preprocessing, integrated preprocessing...
Managing the software complexity of package-based systems can be regarded as one main challenges in architectures. Upgrades are required on a short time basis and expected to reliable consistent after that. For each package system, set dependencies conflicts have taken into account. Although this problem is computationally hard solve, efficient tools required. In best scenario, solutions provided should also optimal order better fulfill users requirements expectations. This paper describes...
With the growth of open-source data science community, both number libraries and versions for same library are increasing rapidly. To match evolving APIs from those libraries, organizations often have to exert manual effort refactor used in code base. Moreover, due abundance similar scientists working on a certain application may an choose, maintain migrate between. The refactoring between is tedious error-prone task. Although recent research efforts were made performing automatic API...