CSL Technical Report SRI-CSL-06-01 • May 23, 2006 Integrating Simplex with DPLL(T ) Bruno Dutertre and Leonardo de Moura This report is based upon work supported by the Defense Advanced Research Projects

Source URL: yices.csl.sri.com

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Simplex algorithm

Obstructions for three-coloring graphs without induced paths on six vertices Maria Chudnovsky∗1 , Jan Goedgebeur†2 , Oliver Schaudt3 , and Mingxian Zhong4 1 Princeton University, Princeton, NJ 08544, USA. E-mail: mc

Source URL: www.zaik.uni-koeln.de

• Graph theory
• Graph coloring
• NP-complete problems
• Line graph
• Matching
• Neighbourhood
• Chordal graph
• Graph
• Block graph
• Covering graph

Graph Matching with Anchor Nodes: A Learning Approach Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University

Source URL: geometry.stanford.edu

• Combinatorial optimization
• Graph theory
• Matching
• Graph
• Hypergraph
• Graph operations
• NP-complete problems
• Bipartite double cover
• Line graph

Systematic Identification of Weak Connections between Clusters in Biological Network Hiroki Sakai 1

Source URL: www.jsbi.org

• Graph theory
• Mathematics
• Discrete mathematics
• Clique
• Vertex
• Networks
• Graph
• NP-complete problems
• Network theory
• Community structure

2-Colorable Perfect Matching is NP-complete [Schaefer 1978] Pushing 𝟏𝟏 × 𝟏𝟏 Blocks Pushing 𝟏𝟏 × 𝟏𝟏 Blocks

Source URL: courses.csail.mit.edu

Constraint Answer Set Solving Martin Gebser, Max Ostrowski, and Torsten Schaub? Universit¨at Potsdam, Institut f¨ur Informatik, August-Bebel-Str. 89, DPotsdam Abstract. We present a new approach to integrating C

Source URL: www.cs.uni-potsdam.de

• Theoretical computer science
• Constraint programming
• Declarative programming
• Logic programming
• Mathematics
• Model theory
• Logic in computer science
• NP-complete problems
• Constraint satisfaction problem
• Answer set programming
• Constraint satisfaction
• Satisfiability modulo theories

CCCG 2012, Charlottetown, P.E.I., August 8–10, 2012 Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete Takashi Horiyama∗ Takehiro Ito†

Source URL: 2012.cccg.ca

Automated Software Testing for the 21st Century Patrice Godefroid Microsoft Research TCE’2015

Source URL: tce.technion.ac.il

• Software engineering
• Computing
• Software testing
• Software
• Concurrent programming languages
• Electronic design automation
• Formal methods
• NP-complete problems
• Fuzz testing
• Random testing
• Satisfiability modulo theories
• Symbolic execution

1 Potassco: The Potsdam Answer Set Solving Collection Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Schneider

Source URL: www.cs.uni-potsdam.de

• Logic programming
• NP-complete problems
• Operations research
• Constraint programming
• Answer set programming
• Logic in computer science
• Boolean satisfiability problem
• Algorithm
• Solver
• Stable model semantics
• AMPL
• Constraint satisfaction problem