4513 search results - page 20 / 903 » Logic programming with satisfiability |
CADE
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
FAC
2008
14 years 10 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
159
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
