Access the full text.
Sign up today, get DeepDyve free for 14 days.
Khalil Djelloul, T. Dao (2006)
Extension of First-Order Theories into Trees
A. Colmerauer (1989)
An introduction to Prolog IIICommun. ACM, 33
D Oppen (1978)
A $2^{2^{2^n}}$ upper bound on the complexity of Presburger arithmeticJ. Comput. Syst. Sci., 16
KL Clark (1978)
Logic and Data Bases
Khalil Djelloul, T. Dao (2006)
Extension into trees of first order theories
A. Colmerauer, T. Dao (2003)
Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite TreesConstraints, 8
S. Vorobyov (1996)
An Improved Lower Bound for the Elementary Theories of Trees
K. Apt (2003)
Principles of constraint programming
B. Meyer (1990)
Lessons from the design of the Eiffel librariesCommun. ACM, 33
Khalil Djelloul (2006)
Decomposable theoriesTheory and Practice of Logic Programming, 7
D. Oppen (1978)
A 2^2^2^pn Upper Bound on the Complexity of Presburger ArithmeticJ. Comput. Syst. Sci., 16
Khalil Djelloul (2005)
About the Combination of Trees and Rational Numbers in a Complete First-Order Theory
Michael Maher (1988)
Complete axiomatizations of the algebras of finite, rational and infinite trees[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
Khalil Djelloul, T. Dao, Thom Frühwirth (2007)
Theory of finite or infinite trees revisitedTheory and Practice of Logic Programming, 8
Thom Frühwirth, Slim Abdennadher (2010)
Essentials of Constraint Programming
Michael Spivey (1989)
A Categorial Approch to the Theory of Lists
T. Dao, Khalil Djelloul (2006)
Solving First-Order Constraints in the Theory of the Evaluated Trees
(2008)
A full first order constraint solver for decomposable theories . In : Proc of the 9 th International Conference of Artificial Intelligence and Symbolic Computation
Keith Clark (1987)
Negation as Failure
T Rybina, A Voronkov (2001)
A decision procedure for term algebras with queuesACM Trans. Comput. Log., 2
T. Rybina, A. Voronkov (2000)
A decision procedure for term algebras with queuesProceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling, resource allocation, computer graphics and bio-informatics. Recently, a new property called decomposability has been introduced and many first-order theories have been proved to be decomposable: finite or infinite trees, rational and real numbers, linear dense order,...etc. A decision procedure in the form of five rewriting rules has also been developed. This latter can decide if a first-order formula without free variables is true or not in any decomposable theory. Unfortunately, this decision procedure is not enough when we want to express the solutions of a first-order constraint having free variables. These kind of problems are generally known as first-order constraint satisfaction problems. We present in this paper, not only a decision procedure but a full first-order constraint solver for decomposable theories. Our solver is given in the form of nine rewriting rules which transform any first-order constraint ϕ (which can possibly contain free variables) into an equivalent formula φ which is either the formula true, or the formula false or a simple solved formula having at least one free variable and being equivalent neither to true nor to false. We show the efficiency of our solver by solving complex first-order constraints over finite or infinite trees containing a huge number of imbricated quantifiers and negations and compare the performances with those obtained using the most recent and efficient dedicated solver for finite or infinite trees. This is the first full first-order constraint solver for any decomposable theory.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jun 27, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.