Zobrazeno 1 - 10
of 348
pro vyhledávání: '"Unit propagation"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Advancements in SAT solving algorithms with heuristics and more sophisticated inferring techniques have allowed a wide array of real world applications for SAT solvers to prosper. In this work, an All-SAT solver based on the DPLL algorithm has been d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1404::041823f6d649460298742353ba371bb3
https://ddd.uab.cat/record/272821
https://ddd.uab.cat/record/272821
Publikováno v:
Software and Systems Modeling, 21
Automatically synthesizing consistent models is a key prerequisite for many testing scenarios in autonomous driving to ensure a designated coverage of critical corner cases. An inconsistent model is irrelevant as a test case (e.g., false positive); t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e124ada2ec863052a313ab4dcc56b7e
https://doi.org/10.1007/s10270-021-00918-6
https://doi.org/10.1007/s10270-021-00918-6
Autor:
Petr Savický, Petr Kučera
Publikováno v:
Journal of Artificial Intelligence Research. 69:1395-1420
In this paper we investigate CNF formulas, for which the unit propagation is strong enough to derive a contradiction if the formula together with a partial assignment of the variables is unsatisfiable (unit refutation complete or URC formulas) or add
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bf2ffe27dacbe05d34b0a7e13b9baee
https://doi.org/10.1613/jair.1.12006
https://doi.org/10.1613/jair.1.12006
Autor:
Ilgweon Kang, Daeyeal Lee, Sicun Gao, Chester Holtz, Dong-won Park, Chung-Kuan Cheng, Bill Lin
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39:5097-5110
Pin accessibility encounters nontrivial challenges due to the smaller number of routing tracks, higher pin density, and more complex design rules. Consequently, securing design rule-correct routability has become a critical bottleneck for sub-10-nm I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::084565e0f00330aaa5c1fc9cd3d467a1
https://doi.org/10.1109/tcad.2020.2977066
https://doi.org/10.1109/tcad.2020.2977066
Publikováno v:
Constraints. 25:251-279
SAT solvers are nowadays used in many applications where the UNSAT result has a special meaning that is at time critical. SAT instances sometimes exhibit symmetries which can be exploited to produce short proofs that would have been exponential for r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2641c468195a99445ffe6e475c4dd547
https://doi.org/10.1007/s10601-020-09313-2
https://doi.org/10.1007/s10601-020-09313-2
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21)
Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21), Aug 2021, Montreal-themed Virtual Reality, Canada
Artificial Intelligence
Artificial Intelligence, Elsevier, 2020, 289, pp.103397. ⟨10.1016/j.artint.2020.103397⟩
Artificial Intelligence, 2020, 289, pp.103397. ⟨10.1016/j.artint.2020.103397⟩
Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21), Aug 2021, Montreal-themed Virtual Reality, Canada
Artificial Intelligence
Artificial Intelligence, Elsevier, 2020, 289, pp.103397. ⟨10.1016/j.artint.2020.103397⟩
Artificial Intelligence, 2020, 289, pp.103397. ⟨10.1016/j.artint.2020.103397⟩
A typical Branch and Bound algorithm for Max-SAT computes the lower bound by estimating the number of disjoint Inconsistent Subsets (IS) of the formula. The IS detection is ensured by Simulated Unit Propagation (SUP). Then, the inference rule for Max
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::482287ccafdd2d69dbd0318cb0a0d885
https://hal-amu.archives-ouvertes.fr/hal-03334479/document
https://hal-amu.archives-ouvertes.fr/hal-03334479/document
Publikováno v:
SCIENTIA SINICA Informationis. 49:685-697
Partial MaxSAT (PMS) is a generalized version of the maximum satisfiability problem (MaxSAT), which has important applications in many fields. At present, the PMS algorithm requires improvements in solving the industrial problems. Based on deep resea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fc8dbb45b09bf4f04d922429c4034dd
https://doi.org/10.1360/n112017-00248
https://doi.org/10.1360/n112017-00248
Publikováno v:
Ocean Engineering. 175:138-148
Marine forest artificial reefs (MFARs) have been used in relatively shallow seawaters to provide light intensity and firm, stable substrates for seaweeds. Their design should be oriented to enlarge surface areas with relatively small reef sizes and t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b134255b62430b58e71e57b45610e166
https://doi.org/10.1016/j.oceaneng.2019.02.020
https://doi.org/10.1016/j.oceaneng.2019.02.020