scientific article; zbMATH DE number 2080306
zbMATH Open1044.68748MaRDI QIDQ4473025FDOQ4473025
Authors: Alain Colmerauer, Thi-Bich-Hanh Dao
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1894/18940172.htm
Title of this publication is not available (Why is that?)
Recommendations
- Expressiveness of full first-order constraints in the algebra of finite or infinite trees
- scientific article; zbMATH DE number 2090031
- Solving First-Order Constraints in the Theory of the Evaluated Trees
- Theory of finite or infinite trees revisited
- Solving First-Order Constraints in the Theory of the Evaluated Trees
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Data structures (68P05) Logic in artificial intelligence (68T27) Games involving graphs (91A43)
Cited In (7)
- Solving First-Order Constraints in the Theory of the Evaluated Trees
- Title not available (Why is that?)
- On a decision procedure for quantified linear programs
- Deciding the first-order theory of an algebra of feature trees with updates
- Expressiveness of full first-order constraints in the algebra of finite or infinite trees
- Finite and Rational Tree Constraints
- The first-order theory of ordering constraints over feature trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473025)