Towards learning non-recursive LPADs by transforming them into Bayesian networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4455 LNAI, Issue , 2007, Pages 94-108

  Blockeel, Hendrik ^a   Meert, Wannes ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; CLASSIFICATION (OF INFORMATION); KNOWLEDGE REPRESENTATION; LEARNING ALGORITHMS; PROBABILISTIC LOGICS;

FINITE HERBRAND UNIVERSE; LOGIC PROGRAMS WITH ANNOTATED DISJUNCTIONS (LPAD);

LOGIC PROGRAMMING;

EID: 38049150636     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73847-3_16     Document Type: Conference Paper

References (5)

1. Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
2. Neapolitan, R.: Learning Bayesian Networks. Prentice Hall, Upper Saddle River, NJ, USA (2003)
3. Riguzzi, F.: Learning logic programs with annotated disjunctions. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol. 3194, pp. 270-287. Springer, Heidelberg (2004)
4. Vennekens, J., Denecker, M., Bruynooghe, M.: Extending the role of causality in probabilistic modeling. In: Proceedings of the 11th International Workshop on Nonmonotonic Reasoning, pp. 183-190 (2006)
5. Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 431-445. Springer, Heidelberg (2004)