Works matching DE "SATISFIABILITY (Computer science)"


Results: 219
    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29

    Two decision problems in Contact Logics.

    Published in:
    Logic Journal of the IGPL, 2019, v. 27, n. 1, p. 8, doi. 10.1093/jigpal/jzy016
    By:
    • Balbiani, Philippe;
    • Gencer, Çiğdem;
    • Özdemir, Zafer
    Publication type:
    Article
    30
    31
    32
    33
    34
    35
    36
    37
    38

    ON THE COMPLEXITY OF (RESTRICTED) ALCIr.

    Published in:
    Publications de l'Institut Mathématique, 2014, v. 95, n. 109, p. 133, doi. 10.2298/PIM1409133M
    By:
    • Mosurović, Milenko;
    • Zakharyaschev, Michael
    Publication type:
    Article
    39
    40
    41
    42

    On Super Strong ETH.

    Published in:
    Journal of Artificial Intelligence Research, 2021, v. 70, p. 473, doi. 10.1613/jair.1.11859
    By:
    • Vyas, Nikhil;
    • Williams, Ryan
    Publication type:
    Article
    43
    44

    Variable Elimination in Binary CSPs.

    Published in:
    Journal of Artificial Intelligence Research, 2019, v. 66, p. 589, doi. 10.1613/jair.1.11295
    By:
    • Cooper, Martin C.;
    • El Mouelhi, Achref;
    • Terrioux, Cyril
    Publication type:
    Article
    45

    Community Structure in Industrial SAT Instances.

    Published in:
    Journal of Artificial Intelligence Research, 2019, v. 66, p. 443, doi. 10.1613/jair.1.11741
    By:
    • Ansótegui, Carlos;
    • Bonet, Maria Luisa;
    • Giráldez-Cru, Jesús;
    • Levy, Jordi;
    • Simon, Laurent
    Publication type:
    Article
    46
    47
    48
    49
    50