2501 search results - page 288 / 501 » Logics with Rank Operators |
172
click to vote
TIME
2007
IEEE
16 years 8 days ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
154
click to vote
CPAIOR
2007
Springer
16 years 5 days ago
2007
Springer
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...
149
click to vote
ISMIS
2005
Springer
15 years 11 months ago
2005
Springer
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
156
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
155
click to vote
IDEAL
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...