%%% ====================================================================
%%% @LaTeX-file{
%%% filename = "confortic95.ltx",
%%% date = "20 September 1995",
%%% time = "13:16:36 EDT",
%%% author = "David M. Jones",
%%% email = "jacm@theory.lcs.mit.edu",
%%% url = "http://theory.lcs.mit.edu/~jacm/",
%%% address = "Journal of the ACM
%%% MIT Laboratory for Computer Science
%%% Room NE43-316
%%% 545 Technology Square
%%% Cambridge, MA 02139
%%% USA",
%%% telephone = "(617) 253-5936",
%%% FAX = "(617) 253-3480",
%%% checksum = "50402 100 361 3221",
%%% codetable = "ISO/ASCII",
%%% supported = "yes",
%%% docstring = "Copyright (c) 1995 by ACM, Inc.
%%% Permission to make digital or hard copies of part
%%% or all of this work for personal or classroom use
%%% is granted without fee provided that copies are
%%% not made or distributed for profit or direct
%%% commercial advantage and that copies bear this
%%% notice and the full citation on the first page.
%%% Copyrights for components of this work owned by
%%% others than ACM must be honored. Abstracting with
%%% credit is permitted. To copy otherwise, to
%%% republish, to post on servers, or to redistribute
%%% to lists, requires prior specific permission
%%% and/or a fee. Request permissions from
%%% Publications Dept, ACM Inc., fax +1 (212)
%%% 869-0481, or permissions@acm.org.
%%%
%%% This is a LaTeX2e file. To process it, you will
%%% need a copy of the acmabs document class, which is
%%% available via the following URL:
%%%
%%% http://theory.lcs.mit.edu/~jacm/acmart/acmabs.cls
%%% ",
%%% }
%%% ====================================================================
\documentclass{acmabs}
\begin{document}
\Journal{Journal of the ACM}
\refkey{ConfortiC95}
\title{A Class of Logic Problems Solvable by Linear Programming}
\author{Michel Conforti \and G{\'e}rard Cornu{\'e}jols}
\Month{September}
\Year{1995}
\Volume{42}
\Number{5}
\note{To appear}
\maketitle
\begin{abstract}
In propositional logic, several problems, such as satisfiability, MAX SAT and
logical inference, can be formulated as integer programs. In this paper, we
consider sets of clauses for which the corresponding integer programs can be
solved as linear programs. We prove that balanced sets of clauses have this
property.
\end{abstract}
\begin{categories}
F.2.2 [\textbf{Analysis of Algorithms and Problem Complexity}]:
Nonnumerical Algorithms and Problems---\emph{computations on discrete
structures}; G.2.1 [\textbf{Discrete Mathematics}]:
Combinatorics---\emph{combinatorial algorithms}
\end{categories}
\begin{terms}
Algorithms
\end{terms}
\begin{keywords}
Balanced matrices, linear programming, propositional logic
\end{keywords}
\end{document}