111 search results - page 19 / 23 » The eskolemization of universal quantifiers |
DLT
2010
13 years 9 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
ER
2007
Springer
14 years 2 months ago
2007
Springer
Frequently the behaviour of an information system is functionally correct, but it does not meet some quality criteria, such as completeness, consistency, and usability. One way to...
IPSN
2007
Springer
14 years 2 months ago
2007
Springer
We introduce a novel laser spectroscopic trace-gas sensor platform, LaserSPECks that integrates recently developed miniature quartz-enhanced photoacoustic spectroscopy (QEPAS) gas...
JCDL
2003
ACM
14 years 1 months ago
2003
ACM
The increasing power of techniques to model complex geometry and extract meaning from 3D information create complex data that must be described, stored, and displayed to be useful...