نتایج جستجو برای: putnam
تعداد نتایج: 1827 فیلتر نتایج به سال:
The earlier essay came about at Ismail Serageldin's behest. He felt it would be a worthwhile exercise if I were to connect the ideas developed in Dasgupta (1993) with those in Putnam (1993), to see if the concept of social capital has potency for an understanding of the kinds of institution that are most likely to protect and promote human well-being in poor countries. The earlier essay and the...
Childhood dissociation continues to be under-recognized and under-reported, regardless of the availability of many books on childhood dissociation (Silberg, 1996; Putnam, 1997; Shirar, 1996), peer review articles, child dissociative checklists (Armstrong, Putnam, Carlson, Libero, & Smith, 1997; Putnam, Helmers, & Trickett, 1993; Ruths, Silberg, Dell, & Jenkins, 2002; Stolbach, Silvern, Williams...
Tableau and sequent calculi are the basis for most popular interactive theorem provers for formal veriication. Yet, when it comes to automatic proof search, tableaux are often slower than Davis-Putnam, SAT procedures or other techniques. This is partly due to the absence of a bivalence principle (viz. the cut-rule) but there is another source of ineeciency: the lack of constraint propagation me...
We propose a variable ordering heuristic for SAT, which is based on a structural analysis of the SAT problem. We show that when the heuristic is used by a Davis-Putnam SAT solver that employs conflict-directed backtracking, it produces a divide-and-conquer behavior in which the SAT problem is recursively decomposed into smaller problems that are solved independently. We discuss the implications...
We propose a non-clausal decision procedure for classical propositional logic. It is a generalization of the Davis-Putnam procedure and deals with formulae which are not necessarily in clausal form. Since there is no need to translate the investigated formula into normal form, we avoid increasing its size but preserve its structure. This will in general lead to a much smaller search space and t...
We show that the SATISFIABILITY (SAT) problem for CNF formulas with β-acyclic hypergraphs can be solved in polynomial time by using a special type of Davis-Putnam resolution where each resolvent is a subset of a parent clause. We extend this class to CNF formulas for which this type of Davis-Putnam resolution still applies and show that testing membership in this class is NP-complete. We compar...
Answer Set Solvers Yuliya Lierler University of Texas at Austin [email protected] Abstract Nieuwenhuis, Oliveras, and Tinelli showed how to describe enhancements of the Davis-Putnam-Logemann-Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for three algorithms that generate answer sets for logic programs: SMODELS, ASP-SAT with Backtracking, an...
9 The initial argument presented herein is not significantly original—it is a simple 10 reflection upon a notion of computation originally developed by Putnam (Putnam, 11 1988). See also Searle (1990) and criticised by Chalmers et al. (see Chalmers (1994, 12 1996a,b) see also the special issue, What is Computation?, in Minds and machines, 13 4:4, November 1994). In what follows, instead of seek...
Over the last several decades, economists and other social scientists have paid increasing attention to the phenomenon known as “social capital,” the variety of social interactions, networks, and groups that link people in society together. Beyond describing the extent of these ties, there has been a vigorous debate as to whether social capital matters for everything from governance to growth t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید