Zobrazeno 1 - 10
of 934
pro vyhledávání: '"Propositional formula"'
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.
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.
Real-world Software Product Lines (SPLs) need Numerical Feature Models (s) whose features have not only boolean values that satisfy boolean constraints but also have numeric attributes that satisfy arithmetic constraints. An essential operation on s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2659::3d21419e2b154df6a600fc44dc6e9cd8
https://zenodo.org/record/8168073
https://zenodo.org/record/8168073
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
This is a pre-print, please access and cite the published version: https://doi.org/10.1007/978-3-031-08129-3_4 Real-world Software Product Lines (SPLs) need Numerical Feature Models (NFMs) whose features not only have boolean values satisfying boolea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc54d6664ff9390113b31de9b8a12135
Autor:
Hartry Field
Publikováno v:
Australasian Philosophical Review. 4:112-146
Section 1 discusses properties and propositions, and some of the motivation for an account in which property instantiation and propositional truth behave ‘naively’. Section 2 generalizes a standard...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afc7da5bd278b2d6b75f5a4117170e71
https://doi.org/10.1080/24740500.2021.1886687
https://doi.org/10.1080/24740500.2021.1886687
Autor:
Earl Hunt, Steven E. Poltrock
Publikováno v:
Human Information Processing ISBN: 9781003176688
This chapter introduces a way of thinking about very complex problem solving. A computing system is of little value to a user unless there is some way to issue commands to the machinery. In order to do this there must be a language in which the user
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59a5c28010c3bac7a91142b3d484b732
https://doi.org/10.4324/9781003176688-7
https://doi.org/10.4324/9781003176688-7
Publikováno v:
Progress in Image Processing, Pattern Recognition and Communication Systems ISBN: 9783030815226
CORES/IP&C/ACS
CORES/IP&C/ACS
Modeling through Boolean encoding is often used for the investigation of various kinds of algorithms or other computer systems. Such an approach can be used successfully to cryptanalysis of symmetric ciphers. In this case, cipher testing begins with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7873e97c8c13170e7936d8d5d5351e10
https://doi.org/10.1007/978-3-030-81523-3_25
https://doi.org/10.1007/978-3-030-81523-3_25
Autor:
Sajjad Siddiqi
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 32:751-768
In satisfiability (SAT) the task is to determine whether a propositional formula can evaluate to true under some assignment to its variables. The formula is either represented in CNF or in circuit ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c60dd8285aa019773aea565b79b3075a
https://doi.org/10.1080/0952813x.2019.1672798
https://doi.org/10.1080/0952813x.2019.1672798
Autor:
Marijn J. H. Heule
Publikováno v:
Mathematics in Computer Science. 13:533-548
Symmetry breaking is a crucial technique to solve many graph problems. However, current state-of-the-art techniques break graph symmetries only partially, causing search algorithms to unnecessarily explore many isomorphic parts of the search space. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e03f1d05f02c2d70eee7d3c1864df3a
https://doi.org/10.1007/s11786-019-00397-5
https://doi.org/10.1007/s11786-019-00397-5