Cart (Loading....) | Create Account
Close category search window

Multi-Domain Logic and its Applications to SAT

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jebelean, T. ; RISC, Linz, Austria ; Kusper, G.

We describe a new formalism and special proof methods for a novel generalization of propositional logic, which is especially suitable for solving the satisfiability problem (SAT). A multi-domain logic (MDL) formula is quantifier-free and contains only atoms of the form x isin A, where x is a variable and A is a constant set. For formulae in conjunctive normal form, we are interested in finding solutions (assignments to variables which satisfy all clauses). Classical propositional logic corresponds to the special case when each set is either {T} or {F}. The union of all the sets occurring for a certain variable can be seen as rdquothe domainrdquo of that variable, thus MDL is also a generalization of multi-valued logic, but with different domains for variables. The most distinctive feature is, however, the indication of the sub-domain in each clause. The notions of resolution, subsumption, as well as the basic steps of the DPLL method generalize in an elegant and straightforward way. As a novel MDL specific technique, variable clustering consists in creating a new variable ranging over the cartesian product of the domains of several rdquoclusteredrdquo variables. This allows the transformation of classical SAT problems in MDL problems with less literals, and in which the propagation of information can be performed more efficiently than classical unit propagation. The basic idea of MDL originates from the earlier work of the second author on rdquohyper-unitrdquo propagation (that is simultaneous propagation of several unit clauses) and on the representation and propagation of rdquok-literalsrdquo (generalized literals containing information on several propositional variables). Preliminary experiments with a prototype Java implementation exhibit speed-ups of up to 30 times.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC '08. 10th International Symposium on

Date of Conference:

26-29 Sept. 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.