"Logical definability and query languages over ranked and unranked trees."

Michael Benedikt, Leonid Libkin, Frank Neven (2007)

> Home

Details and statistics

DOI: 10.1145/1227839.1227843

access: closed

type: Journal Article

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tocl/BenediktLN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/BenediktLN07
Michael Benedikt, Leonid Libkin, Frank Neven:
Logical definability and query languages over ranked and unranked trees. ACM Trans. Comput. Log. 8(2): 11 (2007)

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.