3793 search results - page 264 / 759 » Expressive Description Logics |
209
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
293
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
172
click to vote
ATAL
2005
Springer
16 years 6 days ago
2005
Springer
We present a general logic of explicit knowledge represented as finite sets of logical formulae which can evolve by nondeterministic reasoning and communication. It is partly bas...
189
click to vote
ICTCS
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
216
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—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...