3446 search results - page 230 / 690 » A Reasoning Algorithm for pD* |
168
click to vote
PLDI
2012
ACM
13 years 7 months ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
128
click to vote
SIGSOFT
2006
ACM
16 years 6 months ago
2006
ACM
Atomicity is a desirable property for business processes to conduct transactions in Business-to-Business (B2B) collaboration. Although it is possible to reason about atomicity of ...
142
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
Semantic Portal is the next generation of web portals that are powered by Semantic Web technologies for improved information sharing and exchange for a community of users. Current...
139
click to vote
PLDI
2010
ACM
16 years 2 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
133
click to vote
LPNMR
2009
Springer
15 years 12 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...