• Publications
  • Influence
The Semantic Web
Contrastive reasoning is the reasoning with contrasts which are expressed as contrary conjunctions like the word ”but” in natural language. Contrastive answers are more informative for reasoning withExpand
  • 3,524
  • 313
On the Computational Complexity of Algorithms
  • 927
  • 56
  • PDF
Neural Networks: Tricks of the Trade
Many algorithms are available to learn deep hierarchies of features from unlabeled data, especially images. In many cases, these algorithms involve multi-layered networks of features (eg, neuralExpand
  • 653
  • 52
  • PDF
Unifying Theories of Programming
In previous work, based on an original idea due to Saaltink, we proposed a unifying theory of undefined expressions in logics used for formally specifying software systems. In our current paper, weExpand
  • 195
  • 40
On Isomorphisms and Density of NP and Other Complete Sets
If all $NP$ complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then $P \ne NP$ and if all PTAPE complete sets are P-isomorphic then $P \ne {\text{PTAPE}}$. WeExpand
  • 445
  • 23
Information and communication technology
Interoperability is a qualitative property of computing infrastructures that denotes the ability of the sending and receiving systems to exchange and properly interpret information objects acrossExpand
  • 166
  • 17
  • PDF
Software Engineering for Self-Adaptive Systems II
The goal of this roadmap paper is to summarize the stateof-the-art and identify research challenges when developing, deploying and managing self-adaptive software systems. Instead of dealing with aExpand
  • 159
  • 13
  • PDF
Hierarchies of memory limited computations
This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some ofExpand
  • 339
  • 12
  • PDF
The Boolean Hierarchy I: Structural Properties
In this paper, we study the complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets. These are the sets accepted by trees of hardware with NP predicates asExpand
  • 224
  • 10