212 search results - page 16 / 43 » Completeness and Complexity of Bounded Model Checking |
AI
2005
Springer
13 years 7 months ago
2005
Springer
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
ISCA
2012
IEEE
11 years 9 months ago
2012
IEEE
Data-race freedom is a valuable safety property for multithreaded programs that helps with catching bugs, simplifying memory consistency model semantics, and verifying and enforci...
DALT
2005
Springer
14 years 28 days ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...
ECCC
2011
13 years 2 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...