Meta-resolution: An algorithmic formalisation

Author： Fouks J.-D.   Spehner J.-C.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.166, Iss.1, 1996-10, pp. : 147-172

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

Optimization of Algorithmic Parameters using a Meta-Control Approach*

By Kohn Wolf   Zabinsky Zelda   Brayman Vladimir  

Journal of Global Optimization, Vol. 34, Iss. 2, 2006-02 ,pp. : 293-316

Springer Publishing Company

Access to resources Recommend Favorite

Formalisation of the multigrid computations

By Martynenko Sergey  

International Journal of Computing Science and Mathematics, Vol. 4, Iss. 4, 2013-12 ,pp. : 309-320

Inderscience Publishers

Access to resources Recommend Favorite

ALGORITHMIC IDEOLOGY

By Mager Astrid  

Information, Communication and Society, Vol. 15, Iss. 5, 2012-06 ,pp. : 769-787

Routledge Ltd

Access to resources Recommend Favorite

Lightweight Formalisation in Support of Requirements Engineering

By Hesketh J.  

Automated Software Engineering, Vol. 5, Iss. 2, 1998-04 ,pp. : 183-210

Springer Publishing Company

Access to resources Recommend Favorite

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