Solving First-Order Constraints in the Theory of the Evaluated Trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Solving First-Order Constraints in the Theory of the Evaluated Trees

Abstract

We describe in this paper a general algorithm for solving first-order constraints 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. It transforms a first-order formula ϕ, which can possibly contain free variables, into a disjunction φ of solved formulas which is equivalent in T, without new free variables and such that φ is either $\mathit{true}$ or $\mathit{false}$ or a formula having at least one free variable and being equivalent neither to $\mathit{true}$ nor to $\mathit{false}$ in T.
Fichier principal
Vignette du fichier
ICLP06poster.pdf (55.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00144957 , version 1 (12-03-2010)

Identifiers

  • HAL Id : hal-00144957 , version 1

Cite

Thi-Bich-Hanh Dao, Khalil Djelloul. Solving First-Order Constraints in the Theory of the Evaluated Trees. Logic Programming, 22nd International Conference, ICLP 2006, 2006, Seattle, WA, United States. pp.423-424. ⟨hal-00144957⟩
101 View
85 Download

Share

Gmail Facebook X LinkedIn More