Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.238, Iss.1, 2000-05, pp. : 131-159
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
On logic programs that do not fail
Electronic Notes in Theoretical Computer Science, Vol. 30, Iss. 1, 2004-01 ,pp. :
On logic programs that always succeed
Science of Computer Programming, Vol. 48, Iss. 2, 2003-08 ,pp. :
Transforming constraint logic programs
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :
A combinatory logic approach to higher-order E-unification
Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. :