In cryptography, a boolean function is said to be complete if the value of each output bit depends on all input bits. This is a desirable property toâ€¦Â (More)

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

Highly Cited

2012

Highly Cited

2012

Current techniques for query answering over DL-Lite ontologies have severe limitations in practice, since they either produceâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Jie Wu, Mihaela Cardei, Fei Dai, Shuhui Yang
- IEEE Transactions on Parallel and Distributedâ€¦
- 2006

We propose a notion of an extended dominating set where each node in an ad hoc network is covered by either a dominating neighborâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Andrew M. Pitts
- Inf. Comput.
- 1996

New tools are presented for reasoning about properties of recursively de-ned domains. We work within a general, categoryâ€¦Â (More)

Is this relevant?

1995

1995

- Michael Hanus
- ICLP
- 1995

Extra variables in a clause are variables which occur in the body but not in the head. It has been argued that extra variablesâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- GÃ©rard Verfaillie, Thomas Schiex
- AAAI
- 1994

Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set ofâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia
- Theor. Comput. Sci.
- 1994

We present a new complexity theoretic approach to incremental computation. We de ne complexity classes that capture the intuitiveâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Yuri Gurevich
- J. Comput. Syst. Sci.
- 1991

We explain and advance Levinâ€™s theory of average case completeness. In particular, we exhibit examples of problems complete inâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Roberto M. Amadio, Luca Cardelli
- POPL
- 1991

We investigate the interactions of subtyping and recursive types, in a simply typed Î»-calculus. The two fundamental questionsâ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- Moshe Y. Vardi
- STOC
- 1982

Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the languageâ€¦Â (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- M. R. Garey, David S. Johnson, Larry J. Stockmeyer
- STOC
- 1974

It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In thisâ€¦Â (More)

Is this relevant?