We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...