Redundancy in Logic I: CNF Propositional Formulae

11/22/2002
by   Paolo Liberatore, et al.
0

A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleting some of its clauses: what results is an irredundant equivalent subset (I.E.S.) We study the complexity of some related problems: verification, checking existence of a I.E.S. with a given size, checking necessary and possible presence of clauses in I.E.S.'s, and uniqueness. We also consider the problem of redundancy with different definitions of equivalence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2019

Partial Quantifier Elimination With Learning

We consider a modification of the Quantifier Elimination (QE) problem ca...
research
03/21/2020

Partial Quantifier Elimination By Certificate Clauses

We study a modification of the Quantifier Elimination (QE) problem calle...
research
06/26/2011

New Polynomial Classes for Logic-Based Abduction

We address the problem of propositional logic-based abduction, i.e., the...
research
03/12/2023

General Boolean Formula Minimization with QBF Solvers

The minimization of propositional formulae is a classical problem in log...
research
07/05/2012

Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality

Detection and elimination of redundant clauses from propositional formul...
research
06/22/2011

Propositional Independence - Formula-Variable Independence and Forgetting

Independence -- the study of what is relevant to a given problem of reas...
research
07/08/2019

CHOP: Bypassing Runtime Bounds Checking Through Convex Hull OPtimization

Unsafe memory accesses in programs written using popular programming lan...

Please sign up or login with your details

Forgot password? Click here to reset