725 search results - page 87 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
131
Voted
ICLP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
121
Voted
DEBS
2008
ACM
15 years 4 months ago
2008
ACM
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
127
Voted
CCS
2006
ACM
15 years 6 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
125
Voted
ICST
2008
IEEE
15 years 9 months ago
2008
IEEE
It is becoming increasingly important to be able to adapt an application’s behavior at run time in response to changing requirements and environmental conditions. Adaptive progr...
135
Voted
ICFP
2008
ACM
16 years 2 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...