Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Conjunctive normal form formula"'
Autor:
Lutfar Rahman, Thomas Watson
Publikováno v:
ACM Transactions on Computation Theory. 12:1-18
The classic TQBF problem is to determine who has a winning strategy in a game played on a given conjunctive normal form formula (CNF), where the two players alternate turns picking truth values for the variables in a given order, and the winner is de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b403317b35ff115c5e6c6fd12c7f6762
https://doi.org/10.1145/3397478
https://doi.org/10.1145/3397478
Publikováno v:
Chinese Journal of Electronics. 28:259-265
We introduce the concept of Complementary formula (COMF), which is a new and non-equivalent way for Knowledge compilation (KC). Based on the Hyper extension rule (HER) which is an expansion of Extension rule (ER), we design a compilation algorithm wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea41e241d9fc36a0a793851376d1ce15
https://doi.org/10.1049/cje.2018.06.009
https://doi.org/10.1049/cje.2018.06.009
Autor:
Alexander Weigl
Publikováno v:
Data Privacy Management and Security Assurance ISBN: 9783319470719
DPM/QASA@ESORICS
DPM/QASA@ESORICS
Quantitative Information Flow Analysis (QIF) measures the loss of an attacker’s uncertainty about the confidential information (pre-image) inside a software system after observing the system outputs (image). In this paper, we supplement the SAT-bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbfe93ad7367cfa11c7fcb90e93844c5
https://doi.org/10.1007/978-3-319-47072-6_4
https://doi.org/10.1007/978-3-319-47072-6_4
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2016 ISBN: 9783319409696
SAT
SAT
2QBF is a special form \(\forall \varvec{x} \exists \varvec{y}.\phi \) of the quantified Boolean formula (QBF) restricted to only two quantification layers, where \(\phi \) is a quantifier-free formula. Despite its restricted form, it provides a fram
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::148c85351407c75dc8d6a969826f980e
https://doi.org/10.1007/978-3-319-40970-2_28
https://doi.org/10.1007/978-3-319-40970-2_28
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319232188
CP
CP
Minimal explanations of infeasibility are of great interest in many domains. In propositional logic, these are referred to as Minimal Unsatisfiable Subsets MUSes. An unsatisfiable formula can have multiple MUSes, some of which provide more insights t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6f484d2fb41113b945665e784d786c7
https://doi.org/10.1007/978-3-319-23219-5_13
https://doi.org/10.1007/978-3-319-23219-5_13
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783319155784
LATA
LATA
We provide a characterisation for the size of proofs in tree-like Q-Resolution by a Prover-Delayer game, which is inspired by a similar characterisation for the proof size in classical tree-like Resolution [10]. This gives the first successful transf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::443abb60354d523d4dbadc548d4d135b
https://doi.org/10.1007/978-3-319-15579-1_38
https://doi.org/10.1007/978-3-319-15579-1_38
Autor:
Michael Kaufmann, Christian Zielke
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319243177
SAT
SAT
Searching for minimal explanations of infeasibility in constraint sets is a problem known for many years. Recent developments closed a gap between approaches that enumerate all minimal unsatisfiable subsets (MUSes) of an unsatisfiable formula in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a1167cc244bb2a15dd7a4e4ae54e96a
https://doi.org/10.1007/978-3-319-24318-4_28
https://doi.org/10.1007/978-3-319-24318-4_28
Publikováno v:
Theory and Applications of Formal Argumentation ISBN: 9783319284590
TAFA
TAFA
solvers are a quite recent method to uniformly describe algorithms in a rigorous formal way and have proven successful in declarative paradigms such as Propositional Satisfiability and Answer Set Programming. In this paper, we apply this machinery fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4b3fdc117d228d8d5cac791d6696b68
https://doi.org/10.1007/978-3-319-28460-6_3
https://doi.org/10.1007/978-3-319-28460-6_3
Publikováno v:
Automated Deduction-CADE-25 ISBN: 9783319214009
CADE
CADE
An effective SAT preprocessing technique is the addition of symmetry-breaking predicates: auxiliary clauses that guide a SAT solver away from needless exploration of isomorphic sub-problems. Symmetry-breaking predicates have been in use for over a de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f76829685790ea3637dcb0d2b6495eb9
https://doi.org/10.1007/978-3-319-21401-6_40
https://doi.org/10.1007/978-3-319-21401-6_40
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319104270
CP
CP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::053597de2176878a4151855e8f34e025
https://doi.org/10.1007/978-3-319-10428-7_41
https://doi.org/10.1007/978-3-319-10428-7_41