Skip to search formSkip to main content

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

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

Highly Cited

2004

Highly Cited

2004

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

2003

Highly Cited

2003

Has sociology become more socially integrated over the last 30 years? Recent work in the sociology of knowledge demonstrates a… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Abstract Male house finches, Carpodacus mexicanus , vary in plumage coloration from pale yellow to bright red. Mate preferences… Expand

Is this relevant?

Highly Cited

1989

Highly Cited

1989

Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

In this paper we introduce a new tool for controlling the knowledge transfer process in cryptographic protocol design. It is… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

We define the set of planar boolean formulae, and then show that the set of true quantified planar formulae is polynomial space… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

A grid graph is a node-induced finite subgraph of the infinite grid. It is rectangular if its set of nodes is the product of two… Expand

Is this relevant?

Highly Cited

1976

Highly Cited

1976

We consider the problem of determining whether a planar, cubic, triply-connected graph G has a Hamiltonian circuit. We show that… Expand

Is this relevant?

Highly Cited

1973

Highly Cited

1973

The toughness of a graph G is defined as the largest real number t such that deletion of any s points from G results in a graph… Expand

Is this relevant?

Highly Cited

1972

Highly Cited

1972

Proof. Let G satisfy the hypothesis of Theorem 1. Clearly, G contains a circuit ; let C be the longest one . If G has no… Expand

Is this relevant?