Formal Correctness of a Quadratic Unification Algorithm

Author： Ruiz-Reina José-Luis   Martín-Mateos Francisco-Jesús   Alonso José-Antonio   Hidalgo María-José  

Publisher： Springer Publishing Company

ISSN： 0168-7433

Source： Journal of Automated Reasoning, Vol.37, Iss.1-2, 2006-08, pp. : 67-92

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Qu-Prolog unification algorithm: formalisation and correctness

By Nickolas P.   Robinson P.J.  

Theoretical Computer Science, Vol. 169, Iss. 1, 1996-11 ,pp. : 81-112

Elsevier

Access to resources Recommend Favorite

Improved bound for stochastic formal correctness of numerical algorithms

By Daumas Marc  

Innovations in Systems and Software Engineering, Vol. 6, Iss. 3, 2010-09 ,pp. : 173-179

Springer Publishing Company

Access to resources Recommend Favorite

A decision algorithm for distributive unification

By Schmidt-Schausz M.  

Theoretical Computer Science, Vol. 208, Iss. 1, 1998-11 ,pp. : 111-148

Elsevier

Access to resources Recommend Favorite

A Complete Mechanization of Correctness of a String-Preprocessing Algorithm

By Besta Milos   Stomp Frank  

Formal Methods in System Design, Vol. 27, Iss. 1-2, 2005-09 ,pp. : 5-27

Springer Publishing Company

Access to resources Recommend Favorite

A robust algorithm for quadratic optimization under quadratic constraints

By Tuy Hoang   Hoai-Phuong N.  

Journal of Global Optimization, Vol. 37, Iss. 4, 2007-04 ,pp. : 557-569

Springer Publishing Company

Access to resources Recommend Favorite