Compressing probabilistic Prolog programs (Q1009237): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3510469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Horn abduction and Bayesian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4533365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4514012 / rank
 
Normal rank

Latest revision as of 11:06, 1 July 2024

scientific article
Language Label Description Also known as
English
Compressing probabilistic Prolog programs
scientific article

    Statements

    Compressing probabilistic Prolog programs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    probabilistic logic
    0 references
    inductive logic programming
    0 references
    theory revision
    0 references
    compression
    0 references
    network mining
    0 references
    biological applications
    0 references
    statistical relational learning
    0 references
    0 references