Paper Info
Title
The Logical Consequence Role in LPNMR: A Parameterized Computation Approach
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.
Year
DOI
Venue
2009
10.1007/978-3-642-04238-6_43
LPNMR
Keywords
Field
DocType
logical consequence test,relation exponential,classical logic w,p-stable semantics,parameterized computation approach,normal logic program,present result,original size,logical consequence role,parameterized complexity,fixed parameter k,model checking problem w,classical logic,model checking
Parameterized complexity,Logical consequence,Model checking,Polynomial,Computer science,Algorithm,Descriptive complexity theory,Classical logic,Computation,Bounded function
Conference
Volume
ISSN
Citations 
5753
0302-9743
0
PageRank 
References 
Authors
0.34
11
2
Name
Order
Citations
PageRank
Mauricio Osorio143652.82
Simone Pascucci24812.85