On-line algorithms for satisfiability problems with uncertainty

Author： Ausiello G.   Giaccio R.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.171, Iss.1, 1997-01, pp. : 3-24

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A survey of the satisfiability-problems solving algorithms

By Kilani Yousef   Bsoul Mohammad   Alsarhan Ayoub   Al-Khasawneh Ahmad  

International Journal of Advanced Intelligence Paradigms, Vol. 5, Iss. 3, 2013-09 ,pp. : 233-256

Inderscience Publishers

Access to resources Recommend Favorite

On-line algorithms for orders

By Bouchitte V.   Rampon J.-X.  

Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. : 225-238

Elsevier

Access to resources Recommend Favorite

Algorithms for Testing Satisfiability Formulas

By Vlada M.  

Artificial Intelligence Review, Vol. 15, Iss. 3, 2001-05 ,pp. : 153-163

Springer Publishing Company

Access to resources Recommend Favorite

Solving satisfiability problems with preferences

By Di Rosa Emanuele  

Constraints, Vol. 15, Iss. 4, 2010-10 ,pp. : 485-515

Springer Publishing Company

Access to resources Recommend Favorite

Direct and indirect algorithms for on-line learning of disjunctions

By Helmbold D.P.   Panizza S.   Warmuth M.K.  

Theoretical Computer Science, Vol. 284, Iss. 1, 2002-07 ,pp. : 109-142

Elsevier

Access to resources Recommend Favorite