#### Filter Results:

#### Publication Year

1989

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Determining whether a propositional theory is satissable is a prototypical example of an NP-complete problem. Further, a large number of problems that occur in knowledge-representation, learning, planning, and other ares of AI are essentially sat-issability problems. This paper reports on the most extensive set of experiments to date on the location andâ€¦ (More)

Determining whether a propositional theory is satissable is a prototypical example of an NP-complete problem. Further, a large number of problems that occur in knowledge representation, learning, planning, and other areas of AI are essentially satissability problems. This paper reports on a series of experiments to determine the location of the crossoverâ€¦ (More)

Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory. Our approach can be used on any propo-sitional satissability problem,â€¦ (More)

Considerable progress has been made in recent years in understanding and solving propositional satisfia-bilit y problems. Much of this work has been based on experiments on randomly generated 3SAT problems . One generally accepted shortcoming of this work is that it is not clear how the results and algorithms developed will carry over to " real "â€¦ (More)

One of the fundamental problems in the theory of knowledge representation is the dii-culty of achieving both logical coherence and computational tractability. We present steps toward a theory of access-limited logic, in which access to assertions in the knowledge-base is constrained by semantic network style locality relations. Where a classical de-ductiveâ€¦ (More)

Access-Limited Logic (ALL) is a theory of knowledge representation which formalizes the access limitations inherent in a network struc-tured knowledge-base. Where a deductive method such as resolution would retrieve all assertions that satisfy a given pattern, an access-limited logic retrieves only those assertions reachable by following an available accessâ€¦ (More)

Qualitative reasoning can, and should, be decomposed into a model-building task, which creates a qualitative differential equation (QDE) as a model of a physical situation , and a qualitative simulation task, which starts with a QDE. and predicts the possible behaviors following from the model. In support of this claim, we present QPC, a model builder thatâ€¦ (More)

It has been observed previously that Random 3SAT exhibits a phase transition at a critical ratio of constraints to variables, where the average frequency of satissability falls abruptly from near 1 to near 0. In this paper we look beyond satissability to implicates and prime implicates of non-zero length and show experimentally that, for any given length,â€¦ (More)