Остановите войну!
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 55 matches
- 2012
- Iago Abal, Alcino Cunha, Joe Hurd, Jorge Sousa Pinto:
Using Term Rewriting to Solve Bit-Vector Arithmetic Problems - (Poster Presentation). SAT 2012: 493-495 - Dimitris Achlioptas, Ricardo Menchaca-Mendez:
Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas. SAT 2012: 327-340 - Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy:
The Community Structure of SAT Formulas. SAT 2012: 410-423 - Alejandro Arbelaez, Philippe Codognet:
Towards Massively Parallel Local Search for SAT - (Poster Presentation). SAT 2012: 481-482 - Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette:
Revisiting Clause Exchange in Parallel SAT Solving. SAT 2012: 200-213 - Valeriy Balabanov, Hui-Ju Katherine Chiang, Jie-Hong Roland Jiang:
Henkin Quantifiers and Boolean Formulae. SAT 2012: 129-142 - Adrian Balint, Uwe Schöning:
Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break. SAT 2012: 16-29 - Sam Bayless, Alan J. Hu:
Single-Solver Algorithms for 2QBF - (Poster Presentation). SAT 2012: 487-488 - Anton Belov, Alexander Ivrii, Arie Matsliah, João Marques-Silva:
On Efficient Computation of Variable MUSes. SAT 2012: 298-311 - Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah:
Perfect Hashing and CNF Encodings of Cardinality Constraints. SAT 2012: 397-409 - Bard Bloom, David Grove, Benjamin Herta, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat:
SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation). SAT 2012: 463-468 - Maria Luisa Bonet, Samuel R. Buss:
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning. SAT 2012: 44-57 - Aaron R. Bradley:
Understanding IC3. SAT 2012: 1-14 - Sebastian Burg, Stephan Kottler, Michael Kaufmann:
Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation). SAT 2012: 471-472 - Florian Corzilius, Ulrich Loup, Sebastian Junges, Erika Ábrahám:
SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox - (Tool Presentation). SAT 2012: 442-448 - Nadia Creignou, Heribert Vollmer:
Parameterized Complexity of Weighted Satisfiability Problems. SAT 2012: 341-354 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT 2012: 355-368 - Emir Demirovic, Haris Gavranovic:
An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition - (Poster Presentation). SAT 2012: 489-490 - Uwe Egly:
On Sequent Systems and Resolution for QBFs. SAT 2012: 100-113 - Stefano Ermon, Ronan LeBras, Carla P. Gomes, Bart Selman, R. Bruce van Dover:
SMT-Aided Combinatorial Materials Discovery. SAT 2012: 172-185 - Vijay Ganesh, Charles W. O'Donnell, Mate Soos, Srinivas Devadas, Martin C. Rinard, Armando Solar-Lezama:
Lynx: A Programmatic SAT Solver for the RNA-Folding Problem. SAT 2012: 143-156 - Serge Gaspers, Stefan Szeider:
Strong Backdoors to Nested Satisfiability. SAT 2012: 72-85 - Allen Van Gelder, Samuel B. Wood, Florian Lonsing:
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas. SAT 2012: 86-99 - Alexandra Goultiaeva, Fahiem Bacchus:
Off the Trail: Re-examining the CDCL Algorithm. SAT 2012: 30-43 - Ashutosh Gupta:
Improved Single Pass Algorithms for Resolution Proof Reduction - (Poster Presentation). SAT 2012: 469-470 - Krystof Hoder, Nikolaj S. Bjørner:
Generalized Property Directed Reachability. SAT 2012: 157-171 - Thomas Hugel:
SATLab: X-Raying Random k-SAT - (Tool Presentation). SAT 2012: 424-429 - Antti Eero Johannes Hyvärinen, Norbert Manthey:
Designing Scalable Parallel SAT Solvers. SAT 2012: 214-227 - Markus Iser, Mana Taghdiri, Carsten Sinz:
Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod - (Poster Presentation). SAT 2012: 483-484 - Saïd Jabbour, Jerry Lonlac, Lakhdar Saïs:
Intensification Search in Modern SAT Solvers - (Poster Presentation). SAT 2012: 491-492
skipping 25 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-04-25 20:51 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