778 search results - page 40 / 156 » Expressiveness and complexity of graph logic |
104
Voted
CCS
2007
ACM
15 years 6 months ago
2007
ACM
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
111
Voted
ASP
2003
Springer
15 years 5 months ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
108
click to vote
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
114
click to vote
BMCBI
2006
15 years 17 days ago
2006
Background: Common fragile sites (cfs) are specific regions in the human genome that are particularly prone to genomic instability under conditions of replicative stress. Several ...
120
Voted
OWLED
2008
15 years 1 months ago
2008
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...