Query Order and the Polynomial Hierarchy
Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is
19 indexed results
Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is
We study the question of whether every P set has an easy (i.e., polynomial-time computable) census function. We characterize this
This report presents Jartege, a tool which allows random generation of unit tests for Java classes specified in JML. JML
Dedicated to the memory of Edsger W.Dijkstra. Representation independence or relational parametricity formally characterizes the encapsulation provided by language constructs
This paper describes an architecture for a distributing processing system that would allow remote procedure calls to invoke other services
In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a language or
Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided
Maximum entropy models are considered by many to be one of the most promising avenues of language modeling research. Unfortunately,
With no intent of starting a holy war, this paper lists several annoying C++ birthmarks that the author has come
We first present a short review of general supersymmetric compactifications in string and M-theory using the language of G-structures and
This paper describes a novel approach to constructing phonotactic models. The underlying theoretical approach to phonological description is the multisyllable
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed
The paper discusses the basic principles and the architecture of the software toolkit for constructing knowledge-based systems which can be
Ever increasing computational power will require methods for automatic programming. We present an alternative to genetic programming, based on a
Representing defeasibility is an important issue in common sense reasoning. In reasoning about action and change, this issue becomes more
Recently, several approaches to updating knowledge bases modeled as extended logic programs have been introduced, ranging from basic methods to
Haskell provides type-class-bounded and parametric polymorphism as opposed to subtype polymorphism of object-oriented languages such as Java and OCaml. It
We present an algorithm for learning from unlabeled text, based on the Vector Space Model (VSM) of information retrieval, that
We present an algorithm for learning from unlabeled text, based on the Vector Space Model (VSM) of information retrieval, that