Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

Symmetry breaking is a technique for speeding up propositional satisfiability testing by adding constraints to the theory that… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Many machine learning applications require a combination of probability and first-order logic. Markov logic networks (MLNs… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Stochastic local search algorithms based on the WalkSAT architecture are among the best known methods for solving hard and large… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

A corner bracket for use in mounting and locating a mounting bracket for a window covering including an inverted L-shaped… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to… Expand

Is this relevant?