A CLP view of logic programming
- 9 June 2005
- book chapter
- Published by Springer Nature
- p. 364-383
- https://doi.org/10.1007/bfb0013838
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Complete axiomatizations of the algebras of finite, rational and infinite treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Definite clause programs are canonical (over a suitable domain)Annals of Mathematics and Artificial Intelligence, 1990
- A computable semantics for general logic programsThe Journal of Logic Programming, 1989
- Equational problems anddisunificationJournal of Symbolic Computation, 1989
- Equivalences of Logic ProgramsPublished by Elsevier ,1988
- Negation in Logic ProgrammingPublished by Elsevier ,1988
- Negation in logic programmingThe Journal of Logic Programming, 1987
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Constraint logic programmingPublished by Association for Computing Machinery (ACM) ,1987
- Canonical logic programsThe Journal of Logic Programming, 1986