Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Reducing signed propositional formulas

  • Original paper
  • Published:
Soft Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

 New strategies of reduction for finite-valued propositional logics are introduced in the framework of the TAS1 methodology developed by the authors [1]. A new data structure, the Δ^-sets, is introduced to store information about the formula being analysed, and its usefulness is shown by developing efficient strategies to decrease the size of signed propositional formulas, viz., new criteria to detect the validity or unsatisfiability of subformulas, and a strong generalisation of the pure literal rule.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aguilera, G., de Guzmán, I., Ojeda-Aciego, M. et al. Reducing signed propositional formulas. Soft Computing 2, 157–166 (1999). https://doi.org/10.1007/s005000050048

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s005000050048

Keywords