2410 search results - page 141 / 482 » Multiset Ordering Constraints |
178
click to vote
CADE
2004
Springer
16 years 6 months ago
2004
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
175
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
347
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
178
click to vote
JAR
2006
15 years 6 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
157
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...