Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs

Authors:
Richard J. Wallace
Affiliations:
Department of Computer Science, University of New Hampshire, Durham, NH
Venue:
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Year:
1993

Citing 5
Cited 6

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Arc and path consistence revisited

Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Constraint satisfaction algorithms

Computational Intelligence

Dynamic CSPs for Interval-Based Temporal Reasoning

IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Using inference to reduce arc consistency computation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
An optimal coarse-grained arc consistency algorithm

Artificial Intelligence
A study of encodings of constraint satisfaction problems with 0/1 variables

ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
A REVIEW OF TREE CONVEX SETS TEST

Computational Intelligence
Layered fixed point logic

Proceedings of the 14th symposium on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion ...