• DocumentCode
    1566776
  • Title

    A class of logic problems solvable by linear programming

  • Author

    Conforti, Michele ; Cornuéjols, Gérard

  • Author_Institution
    Dipartmento di Matematica, Padova Univ., Italy
  • fYear
    1992
  • Firstpage
    670
  • Lastpage
    675
  • Abstract
    Several problems of propositional logic, such as satisfiability, MAXSAT and logical inference, can be formulated as integer programs. The authors consider sets of clauses for which these integer programs can be solved as linear programs. They prove that balanced sets of clauses have this property
  • Keywords
    computability; formal logic; inference mechanisms; integer programming; MAXSAT; balanced sets of clauses; integer programs; linear programming; logic problems; logical inference; propositional logic; satisfiability; truth assignment; Linear matrix inequalities; Linear programming; Logic programming; Polynomials; Sufficient conditions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
  • Conference_Location
    Pittsburgh, PA
  • Print_ISBN
    0-8186-2900-2
  • Type

    conf

  • DOI
    10.1109/SFCS.1992.267784
  • Filename
    267784
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1566776