Issue 1-2, Artificial Intelligence 81, eds. T. Hogg, B. A. Huberman and C. Williams (1996).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....worst case scenario) appear with a significant probability only when such instances are generated under critical conditions. Such threshold phenomena have been found in rather different combinatorial problems and therefore suggested the possibility of building a typical case complexity theory [6, 19]. It has been known for more than a decade that the issue of random combinatorics and typical case complexity can be directly related with statistical mechanics of random systems [3] Such a connection relies on the one to one correspondence between the ground state properties of spin glass ....

.... (K SAT) problem, a version of SAT we shall discuss in what follows, beside playing a central role in NP completeness proving procedures, is a also the main model for the study of the relationship between phase transition phenomena and intractability in random combinatorial structures [6]. For the same reasons, K SAT is a widespread test for the evaluation of performance of combinatorial search algorithms [19] An instance of the random K Satisfiability (K SAT) problem consists of a set of M = ffN random logical clauses over N Boolean variables, where each clause contains ....

Issue 1--2, Artificial Intelligence 81, T. Hogg, B.A. Huberman and C. Williams Eds., (1996)

....of the default assumptions, and at the same time supports our intuition about a plausible conclusion. The process of reasoning with the knowledge and the defaults is called default reasoning, and numerous formalisms that attempt at acceptable reasoning behavior have been studied for it (e.g. [AI, 1980; Touretzky, 1986; Reiter, 1987; Etherington, 1988; Goldszmidt and Pearl, 1991; Pearl, 1988; Geffner, 1990] Computational considerations, however, render all the formalisms suggested within the knowledge based systems approach apparently inadequate for commonsense reasoning. This is true not ....

AI. Special issue on non-monotonic logic. Artificial Intelligence, 13(1,2), 1980.

....Hinton does not suggest any concrete way of performing this reduction mapping. Some researchers have built models or designed frameworks in which some some compositional structure is present in distributed representations. For some examples see the papers of Touretzky, Pollack, or Smolensky in [ AIJ, 1990 ] In this paper I propose a new method for representing compositional structure in distributed representations. Circular convolution is used to construct associations of vectors. The representation of an association is a vector of the same dimensionality as the vectors which are associated. This ....

Special issue on connectionist symbol processing. Artificial Intelligence, 46(1-2), 1990.

....symbolic logic. Since a logic is declarative in general, the latter requirement is far better met in such a setting than in the procedural framework of STRIPS. This line of research has given rise to a number of so called non monotonic logics, including default logic [Rei80] non monotonic logic [NML80], circumscription [McC80] etc. YSP[HM86, Sat88] is then presented as a problem of non monotonic reasoning[HK89] Proper solution of YSP requires ability to compute not only consistent, but also preferable set of assumptions. Non monotonic logics do not distinguish two apparently different ....

Special issue on non-monotonic logic. Artificial Intelligence, 13(1,2), 1980.

No context found.

Special issue on Frontiers in Problem Solving: Phase Transitions and Complexity, Artificial Intelligence, Vol. 81, Nos. 1--2, Mar. 1996.

No context found.

Issue 1-2, Artificial Intelligence 81, eds. T. Hogg, B. A. Huberman and C. Williams (1996).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC