Satisfiability Modulo Theories Competition (SMT-COMP) 2014: Rules and Procedures David R. Cok GrammaTech, Inc. Ithaca, NY (USA)

Source URL: smtcomp.sourceforge.net

• Theoretical computer science
• Computing
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Benchmark
• Solver
• Standard Performance Evaluation Corporation
• Computer performance

10th International Satisfiability Modulo Theories Competition (SMT-COMP 2015): Rules and Procedures Sylvain Conchon Paris-Sud University France

Source URL: smtcomp.sourceforge.net

• Theoretical computer science
• Computing
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Benchmark
• Solver
• Lis
• Standard Performance Evaluation Corporation

EJCIM 2018 Loria - Nancymars) Satisfiabilit´ e Modulo Th´ eories (SMT)

Source URL: ejcim2018.sciencesconf.org

13th International Satisfiability Modulo Theories Competition (SMT-COMP 2018): Rules and Procedures Matthias Heizmann University of Freiburg Germany

Source URL: smtcomp.sourceforge.net

• Theoretical computer science
• NP-complete problems
• Logic in computer science
• Constraint programming
• Electronic design automation
• Formal methods
• Satisfiability modulo theories
• Solver
• Benchmark
• Unsatisfiable core
• Lis

Challenges in Satisfiability Modulo Theories Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio? Abstract. Here we give a short overview of the DPLL(T ) approach to Satisfiability Modulo

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Formal methods
• Logic in computer science
• Automated theorem proving
• Constraint programming
• Electronic design automation
• Conflict-driven clause learning
• Satisfiability modulo theories
• Boolean satisfiability problem
• Unit propagation

AVATAR Modulo Theories Nikolaj Bjøner1 Giles Reger2 Martin Suda3 Andrei Voronkov2,4,5 1 Microsoft Research, Redmond, USA University of Manchester, Manchester, UK

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Logic
• Mathematical logic
• Logic in computer science
• Artificial intelligence
• Automated reasoning
• Automated theorem proving
• Predicate logic
• Quantifier
• Andrei Voronkov
• Z3
• Alt-Ergo

11th International Satisfiability Modulo Theories Competition (SMT-COMP 2016): Rules and Procedures Sylvain Conchon Paris-Sud University France

Source URL: smtcomp.sourceforge.net

• Theoretical computer science
• Logic in computer science
• NP-complete problems
• Electronic design automation
• Formal methods
• Constraint programming
• Satisfiability modulo theories
• Solver
• Benchmark
• Unsatisfiable core
• Lis

Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers∗ Gergely Kovásznai, Csaba Biró, and Balázs Erdélyi Eszterházy Károly University, Eger, Hungary IoT Research

Source URL: smt-workshop.cs.uiowa.edu

• Constraint programming
• Theoretical computer science
• Computing
• Wireless sensor network
• Wireless networking
• Applied mathematics
• Satisfiability modulo theories
• Sensor node
• Constraint satisfaction
• Mathematical optimization
• Constraint

12th International Satisfiability Modulo Theories Competition SMT-COMPMatthias Heizmann (co-organizer)

Source URL: smtcomp.sourceforge.net

• Theoretical computer science
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Solver
• Benchmark

11th International Satisfiability Modulo Theories Competition SMT-COMPSylvain Conchon

Source URL: smtcomp.sourceforge.net

• Computing
• Theoretical computer science
• Constraint programming
• Electronic design automation
• Logic in computer science
• Satisfiability modulo theories
• Benchmark
• Standard Performance Evaluation Corporation
• K computer