"Superfiniteness of Query Answers in Deductive Databases: An ..."

Laks V. S. Lakshmanan, Daniel A. Nonen (1992)

> Home

Details and statistics

DOI: 10.1007/3-540-56287-7_104

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fsttcs/LakshmananN92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/LakshmananN92
Laks V. S. Lakshmanan, Daniel A. Nonen:
Superfiniteness of Query Answers in Deductive Databases: An Automata-Theoretic Approach. FSTTCS 1992: 176-190

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.