The Dichotomy for Conservative Constraint Satisfaction Problems Revisited Libor Barto Department of Mathematics and Statistics, McMaster University, Hamilton, ON, Canada and Department of Algebra, Charles University, Pra

Source URL: www.fields.utoronto.ca

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

Formal Foundations of Metamodeling: Abstract Words, Abstract Languages, and Edge Algebra Stefano Merenda, Markus Herrmannsdoerfer, and Martin Feilkas Institut f¨ ur Informatik Technische Universit¨

Source URL: spes2020.informatik.tu-muenchen.de

• Unified Modeling Language
• Software engineering
• Computing
• ISO standards
• Scientific modeling
• Abstraction
• Data modeling
• Metamodeling
• Software design
• Meta-Object Facility
• Object Constraint Language
• KM3

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Source URL: drops.dagstuhl.de

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Constraint programming
• NP-complete problems
• Boolean algebra
• Parameterized complexity
• Boolean satisfiability problem
• Constraint satisfaction problem
• Exponential time hypothesis
• Treewidth
• Tree decomposition

A Rigorous Generic Branch and Bound Solver for Nonlinear Problems Andrew P. Smith C´esar A. Mu˜noz and Anthony J. Narkawicz Mantas Markevicius National Institute of Aerospace NASA Langley Research Center

Source URL: shemesh.larc.nasa.gov

• Mathematics
• Equations
• Polynomials
• Numerical analysis
• Algebra
• Operations research
• Global optimization
• System of polynomial equations
• Mathematical optimization
• Linear programming
• Constraint satisfaction
• Interval arithmetic

Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck

Source URL: www.haz.ca

• Theoretical computer science
• Mathematics
• Formal methods
• Constraint programming
• Boolean algebra
• Automated theorem proving
• DPLL algorithm
• Binary decision diagram
• Exponential time hypothesis
• Computational complexity theory
• Bayesian network
• Distribution

sets-graph-msuc-opt.ipeps

Source URL: tmancini.di.uniroma1.it

• Logic in computer science
• Automated theorem proving
• Constraint programming
• Boolean algebra
• Propositional calculus
• Unsatisfiable core
• Boolean satisfiability problem
• Resolution
• Maximum satisfiability problem
• Satisfiability
• Package manager
• Debian

Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth∗ Petr Kolman, Martin Kouteck´ y Department of Applied Mathematics, Faculty of Mathematics and Physics,

Source URL: kam.mff.cuni.cz

• Tree decomposition
• Constraint programming
• Treewidth
• Dynamical systems
• Linear algebra
• Decomposition method
• Holographic algorithm

The VC dimension of constraint-based grammars Max Banea , Jason Rigglea , Morgan Sondereggerb a University b University of Chicago, Department of Linguistics, 1010 East 59th Street, Chicago, IL 60637.

Source URL: people.linguistics.mcgill.ca

• Geometry
• Mathematics
• Mathematical optimization
• Linguistics
• Optimality theory
• Phonology
• Phonotactics
• Linear algebra
• Hyperplane
• Feasible region
• Arrangement of hyperplanes
• Modal logic

An Algebra for Semantic Construction in Constraint-based Grammars Ann Copestake Computer Laboratory University of Cambridge New Museums Site Pembroke St, Cambridge, UK

Source URL: www.cl.cam.ac.uk

• Semantics
• Computational linguistics
• Generative linguistics
• Type theory
• Logic in computer science
• Head-driven phrase structure grammar
• Minimal recursion semantics
• Valency
• Dependency grammar
• Categorial grammar
• Structure
• Syntax