Satisfiability for SCULPT-schemas for CSV-like data

DOI10.4230/LIPICS.ICDT.2018.14MaRDI QIDQ3305360zbMATH OpenFDO

Authors Johannes Doleschal, Wim Martens, Frank Neven, Adam Witkowski

Publication date 6 August 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2018.14

zbMATH Keywords

CSVschema languagessemi-structured data

Mathematics Subject Classification ID

Internet topics (68M11) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Testing XML constraint satisfiability
• Complexity of the satisfiability problem for a class of propositional schemata
• Conjunctive query containment over trees using schema information
• On the satisfiability problem for SPARQL patterns
• XPath satisfiability in the presence of DTDs

Cites work

• A lower bound technique for the size of nondeterministic finite automata
• scientific article; zbMATH DE number 1048047 (Why is no real title available?)
• Optimal embedding of complete binary trees into lines and grids
• PDL with intersection and converse: satisfiability and infinite-state model checking
• Propositional dynamic logic of regular programs
• Querying Graphs with Data
• Unit-length embedding of binary trees on a square grid

Cited in

(1)

• From Tessellations to Table Interpretation

This page was built for publication: Satisfiability for SCULPT-schemas for CSV-like data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305360)