"A Simple Proof on the Decidability of Equivalence Between Recursive and ..."

Hing Leung et al. (1995)

> Home

Details and statistics

DOI: 10.1016/0020-0190(95)00097-V

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/LeungRHTG95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/LeungRHTG95
Hing Leung, Desh Ranjan, Héctor J. Hernández, D. T. Tang, Agustin González:
A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs. Inf. Process. Lett. 55(5): 279-282 (1995)

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.