Extension of First-Order Theories into Trees-Reference-Cited by-同舟云学术

Extension of First-Order Theories into Trees

Published:2006 Issue: Volume: Page:53-67
ISSN:0302-9743
Container-title:Artificial Intelligence and Symbolic Computation
language:
Short-container-title:

Author:

Djelloul Khalil,Dao Thi-Bich-Hanh

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11856290_7.pdf

Reference30 articles.

1. Baumgartner, T., Furbach, U., Petermann, U.: A unified approach to theory reasoning. Research report, pp. 15-92. Univesitat Koblenz, Germany (1992)

2. Benhamou, F., Colmerauer, A., Van caneghem, M.: The manuel of Prolog IV, PrologIA, Marseille, France (1996)

3. Burckert, H.J.: A resolution principle for constraint logics. Artificial intelligence 66, 235–271 (1994)

4. Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data bases. Plenum Pub., New York (1978)

5. Colmerauer, A.: Total precedence relations. J. ACM 17, 14–30 (1970)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A full first-order constraint solver for decomposable theories;Annals of Mathematics and Artificial Intelligence;2009-05

2. An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints;Lecture Notes in Computer Science;2009

3. Extension of First-Order Theories into Trees;Artificial Intelligence and Symbolic Computation;2006

4. Solving First-Order Constraints in the Theory of the Evaluated Trees;Lecture Notes in Computer Science

5. A Full First-Order Constraint Solver for Decomposable Theories;Lecture Notes in Computer Science