Pages that link to "Item:Q5012557"

The following pages link to The Exact Complexity of the First-Order Logic Definability Problem (Q5012557):

Displaying 3 items.

• Logical separability of labeled data examples under ontologies (Q2093388) (← links)
• Deciding quantifier-free definability in finite algebraic structures (Q2219074) (← links)
• Regularizing conjunctive features for classification (Q2662672) (← links)