111 search results - page 14 / 23 » The eskolemization of universal quantifiers |
200
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a novel approach for modelling correlations
between activities in a busy public space captured by multiple
non-overlapping and uncalibrated cameras. In our approach,
...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
168
Voted
POPL
2004
ACM
15 years 10 months ago
2004
ACM
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
CADE
2003
Springer
15 years 10 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
125
Voted
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...