"The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier (1993)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2013-12-04

- no documents available
- export record
  dblp key:
  - conf/slp/DevienneLR93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/slp/DevienneLR93
Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier:
The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable. ILPS 1993: 250-265

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.