Results 1  10
of
10
Automated Natural Deduction for Propositional Lineartime Temporal Logic ∗
"... We present a proof searching technique for the natural deduction calculus for the propositional lineartime temporal logic and prove its correctness. This opens the prospect to apply our technique as an automated reasoning tool in a number of emerging computer science applications and in a deliberat ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
We present a proof searching technique for the natural deduction calculus for the propositional lineartime temporal logic and prove its correctness. This opens the prospect to apply our technique as an automated reasoning tool in a number of emerging computer science applications and in a deliberative decision making framework across various AI applications. 1
Natural deduction calculus for computation tree logic
 In IEEE John Vincent Atanasoff Symposium on Modern Computing
, 2006
"... permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Westminster's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promot ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
(Show Context)
permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Westminster's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to
Dynamic Reconfiguration of GCM components
, 2008
"... September 2008 and is reprinted here with permission. The report is available on the CoreGRID website, at: ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
September 2008 and is reprinted here with permission. The report is available on the CoreGRID website, at:
Motivational Attitudes and Norms in a unified Agent Communication Language for open MultiAgent Systems: A Pragmatic Approach
, 2006
"... Abstract. In order to perform some tasks, agents need to interact with each other. Thus, a MultiAgent System (MAS) is a system composed by several agents, capable of mutual interaction. Communication is a kind of interaction that allows agents to work more effectively by sharing knowledge and excha ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. In order to perform some tasks, agents need to interact with each other. Thus, a MultiAgent System (MAS) is a system composed by several agents, capable of mutual interaction. Communication is a kind of interaction that allows agents to work more effectively by sharing knowledge and exchanging information. Thus, communication allow agents to make queries, transmit information, perform declarations and to commit themselves to execute an action. For agents to communicate, a method of sequencing messages is needed (conversations). For conversations to be successful, pragmatic principles to guide the linguistic interchange should be make available. These principles should not violate crucial properties of agency such as autonomy, heterogeneity and proactiveness. Various classes of agent communication languages (ACLs) have been proposed to handle these issues, but standardization is still a holy grail. We claim that a rethinking of the general principles on the foundations of ACLs is needed. More specifically, a redistribution of the role played by the
Labeled Natural Deduction Systems for a Family of Tense Logics
, 803
"... We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of useful normalization properties (in particular, derivations ..."
Abstract
 Add to MetaCart
We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of useful normalization properties (in particular, derivations reduce to a normal form that enjoys a subformula property). We also discuss how to extend our systems to capture richer logics like (fragments of) LTL. 1
Natural Deduction Calculus for Quantified Propositional Lineartime Temporal Logic. Technical Report.
"... We present a natural deduction calculus for the quantified propositional lineartime temporal logic (QPTL) and prove its correctness. The system extends previous natural deduction constructions for the propositional lineartime temporal logic. These developments extend the applicability of the natur ..."
Abstract
 Add to MetaCart
(Show Context)
We present a natural deduction calculus for the quantified propositional lineartime temporal logic (QPTL) and prove its correctness. The system extends previous natural deduction constructions for the propositional lineartime temporal logic. These developments extend the applicability of the natural deduction to more sophisticated specifications due to the expressive power of QPTL and, on the hand, supply QPTL itself with an elegant reasoning tool. 1
Combining Computation Tree Logic and Deontic Logic in Natural Deduction Style Calculus. (Technical Report)
"... Abstract. In this technical report we present a natural deduction calculus for branchingtime deontic logic, a combination of the branchingtime logic CTL and deontic modalities and prove its correctness. The new proof technique can be applied as a reasoning tool in modeling dynamic normative syste ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this technical report we present a natural deduction calculus for branchingtime deontic logic, a combination of the branchingtime logic CTL and deontic modalities and prove its correctness. The new proof technique can be applied as a reasoning tool in modeling dynamic normative systems, for example, social organisations. From the methodological point of view our approach allows to obtain similar proof systems for other modal extensions of CTL by simple modification of the part of the system that corresponds to the properties of modalities. 1
Abstract
"... We present our recent work on the construction of natural deduction calculi for temporal logic. We analyse propositional lineartime temporal logic (PLTL) and Computation Tree Logic (CTL) and corresponding proof searching algorithms. The automation of the natural deduction calculi for these temporal ..."
Abstract
 Add to MetaCart
We present our recent work on the construction of natural deduction calculi for temporal logic. We analyse propositional lineartime temporal logic (PLTL) and Computation Tree Logic (CTL) and corresponding proof searching algorithms. The automation of the natural deduction calculi for these temporal logics opens the new prospect to apply our techniques as an automatic reasoning tool in the areas, where the lineartime or branchingtime setting is required. 1
Deductive Verification of Component Model: Combining Computation Tree Logic and Deontic Logic in Natural Deduction Style Calculus.
"... systems, reconfiguration. Abstract. In this paper we present a natural deduction calculus for branchingtime deontic logic, a combination of the branchingtime logic CTL and deontic modalities. We show how this new proof technique can be applied as a reasoning tool in modeling dynamic normative sys ..."
Abstract
 Add to MetaCart
(Show Context)
systems, reconfiguration. Abstract. In this paper we present a natural deduction calculus for branchingtime deontic logic, a combination of the branchingtime logic CTL and deontic modalities. We show how this new proof technique can be applied as a reasoning tool in modeling dynamic normative systems, namely, Grid Component System. We formally define behaviour of stateful components and a concept of a reconfiguration showing how these can be specified in our language and then apply the natural deduction verification technique defined for this new formalism. We believe that, due to the specifics of the natural deduction proof technique, this new framework not only gives us more transparent proofs but that it also leads us to a lower complexity of the overall verification scenario. 1 Introduction. In this paper we continue our systematic investigation of natural deduction construction for various logics, this time considering a combination of temporal and