"Satisfiability algorithms for conjunctive queries over trees."

James Cheney (2011)

> Home

Details and statistics

DOI: 10.1145/1938551.1938572

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icdt/Cheney11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdt/Cheney11
James Cheney:
Satisfiability algorithms for conjunctive queries over trees. ICDT 2011: 150-161

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.