A general tableau method for propositional interval temporal logics: Theory and implementation

In this paper, we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema’s CDT logic interpreted over partial orders (BCDT+ for short). It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented

A History of Until

Until is a notoriously difficult temporal operator as it is both existential and universal at the same time: A until B holds at the current time instant w iff either B holds at w or there exists a time instant w' in the future at which B holds and such that A holds in all the time instants between the current one and w'. This "ambivalent" nature poses a significant challenge when attempting to give deduction rules for until. In this paper, in contrast, we make explicit this duality of until to provide well-behaved natural deduction rules for linear-time logics by introducing a new temporal operator that allows us to formalize the "history" of until, i.e., the "internal" universal quantification over the time instants between the current one and w'. This approach provides the basis for formalizing deduction systems for temporal logics endowed with the until operator. For concreteness, we give here a labeled natural deduction system for a linear-time logic endowed with the new operator and show that, via a proper translation, such a system is also sound and complete with respect to the linear temporal logic LTL with until.Comment: 24 pages, full version of paper at Methods for Modalities 2009 (M4M-6

Improving Cloud System Reliability Using Autonomous Agent Technology

Cloud computing platforms provide efficient and flexible ways to offer services and computation facilities to users. Service providers acquire resources according to their requirements and deploy their services in cloud. Service consumers can access services over networks. In cloud computing, virtualization techniques allow cloud providers provide computation and storage resources according to users’ requirement. However, reliability in the cloud is an important factor to measure the performance of a virtualized cloud computing platform. Reliability in cloud computing includes the usability and availability. Usability is defined as cloud computing platform provides functional and easy-to-use computation resources to users. In order to ensure usability, configurations and management policies have to be maintained and deployed by cloud computing providers. Availability of cloud is defined as cloud computing platform provides stable and reliable computation resources to users. My research concentrates on improving usability and availability of cloud computing platforms. I proposed a customized agent-based reliability monitoring framework to increase reliability of cloud computing

A General Tableau Method for Propositional Interval Temporal Logics

Logics for time intervals provide a natural framework for representing and reasoning about timing properties in various areas of computer science. However, while various tableau methods have been de- veloped for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based temporal logics. In this paper, we introduce a new, very expressive propositional interval temporal logic, called (Non-Strict) Branching CDT (BCDT+) which extends most of the propositional interval temporal logics pro- posed in the literature. Then, we provide BCDT+ with a generic tableau method which combines features of explicit tableau methods for modal logics with constraint label management and the classical tableau method for ¯rst-order logic, and we prove its soundness and completeness

A General Tableau Method for Propositional Interval Temporal Logics

Logics for time intervals provide a natural framework for representing and reasoning about timing properties in various areas of computer science. However, while various tableau methods have been de- veloped for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based temporal logics. In this paper, we introduce a new, very expressive propositional interval temporal logic, called (Non-Strict) Branching CDT (BCDT+) which extends most of the propositional interval temporal logics pro- posed in the literature. Then, we provide BCDT+ with a generic tableau method which combines features of explicit tableau methods for modal logics with constraint label management and the classical tableau method for ¯rst-order logic, and we prove its soundness and completeness

A General Tableau Method for Propositional Interval Temporal Logics: Theory and Implementation

In this paper, we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema\u2019s CDT logic interpreted over partial orders (BCDT+ for short). It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented

Multiple-Criteria Decision Making

Decision-making on real-world problems, including individual process decisions, requires an appropriate and reliable decision support system. Fuzzy set theory, rough set theory, and neutrosophic set theory, which are MCDM techniques, are useful for modeling complex decision-making problems with imprecise, ambiguous, or vague data.This Special Issue, “Multiple Criteria Decision Making”, aims to incorporate recent developments in the area of the multi-criteria decision-making field. Topics include, but are not limited to:- MCDM optimization in engineering;- Environmental sustainability in engineering processes;- Multi-criteria production and logistics process planning;- New trends in multi-criteria evaluation of sustainable processes;- Multi-criteria decision making in strategic management based on sustainable criteria