Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
From local to global consistency
Artificial Intelligence
Interchangeability preprocessing can improve forward checking search
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
On the computation of local interchangeability in discrete constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Dynamic Bundling: Less Effort for More Solutions
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Exploiting Interchangeabilities for Case Adaptation
ICCBR '01 Proceedings of the 4th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Interchangeability in Soft CSPs
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Directional Interchangeability for Enhancing CSP Solving
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A Refutation Approach to Neighborhood Interchangeability in CSPs
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Asynchronous aggregation and consistency in distributed constraint satisfaction
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Interchangeability in soft CSPs
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
A novel approach for detecting symmetries in CSP models
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
WCSP integration of soft neighborhood substitutability
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Many-to-many interchangeable sets of values in CSPs
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Eliminating redundancy in CSPs through merging and subsumption of domain values
ACM SIGAPP Applied Computing Review
Interchangeability with thresholds and degradation factors for Soft CSPs
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
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 ...