169 search results - page 3 / 34 » Learning Languages from Positive Data and Negative Counterex... |
97
Voted
EXACT
2007
15 years 2 months ago
2007
Given a model and a property expressed in temporal logic, a model checker normally produces a counterexample in case the model does not satisfy the property. This counterexample i...
126
Voted
ECML
1998
Springer
15 years 4 months ago
1998
Springer
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
115
click to vote
ICGI
2010
Springer
15 years 1 months ago
2010
Springer
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
TCS
2008
15 years 9 days ago
2008
124
click to vote
KDD
2008
ACM
16 years 24 days ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...