AI Chat AI Image Generator AI Video Text to Speech

An Algorithm for Computing Prime Implicates in Modal Logic

11/12/2018
∙
by   Manoj K. Raut, et al.
∙
0
∙

In this paper we have proposed an algorithm for computing prime implicates of a modal formula in K using direct resolution method suggested in Enjalbert. We have also proved its correctness and studied its complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 01/15/2014

Prime Implicates and Prime Implicants: From Propositional to Modal Logic

Prime implicates and prime implicants have proven relevant to a number o...
0 Meghyn Bienvenu, et al. ∙
research
∙ 06/10/2021

On the 4-adic complexity of the two-prime quaternary generator

R. Hofer and A. Winterhof proved that the 2-adic complexity of the two-p...
0 Vladimir Edemskiy, et al. ∙
research
∙ 06/07/2019

CoAPI: An Efficient Two-Phase Algorithm Using Core-Guided Over-Approximate Cover for Prime Compilation of Non-Clausal Formulae

Prime compilation, i.e., the generation of all prime implicates or impli...
0 Weilin Luo, et al. ∙
research
∙ 11/30/2020

Combined Sieve Algorithm for Prime Gaps

A new Combined Sieve algorithm is presented with cost proportional to th...
0 Seth Troisi, et al. ∙
research
∙ 11/15/2017

Set complexity of construction of a regular polygon

Given a subset of C containing x,y, one can add x + y or x - y or xy or...
0 Eugene Kogan, et al. ∙
research
∙ 02/12/2022

Random primes in arithmetic progressions

We describe a straightforward method to generate a random prime q such t...
0 Pascal Giorgi, et al. ∙
research
∙ 02/24/2022

Random primes without primality testing

Numerous algorithms call for computation over the integers modulo a rand...
0 Pascal Giorgi, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal