Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.142, Iss.1, 1995-05, pp. : 89-124

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

Implementation of a multifunctional logic gate based on folding/unfolding transitions of a protein

By Deonarine A.S. Clark S.M. Konermann L.

Future Generation Computer Systems, Vol. 19, Iss. 1, 2003-01 ,pp. : 87-97

Elsevier

Access to resources Recommend Favorite

Polynomial-time learnability of logic programs with local variables from entailment

By Krishna Rao M.R.K. Sattar A.

Theoretical Computer Science, Vol. 268, Iss. 2, 2001-10 ,pp. : 179-198

Elsevier

Access to resources Recommend Favorite

Verifying Termination and Reduction Properties about Higher-Order Logic Programs

By Pientka Brigitte

Journal of Automated Reasoning, Vol. 34, Iss. 2, 2005-12 ,pp. : 179-207

Springer Publishing Company

Access to resources Recommend Favorite

A Logic of Temporal Variables

By Stothert A.G. Macleod I.M.

Engineering Applications of Artificial Intelligence, Vol. 8, Iss. 3, 1995-06 ,pp. : 251-260

Elsevier

Access to resources Recommend Favorite

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