Mechanizing and Improving Dependency Pairs

Author： Giesl Jürgen Thiemann René Schneider-Kamp Peter Falke Stephan

ISSN： 0168-7433

Source： Journal of Automated Reasoning, Vol.37, Iss.3, 2006-10, pp. : 155-203

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

Modular Termination Proofs for Rewriting Using Dependency Pairs

By Giesl J. Arts T. Ohlebusch E.

Journal of Symbolic Computation, Vol. 34, Iss. 1, 2002-07 ,pp. : 21-58

Academic Press

Access to resources Recommend Favorite

Proving Termination by Dependency Pairs and Inductive Theorem Proving

By Fuhs Carsten

Journal of Automated Reasoning, Vol. 47, Iss. 2, 2011-08 ,pp. : 133-160

Springer Publishing Company

Access to resources Recommend Favorite

Termination of term rewriting using dependency pairs

By Arts T. Giesl J.

Theoretical Computer Science, Vol. 236, Iss. 1, 2000-04 ,pp. : 133-178

Elsevier

Access to resources Recommend Favorite

Improving relevance feedback‐based query expansion by the use of a weighted word pairs approach

JOURNAL OF THE ASSOCIATION FOR INFORMATION SCIENCE AND TECHNOLOGY, Vol. 66, Iss. 11, 2015-11 ,pp. : 2223-2234

John Wiley & Sons Inc

Access to resources Recommend Favorite

A MEAN FIELD NEURAL NETWORK MECHANIZING COMPLEX CAUSAL REASONING PROBLEMS

By Romdhane Lofti Ben

Applied Artificial Intelligence, Vol. 15, Iss. 2, 2001-02 ,pp. : 189-207

Taylor & Francis Ltd

Access to resources Recommend Favorite