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”

Filtering Isomorphic Models by Invariants

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F21%3A00353759" target="_blank" >RIV/68407700:21730/21:00353759 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.4230/LIPIcs.CP.2021.4" target="_blank" >https://doi.org/10.4230/LIPIcs.CP.2021.4</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4230/LIPIcs.CP.2021.4" target="_blank" >10.4230/LIPIcs.CP.2021.4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Filtering Isomorphic Models by Invariants

  • Original language description

    The enumeration of finite models of first order logic formulas is an indispensable tool in computational algebra. The task is hindered by the existence of isomorphic models, which are of no use to mathematicians and therefore are typically filtered out a posteriori. This paper proposes a divide and-conquer approach to speed up and parallelize this process. We design a series of invariant properties that enable us to partition existing models into mutually non-isomorphic blocks, which are then tackled separately. The presented approach is integrated into the popular tool Mace4, where it shows tremendous speed-ups for a variety of algebraic structures.

  • 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

    <a href="/en/project/LL1902" target="_blank" >LL1902: Powering SMT Solvers by Machine Learning</a><br>

  • Continuities

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

Others

  • Publication year

    2021

  • 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

    27th International Conference on Principles and Practice of Constraint Programming (CP 2021)

  • ISBN

    978-3-95977-211-2

  • ISSN

  • e-ISSN

    1868-8969

  • Number of pages

    9

  • Pages from-to

    1-9

  • Publisher name

    Dagstuhl Publishing,

  • Place of publication

    Saarbrücken

  • Event location

    Montpellier

  • Event date

    Oct 25, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article