output
20022026
most citedSearch for Neutral MSSM Higgs Bosons at LEP

713 citations

407 papers

cs.LO2026★ 23 cited

SAT-based Encodings for Optimal Decision Trees with Explicit Paths

Mikoláš Janota, António Morgado

Decision trees play an important role both in Machine Learning and Knowledge Representation. They are attractive due to their immediate interpretability. In the spirit of Occam's r…

cs.LO2026★ 150 cited

Solving QBF with Counterexample Guided Refinement

Mikoláš Janota, William Klieber, Joao Marques-Silva +1

We propose two novel approaches for using Counterexample-Guided Abstraction Refinement (CEGAR) in Quantified Boolean Formula (QBF) solvers. The first approach develops a recursive…

cs.LO2026★ 60 cited

Solving QBF by Clause Selection

Mikoláš Janota, Joao Marques-Silva

Algorithms based on the enumeration of implicit hitting sets find a growing number of applications, which include maximum satisfiability and model based diagnosis, among others. Th…

cs.LO2026

What Bugs Do Prolog Students Write? An Empirical Taxonomy and Data-Driven Mutation Framework

Ricardo Brancas, Pedro Orvalho, Carolina Carreira +2

Automated feedback tools for logic programming education depend on realistic bug datasets that reflect the mistakes students actually make. However, existing mutation testing frame…

cs.PL2026

Welterweight Go: Boxing, Structural Subtyping, and Generics (Extended Version)

Raymond Hu, Julien Lange, Bernardo Toninho +3

Go's unique combination of structural subtyping between generics and types with non-uniform runtime representations presents significant challenges for formalising the language. We…

cs.DC2026★ 5 cited

CARM Tool: Cache-Aware Roofline Model Automatic Benchmarking and Application Analysis

José Morgado, Leonel Sousa, Aleksandar Ilic

In recent years, HPC systems and CPU architectures as their central components, have become increasingly complex, making application development and optimization quite challenging.…