Accession Number : ADA325949
Title : Complexity of Algorithms for Problems in Proposition Logic.
Descriptive Note : Final rept. 1 Jan 94-31 Mar 97,
Corporate Author : CINCINNATI UNIV OH
Personal Author(s) : Franco, John ; Schlipf, John
PDF Url : ADA325949
Report Date : APR 1997
Pagination or Media Count : 39
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.
Descriptors : *ALGORITHMS, *COMPUTER LOGIC, *LINEAR PROGRAMMING, TIME DEPENDENCE, RANDOM VARIABLES, SEMANTICS, POLYNOMIALS, HEURISTIC METHODS, APPLIED MATHEMATICS, BOOLEAN ALGEBRA, STRUCTURED PROGRAMMING.
Subject Categories : Operations Research
Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE