Computational complexity and constraint logic programming languages
- 1 June 1992
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 5 (2-4) , 163-189
- https://doi.org/10.1007/bf01543475
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- CAL: A theoretical background of constraint logic programming and its applicationsJournal of Symbolic Computation, 1989
- Quantifier elimination in the theory of an algebraically-closed fieldPublished by Association for Computing Machinery (ACM) ,1989
- Some algebraic and geometric computations in PSPACEPublished by Association for Computing Machinery (ACM) ,1988
- A faster PSPACE algorithm for deciding the existential theory of the realsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Hermite Normal Form Computation Using Modulo Determinant ArithmeticMathematics of Operations Research, 1987
- Alternation and the computational complexity of logic programsThe Journal of Logic Programming, 1984
- Foundations of Logic ProgrammingPublished by Springer Nature ,1984
- AlternationJournal of the ACM, 1981
- Embedded implicational dependencies and their inference problemPublished by Association for Computing Machinery (ACM) ,1981
- Hilbert’s tenth problem: Diophantine equations: positive aspects of a negative solutionPublished by American Mathematical Society (AMS) ,1976