![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter
Logic-Based Explainable and Incremental Machine Learning
Mainstream machine learning methods lack interpretability, explainability, incrementality, and data-economy. We propose using logic programming to rectify these problems. We discuss the FOLD family of rule-based ...
-
Chapter
Prolog: Past, Present, and Future
We argue that various extensions proposed for Prolog—tabling, constraints, parallelism, coroutining, etc.—must be integrated seamlessly in a single system. We also discuss how goal-directed predicate answer se...
-
Chapter and Conference Paper
Whitebox Induction of Default Rules Using High-Utility Itemset Mining
We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (...
-
Chapter and Conference Paper
AQuA: ASP-Based Visual Question Answering
AQuA (ASP-based Question Answering) is an Answer Set Programming (ASP) based visual question answering framework that truly “understands” an input picture and answers natural language questions about that picture...