Switch to: References

Add citations

You must login to add citations.
  1. A General Tableau Method for Propositional Interval Temporal Logics: Theory and Implementation.V. Goranko, A. Montanari, P. Sala & G. Sciavicco - 2006 - Journal of Applied Logic 4 (3):305-330.
    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 (\nsbcdt\ for short). It combines (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A Duration Calculus with Neighborhood Modalities.Suman Roy - 2010 - Journal of Applied Non-Classical Logics 20 (1-2):81-126.
    To reason about continuous processes in some areas of artificial intelligence and embedded systems one has to express real-time properties. For such purpose a real-time logic has to be considered. Various such logics have been proposed. Some of these formalisms interpret formulas over intervals of time. These are called interval logics. Zhou Chaochen and Michael Hansen have introduced one such first-order interval logic called Neighborhood Logic which has two expanding modalities ◊r and ◊l. They have shown the adequacy of these (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Relational Dual Tableaux for Interval Temporal Logics.David Bresolin, Joanna Golinska-Pilarek & Ewa Orlowska - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):251–277.
    Interval temporal logics provide both an insight into a nature of time and a framework for temporal reasoning in various areas of computer science. In this paper we present sound and complete relational proof systems in the style of dual tableaux for relational logics associated with modal logics of temporal intervals and we prove that the systems enable us to verify validity and entailment of these temporal logics. We show how to incorporate in the systems various relations between intervals and/or (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Intelligent Alarm Correlation and Abductive Reasoning.Stefania Bandini, Alessandro Mosca & Matteo Palmonari - 2006 - Logic Journal of the IGPL 14 (2):347-362.
    The main aim of this paper is to present a way to improve the e.ciency of an intelligent alarm correlation module by means of an abductive reasoner. The alarm correlation module is integrated in a more complex system that performs monitoring and control tasks over a tract of a highway. On the basis of a specific theory on the domain, explanations of anomalous traffic patterns can be provided taking into account those situations not directly detected by data acquisition technology. The (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Propositional Interval Neighborhood Logics: Expressiveness, Decidability, and Undecidable Extensions.Davide Bresolin, Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2009 - Annals of Pure and Applied Logic 161 (3):289-304.
    In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics , we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Developing Bounded Reasoning.Michał Walicki, Marc Bezem & Wojtek Szajnkenig - 2009 - Journal of Logic, Language and Information 18 (1):97-129.
    We introduce a three-tiered framework for modelling and reasoning about agents who (i) can use possibly complete reasoning systems without any restrictions but who nevertheless are (ii) bounded in the sense that they never reach infinitely many results and, finally, who (iii) perform their reasoning in time. This last aspect does not concern so much the time it takes for agents to actually carry out their reasoning, as the time which can bring about external changes in the agents’ states such (...)
    Download  
     
    Export citation  
     
    Bookmark