The following pages link to (Q4264105):
Displaying 9 items.
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Deciding implication for functional dependencies in complex-value databases (Q860838) (← links)
- An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets (Q2369012) (← links)
- Metalevel Algorithms for Variant Satisfiability (Q2827841) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- (Q5087786) (← links)
- (Q5309512) (← links)
- Constructive negation and constraint logic programming with sets (Q5945160) (← links)