Lidé

Ing. Jan Tóth

Všechny publikace

Lifted Inference with Linear Order Axiom

  • Autoři: Ing. Jan Tóth, Ing. Ondřej Kuželka, Ph.D.,
  • Publikace: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Menlo Park: AAAI Press, 2023. p. 12295-12304. vol. 37. ISSN 2374-3468. ISBN 978-1-57735-880-0.
  • Rok: 2023
  • DOI: 10.1609/aaai.v37i10.26449
  • Odkaz: https://doi.org/10.1609/aaai.v37i10.26449
  • Pracoviště: Katedra počítačů, Intelligent Data Analysis
  • Anotace:
    We consider the task of weighted first-order model counting (WFOMC) used for probabilistic inference in the area of statistical relational learning. Given a formula φ, domain size n and a pair of weight functions, what is the weighted sum of all models of φ over a domain of size n? It was shown that computing WFOMC of any logical sentence with at most two logical variables can be done in time polynomial in n. However, it was also shown that the task is #P1-complete once we add the third variable, which inspired the search for extensions of the two-variable fragment that would still permit a running time polynomial in n. One of such extension is the two-variable fragment with counting quantifiers. In this paper, we prove that adding a linear order axiom (which forces one of the predicates in φ to introduce a linear ordering of the domain elements in each model of φ) on top of the counting quantifiers still permits a computation time polynomial in the domain size. We present a new dynamic programming-based algorithm which can compute WFOMC with linear order in time polynomial in n, thus proving our primary claim.

On Discovering Interesting Combinatorial Integer Sequences

  • Autoři: Svatoš, M., Ing. Peter Jung, Ing. Jan Tóth, Wang, Y., Ing. Ondřej Kuželka, Ph.D.,
  • Publikace: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2023. p. 3338-3346. ISBN 978-1-956792-03-4.
  • Rok: 2023
  • DOI: 10.24963/ijcai.2023/372
  • Odkaz: https://doi.org/10.24963/ijcai.2023/372
  • Pracoviště: Katedra počítačů, Intelligent Data Analysis
  • Anotace:
    We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial objects, e.g., undirected graphs, permutations, matchings etc. In the second step, we use algorithms for lifted first-order model counting to generate integer sequences that count the objects encoded by the first-order logic formulas generated in the first step. For instance, if the first-order sentence defines permutations then the generated integer sequence is the sequence of factorial numbers n!. We demonstrate that our approach is able to generate interesting new sequences by showing that a non-negligible fraction of the automatically generated sequences can actually be found in the Online Encyclopaedia of Integer Sequences (OEIS) while generating many other similar sequences which are not present in OEIS and which are potentially interesting. A key technical contribution of our work is the method for generation of first-order logic sentences which is able to drastically prune the space of sentences by discarding large fraction of sentences which would lead to redundant integer sequences.

Za stránku zodpovídá: Ing. Mgr. Radovan Suk