Computational complexity and constraint logic programming languages

DOI10.1007/BF01543475zbMath0866.68013OpenAlexW116178176MaRDI QIDQ1354033

Jim Cox, Carol Tretkoff, Kenneth McAloon

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01543475

zbMATH Keywords

CLP languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of programming languages (68N15)

Related Items (3)

From LP to LP: Programming with constraints ⋮ Relative expressiveness of defeasible logics ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates

Uses Software

• CHIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CAL: A theoretical background of constraint logic programming and its applications
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• A canonical form for generalized linear constraints
• Complete problems for deterministic polynomial time
• Linear unification
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• Alternation and the computational complexity of logic programs
• Alternation

This page was built for publication: Computational complexity and constraint logic programming languages