331 search results - page 36 / 67 » HOLCF: Higher Order Logic of Computable Functions |
129
Voted
FOSSACS
2007
Springer
15 years 4 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
104
click to vote
MMMACNS
2005
Springer
15 years 6 months ago
2005
Springer
Making correct access-control decisions is central to security, which in turn requires accounting correctly for the identity, credentials, roles, authority, and privileges of users...
128
Voted
CSCLP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
89
Voted
ENTCS
2008
15 years 16 days ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
118
Voted
ICFP
2005
ACM
16 years 12 days ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...