Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarRuben Martins
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – today
- 2019
[j8]Ruben Martins, Jia Chen, Yanju Chen, Yu Feng, Isil Dillig:
Trinity: An Extensible Synthesis Framework for Data Science. PVLDB 12(12): 1914-1917 (2019)- [c24]Daniel Gibert, Alba Lamas, Ruben Martins, Carles Mateu, Jordi Planes:
An Android Malware Detection Framework Using Graph Embeddings and Convolutional Neural Networks. CCIA 2019: 45-53 - [c23]Pedro Orvalho, Miguel Terra-Neves, Miguel Ventura, Ruben Martins, Vasco M. Manquinho:
Encodings for Enumeration-Based Program Synthesis. CP 2019: 583-599 - [c22]Yanju Chen, Ruben Martins, Yu Feng:
Maximal multi-layer specification synthesis. ESEC/SIGSOFT FSE 2019: 602-612 - [i10]Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce:
Reflections on "Incremental Cardinality Constraints for MaxSAT". CoRR abs/1910.04643 (2019) - 2018
- [c21]Saurabh Joshi, Prateek Kumar
, Ruben Martins, Sukrut Rao:
Approximation Strategies for Incomplete MaxSAT. CP 2018: 219-228 - [c20]Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Jia Hui Liang, Krzysztof Czarnecki, Vijay Ganesh:
The Effect of Structural Measures and Merges on SAT Solver Performance. CP 2018: 436-452 - [c19]Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Robert Robere, Jia Hui Liang, Krzysztof Czarnecki, Vijay Ganesh:
Learning-Sensitive Backdoors with Restarts. CP 2018: 453-469 - [c18]Yu Feng, Ruben Martins, Osbert Bastani, Isil Dillig:
Program synthesis using conflict-driven learning. PLDI 2018: 420-435 - [p1]Inês Lynce, Vasco M. Manquinho, Ruben Martins:
Parallel Maximum Satisfiability. Handbook of Parallel Constraint Reasoning 2018: 61-99 - [i9]Saurabh Joshi, Prateek Kumar, Ruben Martins, Sukrut Rao:
Approximation Strategies for Incomplete MaxSAT. CoRR abs/1806.07164 (2018) - 2017
- [j7]Peter Schrammel, Daniel Kroening, Martin Brain, Ruben Martins, Tino Teige, Tom Bienmüller:
Incremental bounded model checking for embedded software. Formal Asp. Comput. 29(5): 911-931 (2017) - [c17]Yu Feng, Osbert Bastani, Ruben Martins, Isil Dillig, Saswat Anand:
Automated Synthesis of Semantic Malware Signatures using Maximum Satisfiability. NDSS 2017 - [c16]Yu Feng, Ruben Martins, Jacob Van Geffen, Isil Dillig, Swarat Chaudhuri:
Component-based synthesis of table consolidation and transformation tasks from examples. PLDI 2017: 422-436 - [c15]Yu Feng, Ruben Martins, Yuepeng Wang, Isil Dillig, Thomas W. Reps:
Component-based synthesis for complex APIs. POPL 2017: 599-612 - [i8]Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Robert Robere, Jia Liang, Krzysztof Czarnecki, Vijay Ganesh:
Relating Complexity-theoretic Parameters with SAT Solver Performance. CoRR abs/1706.08611 (2017) - 2016
- [c14]Yuepeng Wang, Yu Feng, Ruben Martins, Arati Kaushik, Isil Dillig, Steven P. Reiss:
Hunter: next-generation code reuse for Java. SIGSOFT FSE 2016: 1028-1032 - [c13]Martin Brain, Liana Hadarean, Daniel Kroening, Ruben Martins:
Automatic Generation of Propagation Complete SAT Encodings. VMCAI 2016: 536-556 - [i7]Yu Feng, Osbert Bastani, Ruben Martins, Isil Dillig, Saswat Anand:
Automated Synthesis of Semantic Malware Signatures using Maximum Satisfiability. CoRR abs/1608.06254 (2016) - [i6]Yuepeng Wang, Yu Feng, Ruben Martins, Arati Kaushik, Isil Dillig, Steven P. Reiss:
Type-Directed Code Reuse using Integer Linear Programming. CoRR abs/1608.07745 (2016) - [i5]Yu Feng, Ruben Martins, Jacob Van Geffen, Isil Dillig, Swarat Chaudhuri:
Component-based Synthesis of Table Consolidation and Transformation Tasks from Examples. CoRR abs/1611.07502 (2016) - 2015
- [j6]Ruben Martins:
Parallel search for maximum satisfiability. Constraints 20(4): 469-470 (2015) - [j5]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Deterministic Parallel MaxSAT Solving. International Journal on Artificial Intelligence Tools 24(3): 1550005:1-1550005:25 (2015) - [j4]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Improving linear search algorithms with model-based approaches for MaxSAT solving. J. Exp. Theor. Artif. Intell. 27(5): 673-701 (2015) - [c12]Saurabh Joshi, Ruben Martins, Vasco M. Manquinho:
Generalized Totalizer Encoding for Pseudo-Boolean Constraints. CP 2015: 200-209 - [c11]Peter Schrammel, Daniel Kroening, Martin Brain, Ruben Martins, Tino Teige, Tom Bienmüller:
Successful Use of Incremental BMC in the Automotive Industry. FMICS 2015: 62-77 - [c10]Miguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco M. Manquinho:
Exploiting Resolution-Based Representations for MaxSAT Solving. SAT 2015: 272-286 - [c9]Samuel Bucheli, Daniel Kroening, Ruben Martins, Ashutosh Natraj:
From AgentSpeak to C for Safety Considerations in Unmanned Aerial Vehicles. TAROS 2015: 69-81 - [i4]Miguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco M. Manquinho:
Exploiting Resolution-based Representations for MaxSAT Solving. CoRR abs/1505.02405 (2015) - [i3]Saurabh Joshi, Ruben Martins, Vasco M. Manquinho:
Generalized Totalizer Encoding for Pseudo-Boolean Constraints. CoRR abs/1507.05920 (2015) - 2014
- [j3]Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce:
On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving. JSAT 9: 59-81 (2014) - [c8]Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce:
Incremental Cardinality Constraints for MaxSAT. CP 2014: 531-548 - [c7]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Open-WBO: A Modular MaxSAT Solver, . SAT 2014: 438-445 - [i2]Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce:
Incremental Cardinality Constraints for MaxSAT. CoRR abs/1408.4628 (2014) - [i1]Peter Schrammel, Daniel Kroening, Martin Brain, Ruben Martins, Tino Teige, Tom Bienmüller:
Incremental Bounded Model Checking for Embedded Software (extended version). CoRR abs/1409.5872 (2014) - 2013
- [c6]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Community-Based Partitioning for MaxSAT Solving. SAT 2013: 182-191 - 2012
- [j2]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Parallel search for maximum satisfiability. AI Commun. 25(2): 75-95 (2012) - [j1]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
An overview of parallel SAT solving. Constraints 17(3): 304-347 (2012) - [c5]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
On Partitioning for Maximum Satisfiability. ECAI 2012: 913-914 - [c4]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Clause Sharing in Parallel MaxSAT. LION 2012: 455-460 - 2011
- [c3]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Exploiting Cardinality Encodings in Parallel Maximum Satisfiability. ICTAI 2011: 313-320 - 2010
- [c2]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Improving Search Space Splitting for Parallel SAT Solving. ICTAI (1) 2010: 336-343 - [c1]Vasco M. Manquinho, Ruben Martins, Inês Lynce:
Improving Unsatisfiability-Based Algorithms for Boolean Optimization. SAT 2010: 181-193
Coauthor Index
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 and opencitations.net 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 Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from 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 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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-12-19 22:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
