%%% ====================================================================
%%%  @LaTeX-file{
%%%     filename  = "eiterg95.ltx",
%%%     date      = "20 November 1995",
%%%     time      = "21:41:29 EST",
%%%     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  = "10381 105 421 3623",
%%%     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{EiterG95}

\title{The Complexity of Logic-Based Abduction}

\author{Thomas Eiter \and Georg Gottlob}

\Pages{3--42}

\Month{January}

\Year{1995}

\Volume{42}

\Number{1}

\maketitle

\begin{abstract}

Abduction is an important form of nonmonotonic reasoning allowing one to find
  explanations for certain symptoms or manifestations. When the application
  domain is described by a logical theory, we speak about \emph{logic-based
  abduction}. Candidates for abductive explanations are usually subjected to
  minimality criteria such as subset-minimality, minimal cardinality, minimal
  weight, or minimalityunder prioritization of individual hypotheses. This
  paper present a comprehensive complexity analysis of relevant decision and
  search problems related to abduction on propositional theories. Our results
  indicate that abduction is harder than deduction. In particular, we show that
  with the most basic forms of abduction the relevant decision problems are
  complete for complexity classes at the second level of the polynomial
  hierarchy, while the use of prioritization raises the complexity to the third
  level in certain cases.

\end{abstract}

\begin{categories}

I.2.3, I.2.4, F.2.2, F.4.1

\end{categories}

\begin{terms}

Theory

\end{terms}

\begin{keywords}

Abduction, Complexity Analysis, Diagnosis, Reasoning, Propositional Logic

\end{keywords}

\end{document}
