Results 1 
8 of
8
Temporal Development Methods for AgentBased Systems
 J. Autonomous Agents and MultiAgent Systems
"... Abstract. In this paper we overview one specific approach to the formal development of multiagent systems. This approach is based on the use of temporal logics to represent both the behaviour of individual agents, and the macrolevel behaviour of multiagent systems. We describe how formal specific ..."
Abstract

Cited by 33 (5 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we overview one specific approach to the formal development of multiagent systems. This approach is based on the use of temporal logics to represent both the behaviour of individual agents, and the macrolevel behaviour of multiagent systems. We describe how formal specification, verification and refinement can all be developed using this temporal basis, and how implementation can be achieved by directly executing these formal representations. We also show how the basic framework can be extended in various ways to handle the representation and implementation of agents capable of more complex deliberation and reasoning.
Firstorder resolution for CTL
"... In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical firstorder resolution techniques. Since there already exist a lot of welldeveloped firstorder logic theorem provers, reusing those techniques provides great benefit for solving oth ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical firstorder resolution techniques. Since there already exist a lot of welldeveloped firstorder logic theorem provers, reusing those techniques provides great benefit for solving other similar problems. We do not attempt to prove CTL theorems directly within the temporal logic syntax. We first translate arbitrary CTL formulae into a normal form for CTL and then implement the CTL calculus using resolution in firstorder logic. After that, we utilise an efficient firstorder logic theorem prover, for example, VAMPIRE or SPASS to carry out proof. Further, this approach has the potential to be extended to solve problems in other logics. 1
A Resolution Calculus for the BranchingTime Temporal Logic CTL
"... The branchingtime temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The branchingtime temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules. We use indices in the normal form to represent particular paths and the application of the resolution rules is restricted dependent on an ordering and selection function to reduce the search space. We show that the translation preserves satisfiability, the calculus is sound, complete, and terminating, and consider the complexity of the calculus.
Temporal Representation and Reasoning
"... This book is about representing knowledge in all its various forms. Yet, whatever phenomenon we aim to represent, be it natural, computational, or abstract, it is unlikely to be static. The natural world is always decaying or evolving. Thus, computational processes, by their nature, are dynamic, and ..."
Abstract
 Add to MetaCart
(Show Context)
This book is about representing knowledge in all its various forms. Yet, whatever phenomenon we aim to represent, be it natural, computational, or abstract, it is unlikely to be static. The natural world is always decaying or evolving. Thus, computational processes, by their nature, are dynamic, and most abstract notions, if they are to be useful, are likely to incorporate change. Consequently, the notion of representations changing through time is vital. And so, we need a clear way of representing both our temporal basis, and the way in which entities change over time. This is exactly what this chapter is about. We aim to provide the reader with an overview of many of the ways temporal phenomena can be modelled, described, reasoned about, and applied. In this, we will often overlap with other chapters in this collection. Some of these topics we will refer to very little, as they will be covered directly by other chapters, for example, temporal action logic [84], situation calculus [185], event calculus [209], spatiotemporal reasoning [74], temporal constraint satisfaction [291], temporal planning [84, 271], and qualitative temporal reasoning [102]. Other topics will be described in this chapter,
This work is licensed under the Creative Commons Attribution License. Reducing Validity in Epistemic ATL to Validity in Epistemic CTL
, 2013
"... We propose a validity preserving translation from a subset of epistemic Alternatingtime Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable modelchecking. This entails the decidability of va ..."
Abstract
 Add to MetaCart
We propose a validity preserving translation from a subset of epistemic Alternatingtime Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable modelchecking. This entails the decidability of validity but the implied algorithm is unfeasible. Reducing the validity problem to that in a corresponding system of CTL makes the techniques for automated deduction for that logic available for the handling of the apparently more complex system of ATL.
Creative Commons Attribution License. Reducing Validity in Epistemic ATL to Validity in Epistemic CTL
"... We propose a validity preserving translation from a subset of epistemic Alternatingtime Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable modelchecking. This entails the decidability of va ..."
Abstract
 Add to MetaCart
We propose a validity preserving translation from a subset of epistemic Alternatingtime Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable modelchecking. This entails the decidability of validity but the implied algorithm is unfeasible. Reducing the validity problem to that in a corresponding system of CTL makes the techniques for automated deduction for that logic available for the handling of the apparently more complex system of ATL.
1 A Resolution Calculus for the BranchingTime Temporal Logic CTL
"... The branchingtime temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules. ..."
Abstract
 Add to MetaCart
The branchingtime temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules. We use indices in the normal form to represent particular paths and the application of the resolution rules is restricted dependent on an ordering and selection function to reduce the search space. We show that the translation preserves satisfiability, the calculus is sound, complete and terminating and consider the complexity of the calculus.