4117 search results - page 118 / 824 » On the Satisfiability of Complex Constraints |
165
click to vote
RR
2010
Springer
15 years 4 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
149
click to vote
RSFDGRC
2005
Springer
15 years 12 months ago
2005
Springer
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
138
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
163
click to vote
DAM
2006
15 years 6 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
166
click to vote
LATINCRYPT
2010
15 years 4 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...