A Bounded Search Space of Clausal Theories
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Midelfart (1999) extends subsumption to clausal theories.
“Midelfart (1999) extends subsumption to clausal theories:”
From Learning programs by learning from failures (2021) · cites this paper as Midelfart (1999)
Cites
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411 · see citing works
Foundations of Inductive Logic Programming
Nienhuys-Cheng, S.-H., & Wolf, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62927-0 · Cited by 471 · see citing works
Automatic Methods of Inductive Inference
Plotkin, G. D. (1972) · ERA · Cited by 170 · see citing works
Learning acyclic first-order horn sentences from entailment
Arimura, H. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63577-7_59 · Cited by 46 · see citing works
Existence and nonexistence of complete refinement operators
van der Laag, P. R. J., & Nienhuys-Cheng, S.-H. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57868-4_66 · Cited by 34 · see citing works
Learning from Entailment of Logic Programs with Local Variables
Rao, M. R. K. K., & Sattar, A. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49730-7_11 · Cited by 21 · see citing works
Muggleton, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027328 · Cited by 19 · see citing works
Flagged first, then by citations
2 of the 9 references couldn’t be matched to a known paper.
Cited by
Sorted by citations
Learning programs by learning from failures
Cropper, A., & Morel, R. (2021) · Machine Learning · doi:10.1007/s10994-020-05934-z · Cited by 86 · see citing works
“Midelfart (1999) extends subsumption to clausal theories: Definition 16 (Theory subsumption) A clausal theory T1 subsumes a clausal theory T2, denoted T1 T2, if and only if ∀C2 ∈ T2, ∃C1 ∈ T1 such that C1 subsumes C2.”
BackgroundA Refinement Operator for Theories
Badea, L. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44797-0_1 · Cited by 10 · see citing works
Knowledge discovery from cDNA microarrays and a priori knowledge
Midelfart, H. (2003) · BIBSYS Brage (BIBSYS (Norway)) · Cited by 6 · see citing works
Self-citationTowards a Logical Reconstruction of CF-Induction
Yamamoto, Y., Ray, O., & Inoue, K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78197-4_31 · Cited by 5 · see citing works
DNF Hypotheses in Explanatory Induction
Inoue, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31951-8_18 · Cited by 5 · see citing works
Spaces of theories with ideal refinement operators
Fanizzi, N., Ferilli, S., Mauro, N. D., & Basile, T. M. A. (2003) · Cited by 5 · see citing works
Learning logic programs by explaining their failures
Morel, R., & Cropper, A. (2023) · Machine Learning · doi:10.1007/s10994-023-06358-1 · Cited by 4 · see citing works
Hypothesis finding with proof theoretical appropriateness criteria
Fronhöfer, B., & Yamamoto, A. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.10.020 · Cited by 3 · see citing works
Minimised Residue Hypotheses in Relevant Logic
Fronhöfer, B., & Yamamoto, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36169-3_23 · Cited by 2 · see citing works
On the formal characterization of the FORTE_MBC theory revision operators
Duboc, A. L., Paes, A., & Zaverucha, G. (2017) · Journal of Logic and Computation · doi:10.1093/logcom/exx015 · Cited by 1 · see citing works
Research on logic and computation in hypothesis finding
Yamamoto, Y. (2010) · SOKENDAI (Graduate University for Advanced Studies) · Cited by 1 · see citing works
Learning Logic Programs by Explaining Failures.Preprint
Morel, R., & Cropper, A. (2021) · arXiv (Cornell University)
- Authors
- Midelfart, H.
- Affiliations
- Norwegian University of Science and Technology (NO)
- Corresponding author
- Midelfart, Herman
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 210-221
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1491793019
- Cited by
- 12
- References
- 9
- Citations by year
- 2023: 1 · 2021: 2 · 2017: 1 · 2012: 1
- FWCI
- 0.56
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Keywords
- inductive logic programming, search space, refinement operators
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
