Sciweavers

1679 search results - page 6 / 336
» Security Properties and CSP
Sort
View
IJCAI
2003
13 years 9 months ago
Incremental Tractable Reasoning about Qualitative Temporal Constraints
In many applications of temporal reasoning we are in­ terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...
Alfonso Gerevini
B
2007
Springer
13 years 11 months ago
Automatic Translation from Combined B and CSP Specification to Java Programs
Abstract. A recent contribution to the formal specification and verification of concurrent systems is the integration of the state- and event-based approaches B and CSP, specifical...
Letu Yang, Michael Poppleton
CORR
2006
Springer
150views Education» more  CORR 2006»
13 years 7 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
IFM
2005
Springer
100views Formal Methods» more  IFM 2005»
14 years 1 months ago
Embedding the Stable Failures Model of CSP in PVS
We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platfo...
Kun Wei, James Heather
AI
2003
Springer
14 years 26 days ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin