The following pages link to (Q4411948):
Displayed 9 items.
- Tree tuple languages from the logic programming point of view (Q877842) (← links)
- Deciding \(\mathcal H_1\) by resolution (Q1041797) (← links)
- Extending \(H_1\)-clauses with disequalities (Q1944188) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses (Q2914718) (← links)
- Normalization of Linear Horn Clauses (Q2999324) (← links)
- Paths, tree homomorphisms and disequalities for -clauses (Q4961723) (← links)
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas (Q5433256) (← links)