Informally, abstraction can be described as the process of mapping a representation of a
problem onto a new representation. The aim of this paper is to propose the beginnings of a …

This article presents a completely automated approach to generating abstractions for
planning. The abstractions are generated using a tractable, domain-independent algorithm …

Computational efficiency is a central concern in the design of knowledge representation
systems. In order to obtain efficient systems, it has been suggested that one should limit the …

Completeness is an ideal, although uncommon, feature of abstract interpretations,
formalizing the intuition that, relatively to the properties encoded by the underlying abstract …

This paper provides a detailed description of the CNF part of the TPTP Problem Library for
automated theorem-proving systems. The library is available via the Internet and forms a …

One of the field in which models of abstraction have been proposed is Artificial Intelligence
(AI). This chapter has two parts: one presents an overview of the formal models, either …

In quantum computing, the basic unit of information is a qubit. Simulation of a general
quantum program takes exponential time in the number of qubits, which makes simulation …

This book presents four contributions to planning research within an integrated framework.
James Allen offers a survey of his research in the field of temporal reasoning, and then …

Impagliazzo and Wigderson (1998) gave the first construction of pseudorandom generators
from a uniform complexity assumption on EXP (namely EXP≠ BPP). Unlike results in the …

Abstract Analysis and experiments have shown that hierarchical problem solving is most
effective when the hierarchy satisfies the downward refinement property (DRP), whereby …