All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

First-Order Context-Specific Likelihood Weighting in Hybrid Probabilistic Logic Programs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00367150" target="_blank" >RIV/68407700:21230/23:00367150 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1613/jair.1.13657" target="_blank" >https://doi.org/10.1613/jair.1.13657</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1613/jair.1.13657" target="_blank" >10.1613/jair.1.13657</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    First-Order Context-Specific Likelihood Weighting in Hybrid Probabilistic Logic Programs

  • Original language description

    Statistical relational AI and probabilistic logic programming have so far mostly focused on discrete probabilistic models. The reasons for this is that one needs to provide constructs to succinctly model the independencies in such models, and also provide efficient inference. Three types of independencies are important to represent and exploit for scalable inference in hybrid models: conditional independencies elegantly modeled in Bayesian networks, context-specific independencies naturally represented by logical rules, and independencies amongst attributes of related objects in relational models succinctly expressed by combining rules. This paper introduces a hybrid probabilistic logic programming language, DC#, which integrates distributional clauses’ syntax and semantics principles of Bayesian logic programs. It represents the three types of independencies qualitatively. More importantly, we also introduce the scalable inference algorithm FO-CS-LW for DC#. FO-CS-LW is a first-order extension of the context-specific likelihood weighting algorithm (CS-LW), a novel sampling method that exploits conditional independencies and context-specific independencies in ground models. The FO-CS-LW algorithm upgrades CS-LW with unification and combining rules to the first-order case.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2023

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Journal of Artificial Intelligence Research

  • ISSN

    1076-9757

  • e-ISSN

    1943-5037

  • Volume of the periodical

    77

  • Issue of the periodical within the volume

    June

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    53

  • Pages from-to

    683-735

  • UT code for WoS article

    001025753500002

  • EID of the result in the Scopus database

    2-s2.0-85165174856