Logic Programming and Nonmonotonic Reasoning

We study the fixed-parameter complexity of various problems in AI and nonmonotonic reasoning. We show that a number of relevant parameterized problems in these areas are fixed-parameter tractable. Among these problems are constraint satisfaction problems with bounded treewidth and fixed domain, restricted satisfiability problems, propositional logic programming under the stable model semantics where the parameter is the dimension of a feedback vertex set of the program’s dependency graph, and circumscriptive inference from a positive k-CNF restricted to models of bounded size. We also show that circumscriptive inference from a general propositional theory, when the attention is restricted to models of bounded size, is fixed-parameter intractable and is actually complete for a novel fixed-parameter complexity class.

[1]  Paolo Mancarella,et al.  Database Updates through Abduction , 1990, VLDB.

[2]  Robert A. Kowalski,et al.  Abduction Compared with Negation by Failure , 1989, ICLP.

[3]  Victor W. Marek,et al.  Revision Programming, Database Updates and Integrity Constraints , 1995, ICDT.

[4]  N. Rescher.  Many Valued Logic , 1969 .

[5]  Georg Gottlob,et al.  On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..

[6]  Nicolas Spyratos,et al.  On Conservative Enforced Updates , 1997, LPNMR.

[7]  M. H. van Emden,et al.  Quantitative Deduction and its Fixpoint Theory , 1986, J. Log. Program..

[8]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[9]  Teodor C. Przymusinski,et al.  Update by Means of Inference Rules , 1997, J. Log. Program..

[10]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[11]  Hendrik Decker,et al.  An Extension of SLD by Abduction and Integrity Maintenance for View Updating in Deductive Databases , 1996, Joint International Conference and Symposium on Logic Programming.

[12]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[13]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[14]  Ken Satoh,et al.  Computing Abduction by Using the TMS , 1991, ICLP.

[15]  Domenico Saccà,et al.  The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries , 1997, J. Comput. Syst. Sci..

[16]  David Poole,et al.  Probabilistic Horn Abduction and Bayesian Networks , 1993, Artif. Intell..

[17]  Liem Ngo,et al.  Probabilistic Disjunctive Logic Programming , 1996, UAI.

[18]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[19]  Michael Kifer,et al.  An Overview of Transaction Logic , 1994, Theor. Comput. Sci..

[20]  Ehud Y. Shapiro,et al.  Logic Programs With Uncertainties: A Tool for Implementing Rule-Based Systems , 1983, IJCAI.

[21]  José Júlio Alferes,et al.  Update-Programs Can Update Programs , 1996, NMELP.

[22]  V. S. Subrahmanian,et al.  Stable Semantics for Probabilistic Deductive Databases , 1994, Inf. Comput..

[23]  Nicolas Spyratos,et al.  On Logically Justified Updates , 1998, IJCSLP.