Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ISMVL
2008
IEEE

favoriteEmaildiscussreport

109views Hardware» more ISMVL 2008»

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics

13 years 11 months ago

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics

Download www.lix.polytechnique.fr

Victor Chepoi, Nadia Creignou, Miki Hermann, Gerno

Real-time Traffic

Artificial Intelligence | ISMVL 2008 |

claim paper

Related Content

» Complexity of the Satisfiability Problem for a Class of Propositional Schemata

» Modelling and solving temporal reasoning as propositional satisfiability

» Backjumping for Quantified Boolean Logic Satisfiability

» Combination Methods for Satisfiability and ModelChecking of InfiniteState Systems

» Deciding BitVector Arithmetic with Abstraction

» Finite Instantiations for Integer Difference Logic

» Closeness and Distance Relations in Order of Magnitude Qualitative Reasoning via PDL

Post Info
More Details (n/a)

Added	31 May 2010
Updated	31 May 2010
Type	Conference
Year	2008
Where	ISMVL
Authors	Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer

Comments (0)