Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
SAT reduction
Description:
A SAT reduction translates a problem into a Boolean satisfiability instance, preserving whether the original problem has a solution.
Related topics:
Formal Methods in Verification (18%),
Constraint Satisfaction and Optimization (12%),
Complexity and Algorithms in Graphs (11%),
Advanced Graph Theory Research (11%),
Logic, Reasoning, and Knowledge (8%)
OpenAlex ID:
keywords/sat-reduction
Unit disk graph recognition is NP-hard
1998
·
Heinz Breu
, David G. Kirkpatrick
·
Computational Geometry
·
370
Evading network anomaly detection systems: formal reasoning and practical techniques
2006
·
Prahlad Fogla
, Wenke Lee
·
ACM SIGSAC Conference on Computer and Communications Security (CCS)
·
194
Satisfiability and Resiliency in Workflow Authorization Systems
2010
·
Qihua Wang
, Ninghui Li
·
ACM Transactions on Information and System Security
·
137
Bounded synthesis
2007
·
Sven Schewe
, Bernd Finkbeiner
·
Automated Technology for Verification and Analysis
·
135
Automatic Proof and Disproof in Isabelle/HOL
2011
·
Jasmin Christian Blanchette
, Lukas Bulwahn
, et al.
·
Lecture notes in computer science
·
124
Solving difficult SAT instances in the presence of symmetry
2002
·
Fadi A. Aloul
, Arathi Ramani
, et al.
·
ACM/IEEE Design Automation Conference (DAC)
·
117
Bounded Synthesis
2007
·
Sven Schewe
, Bernd Finkbeiner
·
Springer eBooks
·
111
Inferring Network Invariants Automatically
2006
·
Olga Grinchtein
, Martin Leucker
, et al.
·
Lecture notes in computer science
·
66
PushPush and Push-1 are NP-hard in 2D
2000
·
Demaine, Erik D.
, Demaine, Martin L.
, et al.
·
arXiv (Cornell University)
·
60
PDF
Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
1995
·
Suresh Chari
, Pankaj Rohatgi
, et al.
·
SIAM Journal on Computing
·
58
First-order quantified separators
2020
·
Jason R. Koenig
, Oded Padon
, et al.
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
54
Synthesis of component and connector models from crosscutting structural views
2013
·
Shahar Maoz
, Jan Oliver Ringert
, et al.
·
ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE)
·
51
PDF
Solving parity games by a reduction to SAT
2011
·
Keijo Heljanko
, Misa Keinänen
, et al.
·
Journal of Computer and System Sciences
·
43
PDF
An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols
2005
·
Alessandro Armando
, Luca Compagna
·
Electronic Notes in Theoretical Computer Science
·
42
PDF
Minimum Satisfiability and Its Applications
2011
·
Chu-min Li
, Zhu Zhu
, et al.
·
HAL
·
35
Minimum Satisfiability and its Applications
2011
·
Simon, Laurent
, Li, Chu Min
, et al.
·
HAL
·
31
Progress in Certifying Hardware Model Checking Results
2021
·
Emily Yu
, Armin Biere
, et al.
·
Lecture notes in computer science
·
30
PDF
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
2014
·
Per Austrin
, Subhash Khot
·
IEEE Transactions on Information Theory
·
30
PDF
General Position Sets in Two Families of Cartesian Product Graphs
2023
·
Danilo Korže
, Aleksander Vesel
·
Mediterranean Journal of Mathematics
·
29
PDF
Decomposition-Guided Reductions for Argumentation and Treewidth
2021
·
Johannes Fichte
, Markus Hecher
, et al.
·
International Joint Conference on Artificial Intelligence
·
21
PDF
Variety of mutual-visibility problems in hypercubes
2024
·
Danilo Korže
, Aleksander Vesel
·
Applied Mathematics and Computation
·
18
Quantifying Software Reliability via Model-Counting
2021
·
Samuel Teuber
, Alexander Weigl
·
Lecture notes in computer science
·
18
PDF
Supporting user authorization queries in RBAC systems by role–permission reassignment
2018
·
Jianfeng Lu
, Yun Xin
, et al.
·
Future Generation Computer Systems
·
16
Planning with SAT, Admissible Heuristics and A*
2011
·
Jussi Rintanen
·
ANU Open Research (Australian National University)
·
16
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
2010
·
Janusz Malinowski
, Peter Niebert
·
Lecture notes in computer science
·
15
Show more works
View as search
Works count:
132
Citation count:
2,103
Year
Topic
Type