OpenAlex
Solving infinite-domain CSPs using the patchwork property
Work
Year: 2023
Type: article
Abstract: The constraint satisfaction problem (CSP) has important applications in computer science and AI. In particular, infinite-domain CSPs have been intensively used in subareas of AI such as spatio-tempora... more
Source: Artificial Intelligence
Authors Konrad K. Dabrowski, Peter Jönsson, Sebastian Ordyniak, George Osipov
Institutions Newcastle University, Linköping University, University of Leeds
Cites: 57
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Topic: Constraint Satisfaction and Optimization
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Quality education
Open Access status: hybrid
APC paid (est): $3,670
Funders Knut och Alice Wallenbergs Stiftelse, Vetenskapsrådet, Vetenskapsrådet, Engineering and Physical Sciences Research Council