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

DOI10.1007/3-540-45349-0_14MaRDI QIDQ4473025zbMATH OpenFDO

Authors Alain Colmerauer, Thi-Bich-Hanh Dao

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1894/18940172.htm

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Expressiveness of full first-order constraints in the algebra of finite or infinite trees
• Expressiveness and complexity of full first-order constraints in the algebra of trees
• 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

Cited in

(7)

• Expressiveness of full first-order constraints in the algebra of finite or infinite trees
• Deciding the first-order theory of an algebra of feature trees with updates
• On a decision procedure for quantified linear programs
• The first-order theory of ordering constraints over feature trees
• Finite and Rational Tree Constraints
• Expressiveness and complexity of full first-order constraints in the algebra of trees
• Solving First-Order Constraints in the Theory of the Evaluated Trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473025)