On logic programs that always succeed

Publisher： Elsevier

ISSN： 0167-6423

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

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

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

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

The power of the ''always'' operator in first-order temporal logic

By Kaminski M. Chung K.W.

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 271-281

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