<--- Back to Details
First PageDocument Content
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
Date: 2012-12-16 04:54:55
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

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

Add to Reading List

Source URL: www.mancoosi.org

Download Document from Source Website

File Size: 91,96 KB

Share Document on Facebook

Similar Documents

Logic / Non-classical logic / Mathematical logic / Metaphysics / Philosophical logic / Artificial intelligence / Description logic / Information science / Model theory / Modal logic / First-order logic / Web Ontology Language

Description Logics ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007

DocID: 1xVOl - View Document

Deontic Logic in Computer Science Leon van der Torre & Jörg Hansen ESSLIAugust 2008

DocID: 1uHka - View Document

αKanren A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman Department of Computer Science, Indiana University, Bloomington, IN 47408 {webyrd,dfried}@cs.indiana.edu

DocID: 1ux8H - View Document

23rd Annual IEEE Symposium on Logic in Computer Science Winning regions of higher-order pushdown games∗ A. Carayol† M. Hague‡

DocID: 1uwn4 - View Document

Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK

DocID: 1ud4n - View Document