SHACL Satisfiability and Containment.
Paolo ParetiGeorge KonstantinidisFabio MogaveroTimothy J. NormanPublished in: ISWC (1) (2020)
Keyphrases
- satisfiability problem
- automata theoretic
- np complete
- conjunctive queries
- phase transition
- sat problem
- propositional logic
- decision procedures
- quantified boolean formulas
- query optimization
- terminological reasoning
- containment of conjunctive queries
- satisfiability testing
- temporal logic
- computational complexity
- neural network
- regular path queries
- symmetry breaking
- cnf formula
- computational properties
- transitive closure
- tree patterns
- genetic algorithm
- data sets