Expressiveness of full first order constraints in the algebra of finite or infinite trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1894, Issue , 2000, Pages 172-186

  Colmerauer, Alain ^a   Dao, Thi Bich Hanh ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; TURING MACHINES;

ALGORITHM FOR SOLVING; COMPLEXITY RESULTS; CONSTRUCTIVE PROOF; ELEMENTARY FUNCTION; EXPONENTIATIONS; INFINITE NUMBERS; INFINITE TREES; TWO PERSON GAME;

FORESTRY;

EID: 2442528101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_14     Document Type: Conference Paper

References (14)

1. Benhamou F., P. Bouvier, A. Colmerauer, H. Garetta, B. Giletta, J. L. Massat, G. A. Narboni, S. N’Dong, R. Pasero, J. F. Pique, Touräivane, M. Van Caneghem and E. Vétillard, Le manuel de Prolog IV. PrologIA, Marseille, June 1996.
2. Clark K. L., Negation as failure, in Logic and Databases, edited by H. Gallaire and J. Minker, Plenum Press, New York, pp. 293-322, 1978.
3. Colmerauer A., Prolog and Infinite Trees, in Logic Programming, K. L. Clark and S. A.. Tarnlund editors, Academic Press, New York, pp. 231-251, 1982.
4. Colmerauer A., Henry Kanoui and Michel Van Caneghem, Prolog, theoretical principles and current trends, in Technology and Science of Informatics, North Oxford Academic, vol. 2, no 4, August 1983. English version of the journal TSI, AFCET-Bordas, where the paper appears under the title: Prolog, bases théoriques et développements actuels.
5. Colmerauer A., Equations and Inequations on Finite and Infinite Trees, in Proceeding of the International Conference on Fifth Generation Computer Systems (FCGS-84), ICOT, Tokyo, pp. 85-99, 1984.
6. Colmerauer A., An Introduction to Prolog III, Communications of the ACM, 33(7): 68-90, 1990.
7. Coupet-Grimal S. and O. Ridoux, On the use of advanced logic programming features in computational linguistics. The Journal of Logic Programming, 24(1-2), pages 121-159.
8. Courcelle B., Fundamental Properties of Infinite Trees, Theoretical Computer Science, 25(2), pp. 95-169, March 1983.
9. Courcelle B., Equivalences and Transformations of Regular Systems - Applications to Program Schemes and Grammars, Theoretical Computer Science, 42, pp. 1-122, 1986.
10. Dao T. B. H., Résolution de contraintes du premier ordre dans la théorie des arbres fini ou infinis, Neuvièmes Journées Francophones de Programmation Logique et Programmation par Contraintes (JFPLC’2000), Marseille, June 2000, proceedings to be published by Hermes Science Publications.
11. Huet G., Résolution d’équations dans les langages d’ordre 1, 2,..., ω., Thèse d’Etat, Université Paris 7, 1976.
12. Maher M. J., Complete Axiomatization of the Algebra of Finite, Rational and Infinite Trees, Technical report, IBM - T. J.Watson Research Center, 1988.
13. Mielniczuk P., Basic Theory of Feature Trees, submitted to Journal of Symbolic Computation, also available at http://www.tcs.uni.wroc.pl/~mielni.
14. Vorobyov S., An Improved Lower Bound for the Elementary Theories of Trees, Proceeding of the 13th International Conference on Automated Deduction (CADE’96). Springer Lecture Notes in Artificial Intelligence, vol 1104, pp. 275-287, New Brunswick, NJ, July/August, 1996.