Add to ORKGWe present a framework for theory refinement operators fulfilling some desirable properties in order to ensure the efficiency and effectiveness of the process. A refinement operator satisfying these requirements is defined ideal. In other frameworks, the search for refinements takes place in spaces ordered by the logical implication or the theta-subsumption relationships. Results have demonstrated the impossibility of defining ideal operators in these search spaces. We show that, by assuming the object identity bias over a clausal representation, we are able to define them in the resulting search space
In this paper I begin with a recent challenge to the Semantic Approach and identify an underlying as...
The adoption of the object identity bias for weakening implication has lead to the definition of OI-...
Refinement operators are exploited to change in an automated way incorrect clauses of a logic progr...
We present a framework for theory refinement operators fulfilling some desirable properties in order...
A framework for theory refinement is presented pursuing the efficiency and effectiveness of learning...
Refinement operators for theories avoid the problems related to the myopia of many relational learni...
We present a framework for theory refinement operators ful- filling properties that ensure the effic...
In the context of frequent pattern discovery, we present a generality relation, called thetaOI-subs...
Weakening implication by assuming the object identity bias allows for both a model-theoretical and a...
Abstract—In this paper, we show that by using extensions of the Well-Founded Semantics (WFS) which w...
In model inference, refinement operators are exploited to change in an automated way incorrect claus...
We introduce a new sheaf-theoretic construction called the ideal completion of a category and invest...
textabstractInductive learning models [Plotkin 1971; Shapiro 1981] often use a search space of claus...
We extend the notion of an ‘‘ideal’’ from regular pointed categories to regular multi-pointed categ...
AbstractWithin Inductive Logic Programming, refinement operators compute a set of specializations or...
In this paper I begin with a recent challenge to the Semantic Approach and identify an underlying as...
The adoption of the object identity bias for weakening implication has lead to the definition of OI-...
Refinement operators are exploited to change in an automated way incorrect clauses of a logic progr...
We present a framework for theory refinement operators fulfilling some desirable properties in order...
A framework for theory refinement is presented pursuing the efficiency and effectiveness of learning...
Refinement operators for theories avoid the problems related to the myopia of many relational learni...
We present a framework for theory refinement operators ful- filling properties that ensure the effic...
In the context of frequent pattern discovery, we present a generality relation, called thetaOI-subs...
Weakening implication by assuming the object identity bias allows for both a model-theoretical and a...
Abstract—In this paper, we show that by using extensions of the Well-Founded Semantics (WFS) which w...
In model inference, refinement operators are exploited to change in an automated way incorrect claus...
We introduce a new sheaf-theoretic construction called the ideal completion of a category and invest...
textabstractInductive learning models [Plotkin 1971; Shapiro 1981] often use a search space of claus...
We extend the notion of an ‘‘ideal’’ from regular pointed categories to regular multi-pointed categ...
AbstractWithin Inductive Logic Programming, refinement operators compute a set of specializations or...
In this paper I begin with a recent challenge to the Semantic Approach and identify an underlying as...
The adoption of the object identity bias for weakening implication has lead to the definition of OI-...
Refinement operators are exploited to change in an automated way incorrect clauses of a logic progr...