The accepting power of unary string logic programs

Author： Matsushita T.   Runciman C.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.266, Iss.1, 2001-09, pp. : 59-79

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

On logic programs that do not fail

By Pedreschi D.   Ruggieri S.  

Electronic Notes in Theoretical Computer Science, Vol. 30, Iss. 1, 2004-01 ,pp. : 1-25

Elsevier

Access to resources Recommend Favorite

On logic programs that always succeed

By Pedreschi D.   Ruggieri S.  

Science of Computer Programming, Vol. 48, Iss. 2, 2003-08 ,pp. : 163-196

Elsevier

Access to resources Recommend Favorite

Transforming constraint logic programs

By Bensaou N.   Guessarian I.  

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 81-125

Elsevier

Access to resources Recommend Favorite

Quantitative Separation Logic and Programs with Lists

By Bozga Marius   Iosif Radu   Perarnau Swann  

Journal of Automated Reasoning, Vol. 45, Iss. 2, 2010-08 ,pp. : 131-156

Springer Publishing Company

Access to resources Recommend Favorite

A semantics for modular general logic programs

By Etalle S.  

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 51-80

Elsevier

Access to resources Recommend Favorite