35 search results - page 3 / 7 » Complexity and Probability of Some Boolean Formulas |
ATAL
2009
Springer
13 years 12 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
ENTCS
2008
13 years 5 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
SIAMCOMP
2002
13 years 5 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
GRAMMARS
2002
13 years 5 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
DAM
1999
13 years 5 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...