Computational Short Cuts in Infinite Domain Constraint Satisfaction

Jonsson, P, Lagerkvist, V and Ordyniak, S orcid.org/0000-0003-1935-651X (2022) Computational Short Cuts in Infinite Domain Constraint Satisfaction. Journal of Artificial Intelligence Research, 75. pp. 793-831. ISSN 1076-9757

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

©2022 AI Access Foundation. All rights reserved. Reproduced in accordance with the publisher's self-archiving policy.

Keywords: constraint satisfaction; mathematical foundation
Dates:
  • Published: 16 November 2022
  • Published (online): 16 November 2022
  • Accepted: 3 October 2022
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
Funder
Grant number
EPSRC (Engineering and Physical Sciences Research Council)
EP/V00252X/1
Depositing User: Symplectic Publications
Date Deposited: 24 Oct 2022 14:01
Last Modified: 16 May 2023 11:42
Status: Published
Publisher: AI Access Foundation
Identification Number: 10.1613/jair.1.13787
Open Archives Initiative ID (OAI ID):

Export

Statistics