Semantic Scholar uses AI to extract papers important to this topic.
Current techniques for query answering over DL-Lite ontologies have severe limitations in practice, since they either produce… (More)
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)
New tools are presented for reasoning about properties of recursively de-ned domains. We work within a general, category… (More)
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)
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of… (More)
We present a new complexity theoretic approach to incremental computation. We de ne complexity classes that capture the intuitive… (More)
- J. Comput. Syst. Sci.
We explain and advance Levin’s theory of average case completeness. In particular, we exhibit examples of problems complete in… (More)
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions… (More)
Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language… (More)
It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this… (More)