601 search results - page 72 / 121 » Quantified Equality Constraints |
141
Voted
FROCOS
2009
Springer
15 years 7 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
97
Voted
HYBRID
1997
Springer
15 years 5 months ago
1997
Springer
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...
116
click to vote
LOPSTR
1997
Springer
15 years 5 months ago
1997
Springer
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...
91
Voted
TIME
1994
IEEE
15 years 4 months ago
1994
IEEE
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...
89
Voted
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
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...