发布求助
文献互助 智能选刊 最新文献

Time最新文献

筛选
英文 中文
Qualitative Reasoning and Data Mining 定性推理和数据挖掘
Time Pub Date : 2019-10-15 DOI: 10.4230/LIPIcs.TIME.2019.9
Y. Salhi
{"title":"Qualitative Reasoning and Data Mining","authors":"Y. Salhi","doi":"10.4230/LIPIcs.TIME.2019.9","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.9","url":null,"abstract":"In this paper, we introduce a new data mining framework that is based on qualitative reasoning. We consider databases where the item domains are of different types, such as numerical values, time intervals and spatial regions. Then, for the considered tasks, we associate to each item a constraint network in a qualitative formalism representing the relations between all the pairs of objects of the database w.r.t. this item. In this context, the introduced data mining problems consist in discovering qualitative covariations between items. In a sense, our framework can be seen as a generalization of gradual itemset mining. In order to solve the introduced problem, we use a declarative approach based on the satisfiability problem in classical propositional logic (SAT). Indeed, we define SAT encodings where the models represent the desired patterns. 2012 ACM Subject Classification Information systems → Data mining; Information systems → Association rules; Theory of computation → Constraint and logic programming; Computing methodologies → Knowledge representation and reasoning","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"9:1-9:15"},"PeriodicalIF":0.0,"publicationDate":"2019-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46573954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On the Utility of Neighbourhood Singleton-Style Consistencies for Qualitative Constraint-Based Spatial and Temporal Reasoning 基于定性约束的时空推理中邻域-辛格尔顿风格一致性的效用
Time Pub Date : 2019-10-15 DOI: 10.4230/LIPIcs.TIME.2019.14
Michael Sioutis, Anastasia Paparrizou, T. Janhunen
{"title":"On the Utility of Neighbourhood Singleton-Style Consistencies for Qualitative Constraint-Based Spatial and Temporal Reasoning","authors":"Michael Sioutis, Anastasia Paparrizou, T. Janhunen","doi":"10.4230/LIPIcs.TIME.2019.14","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.14","url":null,"abstract":"A singleton-style consistency is a local consistency that verifies if each base relation (atom) of each constraint of a qualitative constraint network ( QCN ) can serve as a support with respect to the closure of that network under a (naturally) weaker local consistency. This local consistency is essential for tackling fundamental reasoning problems associated with QCN s, such as the satisfiability checking or the minimal labeling problem, but can suffer from redundant constraint checks, especially when those checks occur far from where the pruning usually takes place. In this paper, we propose singleton-style consistencies that are applied just on the neighbourhood of a singleton-checked constraint instead of the whole network. We make a theoretical comparison with existing consistencies and consequently prove some properties of the new ones. In addition, we propose algorithms to enforce our consistencies, as well as parsimonious variants thereof, that are more efficient in practice than the state of the art. We make an experimental evaluation with random and structured QCN s of Interval Algebra in the phase transition region to demonstrate the potential of our approach.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"14:1-14:17"},"PeriodicalIF":0.0,"publicationDate":"2019-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49354056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Synthesis of LTL Formulas from Natural Language Texts: State of the Art and Research Directions 从自然语言文本合成LTL公式:现状与研究方向
Time Pub Date : 2019-10-01 DOI: 10.4230/LIPIcs.TIME.2019.17
Andrea Brunello, A. Montanari, M. Reynolds
{"title":"Synthesis of LTL Formulas from Natural Language Texts: State of the Art and Research Directions","authors":"Andrea Brunello, A. Montanari, M. Reynolds","doi":"10.4230/LIPIcs.TIME.2019.17","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.17","url":null,"abstract":"Linear temporal logic (LTL) is commonly used in model checking tasks; moreover, it is well-suited for the formalization of technical requirements. However, the correct specification and interpretation of temporal logic formulas require a strong mathematical background and can hardly be done by domain experts, who, instead, tend to rely on a natural language description of the intended system behaviour. In such situations, a system that is able to automatically translate English sentences into LTL formulas, and vice versa, would be of great help. While the task of rendering an LTL formula into a more readable English sentence may be carried out in a relatively easy way by properly parsing the formula, the converse is still an open problem, due to the inherent difficulty of interpreting free, natural language texts. Although several partial solutions have been proposed in the past, the literature still lacks a critical assessment of the work done. We address such a shortcoming, presenting the current state of the art for what concerns the English-to-LTL translation problem, and outlining some possible research directions.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"17:1-17:19"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43274419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 31
Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions 具有决策的简单时态网络的混合sat一致性检验算法
Time Pub Date : 2019-08-02 DOI: 10.4230/LIPIcs.TIME.2019.16
Matteo Zavatteri, Combi Carlo, Romeo Rizzi, L. Viganò
{"title":"Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions","authors":"Matteo Zavatteri, Combi Carlo, Romeo Rizzi, L. Viganò","doi":"10.4230/LIPIcs.TIME.2019.16","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.16","url":null,"abstract":"A Simple Temporal Network (STN) consists of time points modeling temporal events and constraints modeling the minimal and maximal temporal distance between them. A Simple Temporal Network with Decisions (STND) extends an STN by adding decision time points to model temporal plans with decisions. A decision time point is a special kind of time point that once executed allows for deciding a truth value for an associated Boolean proposition. Furthermore, STNDs label time points and constraints by conjunctions of literals saying for which scenarios (i.e., complete truth value assignments to the propositions) they are relevant. Thus, an STND models a family of STNs each obtained as a projection of the initial STND onto a scenario. An STND is consistent if there exists a consistent scenario (i.e., a scenario such that the corresponding STN projection is consistent). Recently, a hybrid SAT-based consistency checking algorithm (HSCC) was proposed to check the consistency of an STND. Unfortunately, that approach lacks experimental evaluation and does not allow for the synthesis of all consistent scenarios. In this paper, we propose an incremental HSCC algorithm for STNDs that (i) is faster than the previous one and (ii) allows for the synthesis of all consistent scenarios and related early execution schedules (offline temporal planning). Then, we carry out an experimental evaluation with Kappa, a tool that we developed for STNDs. Finally, we prove that STNDs and disjunctive temporal networks (DTNs) are equivalent. 2012 ACM Subject Classification Theory of computation → Timed and hybrid models; Computing methodologies → Temporal reasoning; Computing methodologies → Planning and scheduling; Mathematics of computing → Graph algorithms; Hardware → Theorem proving and SAT solving","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"16:1-16:17"},"PeriodicalIF":0.0,"publicationDate":"2019-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42890107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Heal Thyself 治愈自己
Time Pub Date : 2019-05-01 DOI: 10.2307/j.ctvd1c90b.19
{"title":"Heal Thyself","authors":"","doi":"10.2307/j.ctvd1c90b.19","DOIUrl":"https://doi.org/10.2307/j.ctvd1c90b.19","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"28 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68837942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Customizing BPMN Diagrams Using Timelines 使用时间线定制BPMN图
Time Pub Date : 2019-01-01 DOI: 10.4230/LIPIcs.TIME.2019.5
Combi Carlo, Barbara Oliboni, P. Sala
{"title":"Customizing BPMN Diagrams Using Timelines","authors":"Combi Carlo, Barbara Oliboni, P. Sala","doi":"10.4230/LIPIcs.TIME.2019.5","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.5","url":null,"abstract":"BPMN (Business Process Model and Notation) is widely used for modeling Business Processes by using BPMN Diagrams, but lacks in some aspects. Representing execution-dependent and time-dependent decisions in BPMN Diagrams may be a daunting challenge [10]. In many cases such constraints are omitted in order to preserve the simplicity and the readability of the process model. However, for purposes such as compliance checking, process mining, and verification, formalizing such constraints could be very useful. In this paper, we propose a novel approach for annotating BPMN Diagrams with Temporal Syn-chronization Rules borrowed from the timeline-based planning field. We discuss the expressivity of the proposed approach and show that it is able to capture a lot of complex temporal-related constraints without affecting the structure of the BPMN Diagram. Finally, we provide a mapping from annotated BPMN Diagrams to timeline-based planning problems that allows one to take advantage of the last twenty years of theoretical and practical developments in the field.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"5:1-5:17"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82909238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Time-Aware Probabilistic Knowledge Graphs 时间感知概率知识图
Time Pub Date : 2019-01-01 DOI: 10.4230/LIPIcs.TIME.2019.8
M. Chekol, H. Stuckenschmidt
{"title":"Time-Aware Probabilistic Knowledge Graphs","authors":"M. Chekol, H. Stuckenschmidt","doi":"10.4230/LIPIcs.TIME.2019.8","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.8","url":null,"abstract":"The emergence of open information extraction as a tool for constructing and expanding knowledge graphs has aided the growth of temporal data, for instance, YAGO, NELL and Wikidata. While YAGO and Wikidata maintain the valid time of facts, NELL records the time point at which a fact is retrieved from some Web corpora. Collectively, these knowledge graphs (KG) store facts extracted from Wikipedia and other sources. Due to the imprecise nature of the extraction tools that are used to build and expand KG, such as NELL, the facts in the KG are weighted (a confidence value representing the correctness of a fact). Additionally, NELL can be considered as a transaction time KG because every fact is associated with extraction date. On the other hand, YAGO and Wikidata use the valid time model because they maintain facts together with their validity time (temporal scope). In this paper, we propose a bitemporal model (that combines transaction and valid time models) for maintaining and querying bitemporal probabilistic knowledge graphs. We study coalescing and scalability of marginal and MAP inference. Moreover, we show that complexity of reasoning tasks in atemporal probabilistic KG carry over to the bitemporal setting. Finally, we report our evaluation results of the proposed model. 2012 ACM Subject Classification Information systems → Web Ontology Language (OWL); Computing methodologies → Probabilistic reasoning; Computing methodologies → Temporal reasoning","PeriodicalId":75226,"journal":{"name":"Time","volume":"26 1","pages":"8:1-8:17"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86811196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Recurrent Neural Networks Applied to GNSS Time Series for Denoising and Prediction 应用递归神经网络对GNSS时间序列进行去噪和预测
Time Pub Date : 2019-01-01 DOI: 10.4230/LIPIcs.TIME.2019.10
E. L. Piccolomini, S. Gandolfi, L. Poluzzi, L. Tavasci, Pasquale Cascarano, A. Pascucci
{"title":"Recurrent Neural Networks Applied to GNSS Time Series for Denoising and Prediction","authors":"E. L. Piccolomini, S. Gandolfi, L. Poluzzi, L. Tavasci, Pasquale Cascarano, A. Pascucci","doi":"10.4230/LIPIcs.TIME.2019.10","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.10","url":null,"abstract":"Global Navigation Satellite Systems (GNSS) are systems that continuously acquire data and provide position time series. Many monitoring applications are based on GNSS data and their efficiency depends on the capability in the time series analysis to characterize the signal content and/or to predict incoming coordinates. In this work we propose a suitable Network Architecture, based on Long Short Term Memory Recurrent Neural Networks, to solve two main tasks in GNSS time series analysis: denoising and prediction. We carry out an analysis on a synthetic time series, then we inspect two real different case studies and evaluate the results. We develop a non-deep network that removes almost the 50% of scattering from real GNSS time series and achieves a coordinate prediction with 1.1 millimeters of Mean Squared Error. 2012 ACM Subject Classification General and reference → General conference proceedings; Mathematics of computing → Time series analysis; Computing methodologies → Supervised learning by regression; Information systems → Global positioning systems","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"10:1-10:12"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83453024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
From Unstructured Data to Narrative Abstractive Summaries (Invited Talk) 从非结构化数据到叙述性抽象摘要(特邀演讲)
Time Pub Date : 2019-01-01 DOI: 10.4230/LIPIcs.TIME.2019.2
E. Boró
{"title":"From Unstructured Data to Narrative Abstractive Summaries (Invited Talk)","authors":"E. Boró","doi":"10.4230/LIPIcs.TIME.2019.2","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.2","url":null,"abstract":"This research work has been partially funded by the projects PROMETEU/2018/089 and RTI2018-094653-B-C22.","PeriodicalId":75226,"journal":{"name":"Time","volume":"21 1","pages":"2:1-2:4"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75215985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Modal Logic for Subject-Oriented Spatial Reasoning 面向主体空间推理的模态逻辑
Time Pub Date : 2019-01-01 DOI: 10.4230/LIPIcs.TIME.2019.4
P. Walega, Michał Zawidzki
{"title":"A Modal Logic for Subject-Oriented Spatial Reasoning","authors":"P. Walega, Michał Zawidzki","doi":"10.4230/LIPIcs.TIME.2019.4","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2019.4","url":null,"abstract":"We present a modal logic for representing and reasoning about space seen from the subject’s perspective. The language of our logic comprises modal operators for the relations “in front”, “behind”, “to the left”, and “to the right” of the subject, which introduce the intrinsic frame of reference; and operators for “behind an object”, “between the subject and an object”, “to the left of an object”, and “to the right of an object”, employing the relative frame of reference. The language allows us to express nominals, hybrid operators, and a restricted form of distance operators which, as we demonstrate by example, makes the logic interesting for potential applications. We prove that the satisfiability problem in the logic is decidable and in particular PSpace-complete. 2012 ACM Subject Classification Theory of computation → Complexity theory and logic; Theory of computation → Modal and temporal logics; Theory of computation → Automata over infinite objects; Theory of computation → Verification by model checking","PeriodicalId":75226,"journal":{"name":"Time","volume":"14 1","pages":"4:1-4:22"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73226673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信