A maximal tractable class of soft constraints

Authors:
David Cohen;Martin Cooper;Peter Jeavons;Andrei Krokhin
Affiliations:
Computer Science Department, RHUL, UK;IRIT, University of Toulouse III, France;OUCL, University of Oxford, UK;Computer Science Department, University of Warwick, UK
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 11
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A generic arc-consistency algorithm and its specializations

Artificial Intelligence
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
Closure properties of constraints

Journal of the ACM (JACM)
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Complexity classifications of boolean constraint satisfaction problems

Complexity classifications of boolean constraint satisfaction problems
The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Temporal constraint reasoning with preferences

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Speculative execution of information gathering plans can dramatically reduce the effect of source I/O latencies on overall performance. However, the utility of speculation is closely tied to how accurately data values are predicted at runtime. Caching ...