4401 search results - page 241 / 881 » Computing with Default Logic |
161
click to vote
COORDINATION
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Coordination languages are often used to describe open ended systems. This makes it challenging to develop tools for guaranteeing security of the coordinated systems and ...
123
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
149
click to vote
JAIR
2008
15 years 5 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
164
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
In certain critical cases the data flow between business departments in banking organizations has to respect security policies known as Chinese Wall or Bell–La Padula. We show t...
156
click to vote
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...