The Logical Consequence Role in LPNMR: A Parameterized Computation Approach

Authors:
Mauricio Osorio Galindo;Simone Pascucci
Affiliations:
Universidad de las Américas, Puebla;Universitá degli studi "La Sapienza", Roma
Venue:
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2009

Citing 5
Cited 0

Fixed-parameter complexity in AI and nonmonotonic reasoning

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Enhancing disjunctive logic programming systems by SAT checkers

Artificial Intelligence
Applications of intuitionistic logic in Answer Set Programming

Theory and Practice of Logic Programming
Logical Weak Completions of Paraconsistent Logics

Journal of Logic and Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present results about the logical consequence test under classical logic w.r.t. the Theory of Parameterized Complexity and Computation [1]. We show how a normal logic program P can partitioned in subset of clauses such that we can define an algorithm proving sets of atoms which complexity is bounded by a relation exponential in terms of a fixed parameter k and polynomial on the original size of the problem, namely the size of P . As example of application we study the model checking problem w.r.t. the P-Stable semantics.