Results 21  30
of
5,860
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
, 2003
"... In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, ..."
Abstract

Cited by 601 (41 self)
 Add to MetaCart
In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, planetary rover exploration and spacecraft control domains. Other temporal and resourceintensive domains including logistics planning, plant control and manufacturing have also helped to focus the community on the modelling and reasoning issues that must be confronted to make planning technology meet the challenges of application. The international planning competitions have acted as an important motivating force behind the progress that has been made in planning since 1998. The third competition (held in 2002) set the planning community the challenge of handling time and numeric resources. This necessitated the development of a modelling language capable of expressing temporal and numeric properties of planning domains. In this paper we describe the language, PDDL2.1, that was used in the competition. We describe the syntax of the language, its formal semantics and the validation of concurrent plans. We observe that PDDL2.1 has considerable modelling power — exceeding the capabilities of current planning technology — and presents a number of important challenges to the research community.
Comprehending Monads
 Mathematical Structures in Computer Science
, 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract

Cited by 522 (16 self)
 Add to MetaCart
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised to an arbitrary monad, and how the resulting programming feature can concisely express in a pure functional language some programs that manipulate state, handle exceptions, parse text, or invoke continuations. A new solution to the old problem of destructive array update is also presented. No knowledge of category theory is assumed.
Monads for functional programming
, 1995
"... The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or nondeterminism. Three case studies are looked at in detail: how monads ease the modification o ..."
Abstract

Cited by 1481 (39 self)
 Add to MetaCart
The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or nondeterminism. Three case studies are looked at in detail: how monads ease the modification of a simple evaluator; how monads act as the basis of a datatype of arrays subject to inplace update; and how monads can be used to build parsers.
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the spi calculus enables us to consider cryptographic issues in more detail. We represent protocols as processes in the spi calculus and state their security properties in terms of coarsegrained notions of protocol equivalence.
Axiomatising physical . . .
"... Earlier we developed a theory of combining algorithms with physical systems based upon using physical experiments as oracles to algorithms. Although our concepts and methods are general, each physical oracle requires its own analysis based upon some fragment of physical theory that specifies the equ ..."
Abstract
 Add to MetaCart
Earlier we developed a theory of combining algorithms with physical systems based upon using physical experiments as oracles to algorithms. Although our concepts and methods are general, each physical oracle requires its own analysis based upon some fragment of physical theory that specifies the equipment and its behaviour. For specific examples of physical system (mechanical, optical, electrical) the computational power has been characterised using nonuniform complexity classes. The power of the known examples vary according to assumptions on precision and timing but seem to lead to the same complexity classes, namely P / log ⋆ and BP P/ / log ⋆. In this paper we develop sets of axioms for the interface between physical equipment and algorithms that allow us to prove general characterisations, in terms of P / log ⋆ and BP P/ / log ⋆, for large classes of physical oracles, in a uniform way. Sufficient conditions on physical equipment are given that ensure a physical
Ontology Mapping: The State of the Art
, 2003
"... Ontology mapping is seen as a solution provider in today's landscape of ontology research. As the number of ontologies that are made publicly available and accessible on the Web increases steadily, so does the need for applications to use them. A single ontology is no longer enough to support t ..."
Abstract

Cited by 432 (9 self)
 Add to MetaCart
Ontology mapping is seen as a solution provider in today's landscape of ontology research. As the number of ontologies that are made publicly available and accessible on the Web increases steadily, so does the need for applications to use them. A single ontology is no longer enough to support the tasks envisaged by a distributed environment like the Semantic Web. Multiple ontologies need to be accessed from several applications. Mapping could provide a common layer from which several ontologies could be accessed and hence could exchange information in semantically sound manners. Developing such mappings has been the focus of a variety of works originating from diverse communities over a number of years. In this article we comprehensively review and present these works. We also provide insights on the pragmatics of ontology mapping and elaborate on a theoretical approach for defining ontology mapping.
Collège doctoral Axiomatisations and Types
, 2005
"... The focus of this thesis are the theoretical foundations for reasoning about algorithms and protocols for modern distributed systems. Two important features of models for these systems are probability and typed mobility: probabilities can be used to quantify unreliable or unpredictable behaviour an ..."
Abstract
 Add to MetaCart
combines both nondeterministic and probabilistic behaviour in the style of Segala and Lynch’s probabilistic automata. We consider various strong and weak behavioural equivalences, and we provide complete axiomatisations for finitestate processes, restricted to guarded recursion in the case of the weak
Axiomatising NashConsistent Coalition Logic
 ILLC, University of Amsterdam
, 2002
"... We add a rule for Nashconsistency to Coalition Logic, a modal logic for reasoning about the abilities and rights of groups in multiagent systems. Rights of agents (constitutions) can be formalised using Coalition Logic, and the additional inference rule of Nashconsistency will guarantee that any m ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
theoretic results, in particular a complete axiomatisation.
Axiomatisations of Weak Equivalences for De Simone Languages
 Proceedings of the 6th International Conference on Concurrency Theory CONCUR'95
, 1995
"... . Aceto, Bloom and Vaandrager proposed in [ABV92] a procedure for generating a complete axiomatisation of strong bisimulation for process languages in the GSOS format. However, the choice operator +, which the procedure uses, as well as other auxiliary GSOS operators, which it introduces to obtain a ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
. Aceto, Bloom and Vaandrager proposed in [ABV92] a procedure for generating a complete axiomatisation of strong bisimulation for process languages in the GSOS format. However, the choice operator +, which the procedure uses, as well as other auxiliary GSOS operators, which it introduces to obtain
Canonical Varieties with No Canonical Axiomatisation
 Trans. Amer. Math. Soc
, 2003
"... We give a simple example of a variety V of modal algebras that is canonical but cannot be axiomatised by canonical equations or firstorder sentences. We then show that the variety RRA of representable relation algebras, although canonical, has no canonical axiomatisation. Indeed, we show that every ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
We give a simple example of a variety V of modal algebras that is canonical but cannot be axiomatised by canonical equations or firstorder sentences. We then show that the variety RRA of representable relation algebras, although canonical, has no canonical axiomatisation. Indeed, we show
Results 21  30
of
5,860