Complexity of Algorithms for Problems in Proposition Logic.

Abstract

Our work under ONR sponsorship has produced results illuminating the nature of certain well-known polynomial time subclasses of Satisfiability. Most of these classes are interesting because they have arisen from consideration of Linear Programming concepts to formulations of Satisfiability. We have also achieved progress in the related area of the well-founded semantics for logic programming.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1997
Accession Number
ADA325949

Entities

People

  • John Franco
  • John Schlipf

Organizations

  • University of Cincinnati

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Artificial Intelligence
  • Computational Complexity
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Information Processing
  • Language
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Polynomials
  • Probabilistic Models
  • Probability
  • Standards

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.
  • Technical Research and Report Writing.
  • Theoretical Analysis.