Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

2007

Highly Cited

2007

We propose a new family of description logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages… Expand

Highly Cited

2007

Highly Cited

2007

Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many… Expand

Highly Cited

2001

Highly Cited

2001

We use a simple statistical analysis to impose one image's color characteristics on another. We can achieve color correction by… Expand

Highly Cited

1999

Highly Cited

1999

Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The… Expand

Highly Cited

1992

Highly Cited

1992

The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that… Expand

Highly Cited

1992

Highly Cited

1992

An empirical model of equatorial electron density in the magnetosphere has been developed, covering the range 2.25 < L < 8… Expand

Highly Cited

1987

Highly Cited

1987

Solvation dynamics in polar liquids have been examined using the probe molecule coumarin 153 (Cu153) and picosecond spectroscopic… Expand

Highly Cited

1982

Highly Cited

1982

Some non-perturbative constraints on supersymmetry breaking are derived. It is demonstrated that dynamical supersymmetry breaking… Expand

Highly Cited

1978

Highly Cited

1978

The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand

Highly Cited

1966

Highly Cited

1966

explicitly evaluable functions. For example, the M-ary error probability is expressed as a quadrature in Lindsey's equation (17… Expand