Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
satisfiability reduction
Description:
A reduction involving satisfiability problems, typically transforming instances to establish computational relationships or solve related problems.
Related topics:
Logic, Reasoning, and Knowledge (16%),
Formal Methods in Verification (12%),
Advanced Graph Theory Research (9%),
Complexity and Algorithms in Graphs (8%),
Algorithms and Data Compression (7%)
OpenAlex ID:
keywords/satisfiability-reduction
On the Complexity of k-SAT
2001
·
Russell Impagliazzo
, Ramamohan Paturi
·
Journal of Computer and System Sciences
·
1,659
Hamiltonian circuits in chordal bipartite graphs
1996
·
Haiko Müller
·
Discrete Mathematics
·
161
RustHorn: CHC-based Verification for Rust Programs
2021
·
Yusuke Matsushita
, Takeshi Tsukada
, et al.
·
ACM Transactions on Programming Languages and Systems
·
85
PDF
Tracing data errors with view-conditioned causality
2011
·
Alexandra Meliou
, Wolfgang Gatterbauer
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
74
Analyzing Context-Free Grammars Using an Incremental SAT Solver
2008
·
Roland Axelsson
, Keijo Heljanko
, et al.
·
Lecture notes in computer science
·
66
Cost-Optimal Caching for D2D Networks With User Mobility: Modeling, Analysis, and Computational Approaches
2018
·
Tao Deng
, Ghafour Ahani
, et al.
·
IEEE Transactions on Wireless Communications
·
56
PDF
Polarity Consistency Checking for Sentiment Dictionaries
2012
·
Eduard Dragut
, Hong Wang
, et al.
·
Purdue e-Pubs (Purdue University System)
·
55
NP-complete decision problems for quadratic polynomials
1976
·
Kenneth Manders
, Leonard Adleman
·
ACM Symposium on Theory of Computing (STOC)
·
52
The problem of sensor placement for triangulation-based localisation
2011
·
Anna Gorbenko
, Maxim Mornev
, et al.
·
International Journal of Automation and Control
·
44
A hierarchical model of data locality
2006
·
Chengliang Zhang
, Chen Ding
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
42
DP lower bounds for equivalence-checking and model-checking of one-counter automata
2003
·
Petr Jančar
, Antonı́n Kučera
, et al.
·
Information and Computation
·
39
PDF
Symbolic computational techniques for solving games
2005
·
Rajeev Alur
, P. Madhusudan
, et al.
·
International Journal on Software Tools for Technology Transfer
·
36
Applications of Hierarchical Reasoning in the Verification of Complex Systems
2007
·
Swen Jacobs
, Viorica Sofronie-Stokkermans
·
Electronic Notes in Theoretical Computer Science
·
33
PDF
Computational complexity in two-level morphology
1986
·
G. Edward Barton
·
Proceedings of the conference - Association for Computational Linguistics. Meeting
·
32
PDF
SPARQL Query Containment Under SHI Axioms
2021
·
Melisachew Wudage Chekol
, Jérôme Euzenat
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
31
A modular reduction of regular logic to classical logic
2002
·
R. Bejar
, R. Hahnle
, et al.
·
IEEE International Symposium on Multiple-Valued Logic (ISMVL)
·
31
Polarity Consistency Checking for Domain Independent Sentiment Dictionaries
2014
·
Eduard C. Dragut
, Hong Wang
, et al.
·
IEEE Transactions on Knowledge and Data Engineering
·
28
Multi-agent Path Planning
2012
·
Anna Gorbenko
, Vladimir Popov
·
Electronic scientific archive of UrFU (Ural Federal University)
·
28
PDF
A Tableau Method for Checking Rule Admissibility in S4
2010
·
Sergey Babenyshev
, Vladimir Rybakov
, et al.
·
Electronic Notes in Theoretical Computer Science
·
27
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
2009
·
Shuvendu K. Lahiri
, Shaz Qadeer
·
Lecture notes in computer science
·
27
Interval logics and their decision procedures Part II: A real-time interval logic
1996
·
Y Ramakrishna
·
Theoretical Computer Science
·
26
Interval logics and their decision procedures
1996
·
Y.S. Ramakrishna
, P.M. Melliar-Smith
, et al.
·
Theoretical Computer Science
·
21
PDF
A characterisation of clique-width through nested partitions
2015
·
Bruno Courcelle
, Pinar Heggernes
, et al.
·
Discrete Applied Mathematics
·
20
PDF
The complexity of finding small triangulations of convex 3-polytopes
2003
·
Alexander Below
, Jesús A. De Loera
, et al.
·
Journal of Algorithms
·
20
PDF
An automata-theoretic approach to the verification of distributed algorithms
2017
·
C. Aiswarya
, Benedikt Bollig
, et al.
·
Information and Computation
·
19
PDF
Show more works
View as search
Works count:
152
Citation count:
2,617
Year
Topic
Type