The following pages link to (Q4230359):
Displaying 10 items.
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation (Q714500) (← links)
- Implication of clauses is undecidable (Q1110493) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- Thue trees (Q1861534) (← links)
- Top program construction and reduction for polynomial time meta-interpretive learning (Q2051277) (← links)
- Logical reduction of metarules (Q2203321) (← links)
- Entailment is undecidable for symbolic heap separation logic formulæ with non-established inductive rules (Q2234797) (← links)
- Satisfiability of the smallest binary program (Q2366070) (← links)
- The undecidability of entailment and relevant implication (Q3703869) (← links)
- Primal grammars and unification modulo a binary clause (Q5210779) (← links)