237 search results - page 4 / 48 » On the decidability and complexity of reasoning about only k... |
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Access-control policies have grown from simple matrices to non-trivial specifications written in sophisticated languages. The increasing complexity of these policies demands corres...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
AAAI
2007
13 years 9 months ago
2007
In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description...
ATAL
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...