1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

Source URL: algo2017.ac.tuwien.ac.at

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Source URL: students.ceid.upatras.gr

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Symposium on Discrete Algorithms
• Approximation algorithm
• Random walk
• 2-satisfiability

A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin

Source URL: www.fields.utoronto.ca

• Mathematics
• Theoretical computer science
• Abstract algebra
• FO
• Finite model theory
• Sheaf
• Boolean satisfiability problem
• Uniform space

Microsoft PowerPoint - perspCompatibility Mode]

Source URL: resources.mpi-inf.mpg.de

• Logic
• Mathematical logic
• Mathematics
• Propositional calculus
• Automated theorem proving
• Boolean algebra
• Syntax
• Boolean satisfiability problem
• Clause
• Valuation
• Propositional variable
• Unit propagation

An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract

Source URL: ceur-ws.org

• Theoretical computer science
• Automated planning and scheduling
• Logic in computer science
• Mathematics
• Computational complexity theory
• Boolean algebra
• Electronic design automation
• Formal methods
• Boolean satisfiability problem
• Maximum satisfiability problem
• Planning Domain Definition Language
• Satz

A BDD Representation for Positive Equational Formulas Wenxin Song, Eugene W. Stark? Department of Computer Science State University of New York at Stony Brook

Source URL: bsd7.cs.sunysb.edu

• Mathematics
• Logic
• Mathematical logic
• Boolean algebra
• Formal languages
• Model theory
• Binary decision diagram
• Model checking
• IP
• Boolean satisfiability problem
• Constructible universe
• Well-formed formula

Boolean Lexicographic Optimization Joao Marques-Silva1 , Josep Argelich2 , Ana Grac¸a3 , and Inˆes Lynce3 1 2 CSI/CASL, University College Dublin, Ireland

Source URL: ceur-ws.org

• Theoretical computer science
• Mathematics
• Mathematical optimization
• Numerical analysis
• Combinatorial optimization
• Operations research
• Constraint programming
• Logic in computer science
• Maximum satisfiability problem
• Linear programming
• Constrained optimization
• Solver

Microsoft Word - IBSdoc

Source URL: foibg.com

• Theoretical computer science
• Mathematical logic
• Mathematics
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Electronic design automation
• Algebraic logic
• Tseytin transformation
• Boolean satisfiability problem
• Conjunctive normal form
• Canonical normal form

Solving Satisfiability Problems with Qualitative Preferences: a New Approach Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea DIST - Universit`a di Genova, Italy. email:{emanuele,enrico,marco}@dist.unige.it Abstra

Source URL: tmancini.di.uniroma1.it

• Theoretical computer science
• Logic in computer science
• Mathematics
• Maximum satisfiability problem
• Boolean satisfiability problem
• DPLL algorithm