paper-with-me

Papers

Imparo is complete by inverse subsumption

2014-07-14 · David Toth

In Inverse subsumption for complete explanatory induction Yamamoto et al. investigate which inductive logic programming systems can learn a correct hypothesis $H$ by using the inverse subsumption instead of inverse entailment. We prove that inductive logic programming system Imparo is complete by inverse subsumption for learning a correct definite hypothesis $H$ wrt the definite background theory $B$ and ground atomic examples $E$, by establishing that there exists a connected theory $T$ for $B$ and $E$ such that $H$ subsumes $T$.

📄 PDF Abstract BibTeX arXiv:1407.3836

Code (0)

등록된 구현이 없습니다.

Tasks

Inductive logic programming

Similar Papers 제목 키워드 기반

NeurOWL: An LLM-Based Neural-symbolic Framework for Incomplete OWL Ontology Reasoning

2026-07-17 · Hui Yang, Jiaoyan Chen, Yiping Song, Renate Schmidt 외 arxiv

OWL ontologies provide a formal knowledge representation framework that enables semantic reasoning, and have been widely adopted across domains such as healthcare and bioinformatics. In practice, however, real-world onto…

Consequence-based Reasoning for Description Logics with Disjunction, Inverse Roles, Number Restrictions, and Nominals

2018-05-03 · David Tena Cucala, Bernardo Cuenca Grau, Ian Horrocks

We present a consequence-based calculus for concept subsumption and classification in the description logic ALCHOIQ, which extends ALC with role hierarchies, inverse roles, number restrictions, and nominals. By using sta…

AllGeneral Classification

Theoretical Foundations of Defeasible Description Logics

2019-04-16 · Katarina Britz, Giovanni Casini, Thomas Meyer, Kody Moodley 외

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in …

Fuzzy order-sorted feature logic

2023-07-27 · Gian Carlo Milanese, Gabriella Pasi

Order-Sorted Feature (OSF) logic is a knowledge representation and reasoning language based on function-denoting feature symbols and set-denoting sort symbols ordered in a subsumption lattice. OSF logic allows the constr…

Relation

Extending Term Subsumption systems for Uncertainty Management

2013-03-27 · John Yen, Piero P. Bonissone

A major difficulty in developing and maintaining very large knowledge bases originates from the variety of forms in which knowledge is made available to the KB builder. The objective of this research is to bring together…

Management