Computational complexity and constraint logic programming languages
type: Item
instance of: scholarly article
title: Computational complexity and constraint logic programming languages
zbMATH Open document ID: 0866.68013
DOI: 10.1007/BF01543475
author: Jim Cox
author: Carol Tretkoff
author: Kenneth McAloon
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-05-13T00:00:00Z
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1005842
zbMATH Keywords: CLP languages
describes a project that uses: CHIP
MaRDI profile type: Publication
cites work: Constructing roadmaps of semi-algebraic sets. I: Completeness
cites work: Alternation
cites work: Hermite Normal Form Computation Using Modulo Determinant Arithmetic
cites work: Q3973334
cites work: Complete problems for deterministic polynomial time
cites work: A canonical form for generalized linear constraints
cites work: Q3339245
cites work: Q4039734
cites work: Linear unification
cites work: CAL: A theoretical background of constraint logic programming and its applications
cites work: Q3818127
cites work: Alternation and the computational complexity of logic programs
full work available at URL: https://doi.org/10.1007/bf01543475
OpenAlex ID: W116178176
description: scientific article; zbMATH DE number 1005842