Остановите войну!
for scientists:
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 35 matches
- 2013
- Albert Atserias:
The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs. SAT 2013: 1-17 - Gilles Audemard, Jean-Marie Lagniez, Laurent Simon:
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. SAT 2013: 309-317 - Anton Belov, Norbert Manthey, João Marques-Silva:
Parallel MUS Extraction. SAT 2013: 133-149 - Mordechai Ben-Ari:
LearnSAT: A SAT Solver for Education. SAT 2013: 403-407 - Olaf Beyersdorff:
The Complexity of Theorem Proving in Autoepistemic Logic. SAT 2013: 365-376 - Uwe Bubeck, Hans Kleine Büning:
Nested Boolean Functions as Models for Quantified Boolean Formulas. SAT 2013: 267-275 - Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, Roberto Sebastiani:
A Modular Approach to MaxSAT Modulo Theories. SAT 2013: 150-165 - Edmund M. Clarke:
Turing's Computable Real Numbers and Why They Are Still Important Today. SAT 2013: 18 - Jessica Davies, Fahiem Bacchus:
Exploiting the Power of mip Solvers in maxsat. SAT 2013: 166-181 - Johannes Dellert, Christian Zielke, Michael Kaufmann:
MUStICCa: MUS Extraction with Interactive Choice of Candidates. SAT 2013: 408-414 - Marcelo Finger, Ronan LeBras, Carla P. Gomes, Bart Selman:
Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability. SAT 2013: 233-249 - Hiroshi Fujita, Miyuki Koshimura, Ryuzo Hasegawa:
SCSat: A Soft Constraint Guided SAT Solver. SAT 2013: 415-421 - Oliver Gableske:
On the Interpolation between Product-Based Message Passing Heuristics for SAT. SAT 2013: 293-308 - Alexandra Goultiaeva, Fahiem Bacchus:
Recovering and Utilizing Partial Duality in QBF. SAT 2013: 83-99 - Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Local Backbones. SAT 2013: 377-393 - Marijn Heule, Stefan Szeider:
A SAT Approach to Clique-Width. SAT 2013: 318-334 - Alexey Ignatiev, Mikolás Janota, João Marques-Silva:
Quantified Maximum Satisfiability: - A Core-Guided Approach. SAT 2013: 250-266 - Markus Iser, Carsten Sinz, Mana Taghdiri:
Minimizing Models for Tseitin-Encoded SAT Instances. SAT 2013: 224-232 - Mikolás Janota, João Marques-Silva:
On Propositional QBF Expansions and Q-Resolution. SAT 2013: 67-82 - Jan Johannsen:
Exponential Separations in a Hierarchy of Clause Learning Proof Systems. SAT 2013: 40-51 - Charles Jordan, Lukasz Kaiser:
Experiments with Reduction Finding. SAT 2013: 192-207 - Jean-Marie Lagniez, Armin Biere:
Factoring Out Assumptions to Speed Up MUS Extraction. SAT 2013: 276-292 - Massimo Lauria:
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. SAT 2013: 351-364 - Florian Lonsing, Uwe Egly, Allen Van Gelder:
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. SAT 2013: 100-115 - Norbert Manthey, Tobias Philipp, Christoph Wernhard:
Soundness of Inprocessing in Clause Sharing SAT Solvers. SAT 2013: 22-39 - Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Community-Based Partitioning for MaxSAT Solving. SAT 2013: 182-191 - Andrew Mihal, Steve Teig:
A Constraint Satisfaction Approach for Programmable Logic Detailed Placement. SAT 2013: 208-223 - Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. SAT 2013: 394-402 - Igor Razgon, Justyna Petke:
Cliquewidth and Knowledge Compilation. SAT 2013: 335-350 - Horst Samulowitz, Chandra Reddy, Ashish Sabharwal, Meinolf Sellmann:
Snappy: A Simple Algorithm Portfolio. SAT 2013: 422-428
skipping 5 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-05-08 10:29 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