2035 search results - page 194 / 407 » On the complexity of stratified logics |
191
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
171
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
174
click to vote
DLOG
2007
15 years 8 months ago
2007
We develop a formal framework for modular ontologies by analysing four notions of conservative extensions and their applications in refining, re-using, merging, and segmenting ont...
174
click to vote
MST
2008
15 years 6 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
176
click to vote
ATAL
2007
Springer
16 years 20 days ago
2007
Springer
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...