The following pages link to Subsumption and implication (Q1094152):
Displaying 15 items.
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications (Q497185) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- 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)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- Complexity parameters for first order classes (Q2433181) (← links)
- Prediction-hardness of acyclic conjunctive queries (Q2581365) (← links)
- The subsumption lattice and query learning (Q2581757) (← links)
- Toward logical analysis of tabular rule-based systems (Q2738998) (← links)
- A Model to Study Phase Transition and Plateaus in Relational Learning (Q3543267) (← links)
- (Q4027624) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705918) (← links)
- Learning logic programs with structured background knowledge (Q5941133) (← links)
