default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 38 matches
- 2010
- Adrian Balint, Andreas Fröhlich:
Improving Stochastic Local Search for SAT with a New Probability Distribution. SAT 2010: 10-15 - Anton Belov, Zbigniew Stachniak:
Improved Local Search for Circuit Satisfiability. SAT 2010: 293-299 - Eli Ben-Sasson, Jan Johannsen:
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas. SAT 2010: 16-29 - Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. SAT 2010: 30-43 - Miquel Bofill, Josep Suy, Mateu Villaret:
A System for Solving Constraint Satisfaction Problems with SMT. SAT 2010: 300-305 - Yacine Boufkhad, Thomas Hugel:
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold. SAT 2010: 99-112 - Robert Brummayer, Florian Lonsing, Armin Biere:
Automated Testing and Debugging of SAT and QBF Solvers. SAT 2010: 44-57 - Uwe Bubeck, Hans Kleine Büning:
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN. SAT 2010: 58-70 - Scott Cotton:
Two Techniques for Minimizing Resolution Proofs. SAT 2010: 306-312 - Evgeny Dantsin, Alexander Wolpert:
On Moderately Exponential Time for SAT. SAT 2010: 313-325 - Rüdiger Ehlers:
Minimising Deterministic Büchi Automata Precisely Using SAT Solving. SAT 2010: 326-332 - Carsten Fuhs, Peter Schneider-Kamp:
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. SAT 2010: 71-84 - Allen Van Gelder, Ivor T. A. Spence:
Zero-One Designs Produce Small Hard SAT Instances. SAT 2010: 388-397 - Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning. SAT 2010: 85-98 - Alexandra Goultiaeva, Fahiem Bacchus:
Exploiting Circuit Representations in QBF Solving. SAT 2010: 333-339 - Matti Järvisalo, Armin Biere:
Reconstructing Solutions after Blocked Clause Elimination. SAT 2010: 340-345 - Hadi Katebi, Karem A. Sakallah, Igor L. Markov:
Symmetry and Satisfiability: An Update. SAT 2010: 113-127 - William Klieber, Samir Sapra, Sicun Gao, Edmund M. Clarke:
A Non-prenex, Non-clausal QBF Solver with Game-State Learning. SAT 2010: 128-142 - Stephan Kottler:
SAT Solving with Reference Points. SAT 2010: 143-157 - Lukas Kroc, Ashish Sabharwal, Bart Selman:
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search. SAT 2010: 346-351 - Oliver Kullmann:
Green-Tao Numbers and SAT. SAT 2010: 352-362 - Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu:
Exact MinSAT Solving. SAT 2010: 363-368 - Florian Lonsing, Armin Biere:
Integrating Dependency Schemes in Search-Based QBF Solvers. SAT 2010: 158-171 - Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. SAT 2010: 172-180 - Vasco Manquinho, Ruben Martins, Inês Lynce:
Improving Unsatisfiability-Based Algorithms for Boolean Optimization. SAT 2010: 181-193 - William Matthews, Ramamohan Paturi:
Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable. SAT 2010: 369-374 - Christian Miller, Stefan Kupferschmid, Matthew Lewis, Bernd Becker:
Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs. SAT 2010: 194-208 - Alexander Nadel, Vadim Ryvchin:
Assignment Stack Shrinking. SAT 2010: 375-381 - Gayathri Namasivayam, Miroslaw Truszczynski:
Simple but Hard Mixed Horn Formulas. SAT 2010: 382-387 - Yehuda Naveh:
The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference. SAT 2010: 1-7
skipping 8 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-12 04:06 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint