Abstraction in Artificial Intelligence and Complex Systems
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?
The approach supports a form of abstraction which goes beyond typical first-order predicate invention in that the use of higher-order definitions combined with meta-interpretation drives both the search for a hypothesis and predicate invention, leading to more accurate and compact programs.
“This approach supports a form of abstraction which goes beyond typical first-order predicate invention (Saitta and Zucker 2013) in that the use of higher-order definitions combined with meta-interpretation drives both the search for a hypothesis and predicate invention, leading to more accurate and compact programs.”
From Learning higher-order logic programs (2020) · cites this paper as Saitta and Zucker 2013
Cites
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593 · cited 1× · see citing works
“Finally we should mention that when the feature to discretize is either time or space (the term aggregation is also used), dedicated approaches have been developed [8, 575].”
Method
Flagged first, then by citations
Cited by
Sorted by citations
Learning higher-order logic programs
Cropper, A., Morel, R., & Muggleton, S. (2020) · Machine Learning · doi:10.1007/s10994-019-05862-7 · Cited by 11 · see citing works
- Authors
- Saitta, L., & Zucker, J.-D.
- ORCID
- Zucker, Jean-Daniel
- Venue
- Springer eBooks
- Publisher
- Springer New York
- Published
- 2013
- OpenAlex
- W2338661386
- Cited by
- 65
- References
- 1
- Citations by year
- 2026: 1 · 2025: 5 · 2024: 1 · 2023: 3 · 2022: 3 · 2021: 7 · 2020: 6 · 2019: 6 · 2018: 7 · 2017: 9 · 2016: 4 · 2015: 6 · 2014: 5 · 2013: 2
- Type
- conference abstract
- Language
- en
- Open access
- closed
- Licence
- Locations
- Springer eBooks (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cognitive Computing and Networks
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Artificial Intelligence › Mathematical Control Systems and Analysis
- Keywords
- abstraction, artificial intelligence, complex systems, knowledge representation, reasoning, learning, perception
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
