202 search results - page 37 / 41 » Reasoning about XML with temporal logics and automata |
SEMWEB
2005
Springer
15 years 3 months ago
2005
Springer
This paper addresses a major weakness of current technologies for the Semantic Web, namely the lack of a principled means to represent and reason about uncertainty. This not only h...
77
Voted
CSL
2004
Springer
15 years 3 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
KBSE
2010
IEEE
14 years 8 months ago
2010
IEEE
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
103
click to vote
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
DKE
2006
14 years 9 months ago
2006
Many kinds of news report provide information about events. For example, business news reports in the area of mergers and acquisitions, provide information about events such as &q...