Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
This paper presents a new data classification method based on mixed-integer programming. Traditional approaches that are based on partitioning the data sets into two groups perfor...