The following pages link to Gerson Zaverucha (Q1959494):
Displayed 17 items.
- Using the bottom clause and mode declarations in FOL theory revision from examples (Q1959495) (← links)
- Revising the structure of Bayesian network classifiers in the presence of missing data (Q2195473) (← links)
- Transfer learning by mapping and revising boosted relational dependency networks (Q2203326) (← links)
- On the use of stochastic local search techniques to revise first-order logic theories from examples (Q2361575) (← links)
- Online probabilistic theory revision from examples with ProPPR (Q2425252) (← links)
- Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples (Q3543271) (← links)
- Relevant logic as a basis for paraconsistent epistemic logics (Q4275693) (← links)
- (Q4413494) (← links)
- (Q4437995) (← links)
- (Q4467038) (← links)
- On the formal characterization of the FORTE_MBC theory revision operators (Q4555456) (← links)
- (Q4796144) (← links)
- Advances in Artificial Intelligence – SBIA 2004 (Q5311217) (← links)
- Inductive Logic Programming (Q5394652) (← links)
- Relational Knowledge Extraction from Attribute-Value Learners (Q5398106) (← links)
- ILP Through Propositionalization and Stochastic k-Term DNF Learning (Q5426063) (← links)
- Revising First-Order Logic Theories from Examples Through Stochastic Local Search (Q5452092) (← links)