"Automated termination proofs for logic programs by term rewriting."

Peter Schneider-Kamp et al. (2009)

> Home

Details and statistics

DOI: 10.1145/1614431.1614433

access: closed

type: Journal Article

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tocl/Schneider-KampGST09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/Schneider-KampGST09
Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
Automated termination proofs for logic programs by term rewriting. ACM Trans. Comput. Log. 11(1): 2:1-2:52 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.