Reconstructing a single-head formula to facilitate logical forgetting

12/18/2020
by   Paolo Liberatore, et al.
0

Logical forgetting may take exponential time in general, but it does not when its input is a single-head propositional definite Horn formula. Single-head means that no variable is the head of multiple clauses. An algorithm to make a formula single-head if possible is shown. It improves over a previous one by being complete: it always finds a single-head formula equivalent to the given one if any.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/16/2020

One head is better than two: a polynomial restriction for propositional definite Horn forgetting

Logical forgetting is NP-complete even in the simple case of proposition...
10/08/2021

Random Formula Generators

In this article, we provide three generators of propositional formulae f...
06/19/2020

Common equivalence and size after forgetting

Forgetting variables from a propositional formula may increase its size....
05/08/2020

The ghosts of forgotten things: A study on size after forgetting

Forgetting is removing variables from a logical formula while preserving...
07/13/2020

The Distribution Function of the Longest Head Run

In this paper, the open problem of finding a closed analytical expressio...
11/02/2021

CSAT is not in P

In this paper we have to demonstrate that if we claim to have an algorit...

Code Repositories

reconstruct

reconstruct a single-head formula from a definite Horn one


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.