The following pages link to Michaël Thomazo (Q714499):
Displayed 10 items.
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation (Q714500) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- On the height of towers of subsequences and prefixes (Q2272979) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- On the Complexity of k-Piecewise Testability and the Depth of Automata (Q3451116) (← links)
- (Q4608624) (← links)
- A Single Approach to Decide Chase Termination on Linear Existential Rules (Q5091131) (← links)
- What Is a Reasonable Argumentation Semantics? (Q5172623) (← links)
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules (Q5268431) (← links)
- (Q5283050) (← links)