Results 1  10
of
11,874
Using the Davis and Putnam procedure for an efficient computation of preferred models
 In ECAI'96, 350354
, 1996
"... Some famous problems (ATMS inference, Closed World Reasoning (CWR) for instance) can be replaced by a problem of preferred model computation. We thus propose a preference relation between models based on a preference relation between literals and an "efficient" algorithm to compute the ass ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Some famous problems (ATMS inference, Closed World Reasoning (CWR) for instance) can be replaced by a problem of preferred model computation. We thus propose a preference relation between models based on a preference relation between literals and an "efficient" algorithm to compute
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 910 (74 self)
 Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
approaches such as the DavisPutnam procedure or resolution. We also show that GSAT can solve structured satisfiability problems quickly. In particular, we solve encodings of graph coloring problems, Nqueens, and Boolean induction. General application strategies and limitations of the approach are also
The efficiency of resolution and DavisPutnam procedures
 SIAM Journal on Computing
, 1999
"... We consider several problems related to the use of resolutionbased methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, building on work of Clegg, Edmonds and Impagliazzo, we give an algorithm for satisfiability that when given an unsatisfiabl ..."
Abstract

Cited by 66 (1 self)
 Add to MetaCart
an unsatisfiable formula of F finds a resolution proof of F , and the runtime of our algorithm is nontrivial as a function of the size of the shortest resolution proof of F . Next we investigate a class of backtrack search algorithms, commonly known as DavisPutnam procedures and provide the first average
Implementing the DavisPutnam Method
 Journal of Automated Reasoning
, 2000
"... The method proposed by Davis, Putnam, Logemann, and Loveland for propositional reasoning, often referred to as the DavisPutnam method, is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. We show how to implement the DavisPutnam method efficiently usin ..."
Abstract

Cited by 59 (3 self)
 Add to MetaCart
using the trie data structure for propositional clauses. A new technique of indexing only the first and last literals of clauses yields a unit propagation procedure whose complexity is sublinear to the number of occurrences of the variable in the input. We also show that the DavisPutnam method can work
Social capital, intellectual capital, and the organizational advantage
 Academy of Management Review
, 1998
"... Scholars of the theory of the firm have begun to emphasize the sources and conditions of what has been described a s "the organizational advantage, " rather than focus on the causes and consequences of market failure. Typically, researchers see such organizational advantage a s accruing fr ..."
Abstract

Cited by 1100 (1 self)
 Add to MetaCart
settings. a re conducive to the development of high levels of social capital. and (3) it is because of their more dense social capital that firms. within certain limits. have a n advantage over markets in creating and sharing intellectual capital. We present a model that incorporates this overall argument
Integration of trade and disintegration of production in the global economy
 Journal of Economic Perspectives
, 1998
"... The last few decades have seen a spectacular integration of the global economy through trade. The rising integration of world markets has brought with it a disintegration of the production process, however, as manufacturing or services activities done abroad are combined with those performed at home ..."
Abstract

Cited by 485 (7 self)
 Add to MetaCart
The last few decades have seen a spectacular integration of the global economy through trade. The rising integration of world markets has brought with it a disintegration of the production process, however, as manufacturing or services activities done abroad are combined with those performed at home. I compare several different measures of foreign outsourcing, and argue that they have all increased since the 1970s. I also consider the implications of globalization for employment and wages of lowskilled workers, and for trade and regulatory policy, such as labor standards. The last few decades have seen a spectacular integration of the global economy through trade. The share of imports (or exports) in GDP for the United States has approximately doubled in the last two decades, and if intraOECD trade is omitted, the same is true for the OECD countries generally. Trade does remain a seemingly small fraction of U.S. GDP. This is not surprising in view of the fact that large economies trade less with others, and more internally. But the modest share of trade in total national income hides the fact that merchandise trade as a share of merchandise valueadded is quite high for the U.S. and the OECD, and has been growing dramatically. In fact, if one focuses on merchandise trade relative to valueadded, the world is much more integrated today than at any time during the past century.
Solving SAT and SAT Modulo Theories: from an Abstract DavisPutnamLogemannLoveland Procedure to DPLL(T
 Journal of the ACM
, 2006
"... We first introduce Abstract DPLL, a rulebased formulation of the DavisPutnamLogemannLoveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally reason about them in a simple way. Its properties, such ..."
Abstract

Cited by 251 (29 self)
 Add to MetaCart
We first introduce Abstract DPLL, a rulebased formulation of the DavisPutnamLogemannLoveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally reason about them in a simple way. Its properties
Directional Resolution: The DavisPutnam Procedure, Revisited
 IN PROCEEDINGS OF KR94
, 1994
"... The paper presents an algorithm called directional resolution, a variation on the original DavisPutnam algorithm, and analyzes its worstcase behavior as a function of the topological structure of propositional theories. The concepts of induced width and diversity are shown to play a key role in ..."
Abstract

Cited by 103 (21 self)
 Add to MetaCart
known to date, the popular DavisPutnam procedure. Furthermore, combining a bounded...
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting of mu ..."
Abstract

Cited by 459 (36 self)
 Add to MetaCart
introduce two innovative applications that benefited from using CHR.
Results 1  10
of
11,874