1423 search results - page 85 / 285 » Languages of Nested Trees |
MODELS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Models addressing both structure and behaviour of a system are usually quite complex. Much of the complexity is caused by the necessity to distinguish between different c...
CP
2005
Springer
15 years 5 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
HIPC
2000
Springer
15 years 3 months ago
2000
Springer
: This paper presents the results from running five experiments with the Chime Parallel Processing System. The Chime System is an implementation of the CC++ programming language (p...
122
click to vote
JLP
2011
14 years 6 months ago
2011
Formal languages for policy have been developed for access control and conformance checking. In this paper, we describe a formalism that combines features that have been developed...
CADE
2006
Springer
16 years 6 days ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...