Zobrazeno 1 - 10
of 1 726
pro vyhledávání: '"DPLL algorithm"'
We build a SAT solver implementing the DPLL algorithm in the verification-enabled programming language Dafny. The resulting solver is fully verified (soundness, completeness and termination are computer checked). We benchmark our Dafny solver and we
Externí odkaz:
http://arxiv.org/abs/2007.10842
Publikováno v:
EPTCS 303, 2019, pp. 3-15
Modern high-performance SAT solvers quickly solve large satisfiability instances that occur in practice. If the instance is satisfiable, then the SAT solver can provide a witness which can be checked independently in the form of a satisfying truth as
Externí odkaz:
http://arxiv.org/abs/1909.01743
Autor:
Andrici, Cezar-Constantin1 (AUTHOR) cezar.andrici@mpi-sp.org, Ciobâcă, Ștefan2 (AUTHOR) stefan.ciobaca@uaic.ro
Publikováno v:
Mathematics (2227-7390). Jul2022, Vol. 10 Issue 13, p2264-N.PAG. 26p.
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 303, Iss Proc. FROM 2019, Pp 3-15 (2019)
Modern high-performance SAT solvers quickly solve large satisfiability instances that occur in practice. If the instance is satisfiable, then the SAT solver can provide a witness which can be checked independently in the form of a satisfying truth as
Externí odkaz:
https://doaj.org/article/1c7608ab7f094101a0444ce6c7dc87df
Publikováno v:
Mathematics, Vol 10, Iss 13, p 2264 (2022)
We present a DPLL SAT solver, which we call TrueSAT, developed in the verification-enabled programming language Dafny. We have fully verified the functional correctness of our solver by constructing machine-checked proofs of its soundness, completene
Externí odkaz:
https://doaj.org/article/6923e3f10b7b46c6b259db9a8776be6e
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.
Autor:
Takuya Noguchi, Akihiro Fujiwara
Publikováno v:
International Journal of Networking and Computing. 12:238-252
Autor:
Adnan Darwiche, Umut Oztok
Publikováno v:
Journal of Artificial Intelligence Research. 62:1-32
State-of-the-art model counters are based on exhaustive DPLL algorithms, and have been successfully used in probabilistic reasoning, one of the key problems in AI. In this article, we present a new exhaustive DPLL algorithm with a formal semantics, a
Autor:
Oztok, Umut, Darwiche, Adnan
Publikováno v:
Journal of Artificial Intelligence Research; 2018, Vol. 62, p1-32, 32p
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 303, Iss Proc. FROM 2019, Pp 3-15 (2019)
FROM
FROM
Modern high-performance SAT solvers quickly solve large satisfiability instances that occur in practice. If the instance is satisfiable, then the SAT solver can provide a witness which can be checked independently in the form of a satisfying truth as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5e5db746b6254c5c2a007284d751257f
http://arxiv.org/abs/1909.01743
http://arxiv.org/abs/1909.01743