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”

Counting and Sampling Models in First-Order Logic

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://doi.org/10.24963/ijcai.2023/801" target="_blank" >https://doi.org/10.24963/ijcai.2023/801</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.24963/ijcai.2023/801" target="_blank" >10.24963/ijcai.2023/801</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Counting and Sampling Models in First-Order Logic

  • Original language description

    First-order model counting (FOMC) is the task of counting models of a first-order logic sentence over a given set of domain elements. Its weighted variant, WFOMC, generalizes FOMC by assigning weights to the models and has many applications in statistical relational learning. More than ten years of research by various authors has led to identification of non-trivial classes of WFOMC problems that can be solved in time polynomial in the number of domain elements. In this paper, we describe recent works on WFOMC and the related problem of weighted first-order model sampling (WFOMS). We also discuss possible applications of WFOMC and WFOMS within statistical relational learning and beyond, e.g., automated solving of problems from enumerative combinatorics and elementary probability theory. Finally, we mention research problems that still need to be tackled in order to make applications of these methods really practical more broadly.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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

  • Article name in the collection

    Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence

  • ISBN

    978-1-956792-03-4

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    7020-7025

  • Publisher name

    International Joint Conferences on Artificial Intelligence Organization

  • Place of publication

  • Event location

    Macao

  • Event date

    Aug 19, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article