Satisfiability and Containment of Recursive SHACL.
Paolo ParetiGeorge KonstantinidisFabio MogaveroPublished in: CoRR (2021)
Keyphrases
- satisfiability problem
- computational complexity
- propositional logic
- conjunctive queries
- automata theoretic
- decision procedures
- datalog programs
- regular path queries
- np complete
- query optimization
- terminological reasoning
- sat problem
- theorem proving
- query language
- boolean formula
- special case
- conjunctive normal form
- quantified boolean formulas
- containment of conjunctive queries
- data model
- database