Sciweavers

601 search results - page 72 / 121
» Quantified Equality Constraints
Sort
View
FROCOS
2009
Springer
14 years 3 months ago
Combining Theories with Shared Set Operations
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
Thomas Wies, Ruzica Piskac, Viktor Kuncak
HYBRID
1997
Springer
14 years 1 months ago
Robust Timed Automata
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...
LOPSTR
1997
Springer
14 years 1 months ago
Implicit Program Synthesis by a Reversible Metainterpreter
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...
Henning Christiansen
TIME
1994
IEEE
14 years 1 months ago
Using Constrained Resolution for Abductive Temporal Reasoning
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...
Nicolas Chleq
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 23 days ago
Interactive query refinement
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...
Chaitanya Mishra, Nick Koudas