Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesa...
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
We describe in this article an abductive procedure based on a constrained resolution principle. The choice of constrained resolution is motivated by the whish to gain full advanta...
We investigate the problem of refining SQL queries to satisfy cardinality constraints on the query result. This has applications to the many/few answers problems often faced by da...