Solving Partial Constraint Satisfaction Problems With Tree Decomposition

Networks - United States
doi 10.1002/net.10046
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

Constraint Satisfaction Problems With Infinite Templates

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Solving Bilevel Problems With Polyhedral Constraint Set

Journal of Applied and Numerical Optimization
2019English

Distributed Partial Constraint Satisfaction Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Combining Systematic and Local Search for Approximately Solving Fuzzy Constraint Satisfaction Problems

Transactions of the Japanese Society for Artificial Intelligence
Artificial IntelligenceSoftware
2006English

Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems

Linköping Studies in Science and Technology. Dissertations
2020English

Constraint Satisfaction Problems Over the Integers With Successor

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing
MathematicsComputer Science
2001English

Constraint Satisfaction for Planning and Scheduling Problems

Constraints
CombinatoricsMathematicsDiscrete MathematicsComputational TheoryArtificial IntelligenceSoftware
2011English

Exposing Design Mistakes During Requirements Engineering by Solving Constraint Satisfaction Problems to Obtain Minimum Correction Subsets

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy