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

DOI10.1023/A:1025675127871zbMath1057.68077OpenAlexW2604976281MaRDI QIDQ1424767

Alain Colmerauer, Thi-Bich-Hanh Dao

Publication date: 15 March 2004

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025675127871

zbMATH Keywords

complexityfirst-order logictreesconstraintsexpressiveness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Decomposable theories ⋮ An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints ⋮ A full first-order constraint solver for decomposable theories ⋮ From decomposable to residual theories ⋮ A Full First-Order Constraint Solver for Decomposable Theories

This page was built for publication: Expressiveness of full first-order constraints in the algebra of finite or infinite trees