Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Proving Termination for Logic Programs by the Query-Mapping Pairs Approach."

Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-25951-0_14

access: closed

type: Part in Book or Collection

metadata version: 2017-11-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lopstr/LindenstraussSS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lopstr/LindenstraussSS04
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. Program Development in Computational Logic 2004: 453-498

a service of

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.