Skip to main content
Article thumbnail
Location of Repository

Processing Boolean Equalities and Inequalities

By Jayadev Misra

Abstract

Given a set of boolean variables, and a set of equalities and inequalities among those variables (called “facts”), it is required to determine the relationship, if any, among pairs of variables (called “queries”). We consider two versions of this problems, one when the queries are given after all the facts have been presented (off-line) and when the queries and facts are intermingled (on-line). For the off-line version we give a linear algorithm, and for the on-line version a quasi-linear one by modifying the well known union-find algorithm

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.3612
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.utexas.edu/users... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.