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

DOI10.1007/978-3-540-73817-6_7zbMATH Open1176.68198OpenAlexW1631711703MaRDI QIDQ3608448FDOQ3608448

Authors: Thi-Bich-Hanh Dao, Khalil Djelloul 

Publication date: 5 March 2009

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.2570

Recommendations

• Solving First-Order Constraints in the Theory of the Evaluated Trees
• Theory of finite or infinite trees revisited
• Frontiers of Combining Systems
• A full first-order constraint solver for decomposable theories
• A Full First-Order Constraint Solver for Decomposable Theories

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Cited In (12)

• Solving quantifier-free first-order constraints over finite sets and binary relations
• Theory of finite or infinite trees revisited
• Solving First-Order Constraints in the Theory of the Evaluated Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Frontiers of Combining Systems
• A Full First-Order Constraint Solver for Decomposable Theories
• A full first-order constraint solver for decomposable theories
• From decomposable to residual theories
• Expressiveness of full first-order constraints in the algebra of finite or infinite trees
• Extension of First-Order Theories into Trees
• The first-order theory of ordering constraints over feature trees

This page was built for publication: Solving First-Order Constraints in the Theory of the Evaluated Trees

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