Search for minimal simplified form #4

New Issue

2018-04-13T00:45:37+02:00

patrick commented

2018-04-13 00:45:37 +02:00

Some simplification rules are mutually exclusive in terms of applicability. For instance, the following formula:

(1)  forall X not (p(X) and not q(X))

could be rewritten as either:

(1b) not exists X (p(X) and not q(X))

(1c) forall X (p(X) -> q(X))

A search for an optimal simplified form could be performed by optimizing a criterion such as the total number of logical connectives and quantifiers.

Some simplification rules are mutually exclusive in terms of applicability. For instance, the following formula: (1) forall X not (p(X) and not q(X)) could be rewritten as either: (1b) not exists X (p(X) and not q(X)) (1c) forall X (p(X) -> q(X)) A search for an optimal simplified form could be performed by optimizing a criterion such as the total number of logical connectives and quantifiers.

patrick added the enhancement label 2018-04-13 00:45:37 +02:00

patrick self-assigned this 2018-04-13 00:47:07 +02:00

patrick added this to the anthem 0.2.1 milestone 2018-04-23 00:24:17 +02:00

patrick removed this from the anthem 0.2.1 milestone 2019-01-13 16:43:06 +01:00

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: patrick/anthem#4