Author： King A.
Publisher： Elsevier
ISSN： 0743-1066
Source： The Journal of Logic Programming, Vol.46, Iss.1, 2000-11, pp. : 139-155
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Set-sharing is redundant for pair-sharing
By Bagnara
Theoretical Computer Science, Vol. 277, Iss. 1, 2002-04 ,pp. :
Access to resources
Recommend
Repeated rational secret sharing, revisited
By Wang Yilei
International Journal of Grid and Utility Computing, Vol. 3, Iss. 1, 2012-03 ,pp. :
Enumerative sequences of leaves and nodes in rational trees
By Bassino F. Beal M.-P. Perrin D.
Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. :
Query automata over finite trees
Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. :