Michael J. Maher and Peter J. Stuckey. On inductive inference of cyclic structures. In F. Hoffman, editor, Annals of Mathematics and Artificial Intelligence, volume F. J.C. Baltzer Scientific Pub. Company, 1990. To appear.  Home/Search   Document Details and Download   Summary   Related Articles

....to delay the so called occur check rule as long as possible. This is the reason why the underlying semantics of Colmerauer s systems of equations and disequations [Col84] involves the algebra of rational trees RT (F ) Equational problems with interpretations in rational trees were studied in [Mah88a, MS90]. 2.3.3 A = IT (F ) The interpretation of equational formulas in the algebra of infinite (and not necessarily rational) trees was also studied in [Mah88a] with the conclusion that a formula holds in IT (F ) iff it holds in RT (F ) 2.3.4 T (F ) solutions in A = NF Let NF be the set of terms in ....

....3.6, this result has decidability consequences: the theories of T (F ) RT (F ) IT (F ) are recursive. These results will be re stated when we give the precise set of axioms. 3. 3 Solved forms for complement problems In the case of complement problems, many algorithms were proposed (for example [LM87, Thi84, Com86, Kuc88, MS90]) corresponding to different kinds of solved forms. The main problem is to transform a complement problem P into a unification problem each time there exists a unification problem U such that P T (F ) U . Lassez and Marriott give in [LM87] necessary and sufficient conditions under which the ....

[Article contains additional citation context not shown here]

Michael J. Maher and Peter J. Stuckey. On inductive inference of cyclic structures. In F. Hoffman, editor, Annals of Mathematics and Artificial Intelligence, volume F. J.C. Baltzer Scientific Pub. Company, 1990. To appear.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC