Subsumption and implication
From MaRDI portal
Publication:1094152
DOI10.1016/0020-0190(87)90103-7zbMath0629.68091OpenAlexW1989242777WikidataQ59259785 ScholiaQ59259785MaRDI QIDQ1094152
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90103-7
Related Items
Implication of clauses is undecidable, On the complexity of single-rule datalog queries., Toward logical analysis of tabular rule-based systems, Complexity parameters for first order classes, A Model to Study Phase Transition and Plateaus in Relational Learning, Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications, Removing redundancy from a clause, Learning logic programs with structured background knowledge, On the complexity of entailment in existential conjunctive first-order logic with atomic negation, Prediction-hardness of acyclic conjunctive queries, The subsumption lattice and query learning, An efficient subsumption test pipeline for BS(LRA) clauses, Thue trees
Cites Work
