 |
Université d'Orléans |  |
|
Université d'Orléans | |
| HAL: hal-00202314, version 1 |
| Detailed view |  Export this paper |
 |
| Recent Advance in constraints. Lecture notes in computer science. Selected revised paper Csclp 2006., France (2007) |
|
|
|
|
| Solving First-Order Constraints in the Theory of the Evaluated Trees |
|
|
| Thi-Bich-Hanh Dao 1Khalil Djelloul 1 |
|
|
| (2007) |
|
|
|
| We present in this paper a first-order extension of the solver of Prolog III, by giving not only a decision procedure, but a full firstorder constraint solver in the theory T of the evaluated trees, which is a combination of the theory of finite or infinite trees and the theory of the rational numbers with addition, subtraction and a linear dense order relation. The solver is given in the form of 28 rewriting rules which transform any first-order formula ' into an equivalent disjunction D of simple formulas in which the solutions of the free variables are expressed in a clear and explicit way. The correctness of our algorithm implies the completeness of a first-order theory built on the model of Prolog III. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Logic in Computer Science |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00202314, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00202314 | |
| oai:hal.archives-ouvertes.fr:hal-00202314 | |
| From: Khalil Djelloul | |
| Submitted on: Tuesday, 8 January 2008 14:12:23 | |
| Updated on: Wednesday, 21 April 2010 12:04:55 | |
