APAL
2006
13 years 4 months ago
2006
In this paper an alternative Skolemization method is introduced that for a large class of formulas is sound and complete with respect to intuitionistic logic. This class extends t...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In this work we suggest a new model for generating random satisfiable k-CNF formulas. To generate such formulas
AMC
2007
13 years 5 months ago
2007
Asian options have payoffs that depend on the average price of the underlying asset such as stocks, commodities, or financial indices. As exact closed-form formulas do not exist...
ACTA
2007
13 years 5 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
PRIS
2004
13 years 6 months ago
2004
Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is kn...
LREC
2010
13 years 6 months ago
2010
Since the first half of the 20th century, readability formulas have been widely employed to automatically predict the readability of an unseen text. In this article, the formulas ...
FOCS
2006
IEEE
13 years 8 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
ICDT
2001
ACM
13 years 9 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
ICDAR
2003
IEEE
13 years 10 months ago
2003
IEEE
As a universal technical language, mathematics has been widely applied in many fields, and it is more accurate than any other languages in describing information. Therefore, numer...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...