TASE
2012
IEEE
12 years 7 months ago
2012
IEEE
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
POPL
2012
ACM
12 years 7 months ago
2012
ACM
It is becoming increasingly important for applications to protect sensitive data. With current techniques, the programmer bears the burden of ensuring that the application’s beh...
JSS
2010
13 years 6 months ago
2010
During software development, architecture decisions should be documented so that quality attributes guaranteed by these decisions and required in the software specification could ...
TCS
2008
13 years 11 months ago
2008
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
ACL
1997
14 years 24 days ago
1997
We propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express e...
ACL
1998
14 years 24 days ago
1998
We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A Astructure can be considered as a A-term up to...
EACL
2003
ACL Anthology
14 years 25 days ago
2003
ACL Anthology
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
CSR
2006
Springer
14 years 3 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
LICS
2006
IEEE
14 years 5 months ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...