Augmenting SAT Solvers for Network Configuration/Planning

Abstract

This project explored the possibility of alternate encodings of the planning problem and extensions to satisfiability (SAT) solvers that can better capture the constraints and objectives for network configurations. For example, the ability to directly deal with arithmetic constraints dealing with configuration cost, or probabilistic failure modes may lead to more compact encodings that are then dealt with more sophisticated decision procedures. The end goal is to capture the constraints and objectives of network planning in a decision problem and then solve these using efficient decision procedures in a scalable way.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2006
Accession Number
ADA459907

Entities

People

  • Sharad Malik

Organizations

  • Princeton University

Tags

Communities of Interest

  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Arithmetic
  • Coding
  • Computer-Aided Design
  • Contracts
  • Failure Mode And Effect Analysis
  • Government Procurement
  • Governments
  • Information Exchange
  • Information Operations
  • Language
  • Learning
  • Mathematics
  • Military Research
  • New York

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Operations Research