343 search results - page 12 / 69 » Complete Axiomatizations for Reasoning About Knowledge and T... |
PODS
2007
ACM
14 years 8 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
AI
2001
Springer
14 years 1 months ago
2001
Springer
In fast-paced software projects, engineers don’t have the time or the resources to build heavyweight complete descriptions of their software. The best they can do is lightweight ...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
CSL
2003
Springer
14 years 1 months ago
2003
Springer
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...