Induction from answer sets in nonmonotonic logic programs
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Inductive logic programming (ILP) realizes inductive machine learning in computational logic. However, the present ILP mostly handles classical clausal programs, especially Horn logic programs, and has limited applications to learning nonmonotonic logic programs . This article studies a method for realizing induction in nonmonotonic logic programs. We consider an extended logic program as a background theory, and introduce techniques for inducing new rules using answer sets of the program. The produced new rules explain positive/negative examples in the context of inductive logic programming. The proposed methods extend the present ILP techniques to a syntactically and semantically richer framework, and contribute to a theory of nonmonotonic ILP.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
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
Machine Invention of First-order Predicates by Inverting Resolution
MUGGLETON, S., & BUNTINE, W. (1988) · Machine Learning Proceedings 1988 · doi:10.1016/b978-0-934613-64-4.50040-2 · Cited by 436
Otero, R. P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44797-0_16 · Cited by 27
Cited by
Incremental learning of event definitions with Inductive Logic Programming
Katzouris, N., Artikis, A., & Paliouras, G. (2015) · Machine Learning · doi:10.1007/s10994-015-5512-1 · Cited by 62
Learning Through Hypothesis Refinement Using Answer Set Programming
Athakravi, D., Corapi, D., Broda, K., & Russo, A. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44923-3_3 · Cited by 25
Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME
Shakerin, F., & Gupta, G. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013052 · Cited by 17
Iterative Learning of Answer Set Programs from Context Dependent Examples
LAW, M., RUSSO, A., & BRODA, K. (2016) · Theory and Practice of Logic Programming · doi:10.1017/s1471068416000351 · Cited by 8
Metadata
- Authors
- Sakama, C.
- Venue
- ACM Transactions on Computational Logic
- Published
- 2005-04
- Volume
- 6
- Issue
- 2
- Pages
- 203-231
- ISSN
- 1529-3785 (ISSN-L)
- 1557-945X
- OpenAlex
- W2149404336
- Cited by
- 55
- References
- 5
- FWCI
- 4.12
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.