Sciweavers

1032 search results - page 87 / 207
» Extended Computation Tree Logic
Sort
View
CSFW
2010
IEEE
15 years 1 months ago
Constraining Credential Usage in Logic-Based Access Control
—Authorization logics allow concise specification of flexible access-control policies, and are the basis for logic-based access-control systems. In such systems, resource owner...
Lujo Bauer, Limin Jia, Divya Sharma
AMAI
1999
Springer
14 years 9 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
FOCS
1998
IEEE
15 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
GROUP
2005
ACM
15 years 3 months ago
Unraveling the ordering in persistent chat: a new message ordering feature
A common problem in chat is that the chat display only reveals the temporal order of the conversation. A better user interface is desired that reveals the logical order of the mes...
Lu Xiao, Jayne S. Litzinger
CP
2006
Springer
15 years 1 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière