"Effectively-Propositional Reasoning about Reachability in Linked Data ..."

Shachar Itzhaky et al. (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-39799-8_53

access: open

type: Conference or Workshop Paper

metadata version: 2018-10-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/cav/ItzhakyBINS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cav/ItzhakyBINS13
Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv:
Effectively-Propositional Reasoning about Reachability in Linked Data Structures. CAV 2013: 756-772

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.