Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.211, Iss.1, 1999-01, pp. : 275-309
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Loop checking in SLD-derivations by well-quasi-ordering of goals
Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. :
Access to resources
Recommend
Properties of Input-Consuming Derivations
By Bossi A. Etalle S. Rossi S.
Electronic Notes in Theoretical Computer Science, Vol. 30, Iss. 1, 2004-01 ,pp. :
Hybrid Extensional Prototype Compositionality
By Jylkkä Jussi
Minds and Machines, Vol. 21, Iss. 1, 2011-02 ,pp. :
Approximate reasoning by similarity-based SLD resolution
By Sessa M.I.
Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. :