2430 search results - page 391 / 486 » Computing Tutte Polynomials |
134
click to vote
EPIA
2007
Springer
15 years 9 months ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
118
click to vote
ER
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
108
click to vote
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, wh...
118
Voted
ICDT
2007
ACM
15 years 9 months ago
2007
ACM
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
136
click to vote
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...