检索结果-内蒙古大学图书馆

3rd international workshop on Dynamic Analysis, WODA 2005

作者： D'amorim, Marcelo Havelund, Klaus Department of Computer Science University of Illinois UrbanaChampaign United States Kestrel Technology Palo Alto United States

ISBN: (纸本)1595931260

We introduce the temporal logic HAWK and its supporting tool for runtime verification of Java programs. A monitor for a HAWK formula checks if a finite trace of program events satisfies the formula. HAWK is a programming-oriented extension of the rule-based EAGLE logic that has been shown capable of defining and implementing a range of finite trace monitoring logics, including future and past time temporal logic, metric (real-Time) temporal logics, interval logics, forms of quantified temporal logics, extended regular expressions, state machines, and others. Monitoring is achieved on a state-by-state basis avoiding any need to store the input trace. HAWK extends EAGLE with constructs for capturing parameterized program events such as method calls and method returns. Parameters can be executing thread, the objects that methods are called upon, arguments to methods, and return values. HAWK allows one to refer to these in formulae. The tool synthesizes monitors from formulae and automates program instrumentation. ©2005 ACM ISBN.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

An ontology framework for knowledge-assisted semantic video analysis and annotation

An ontology framework for knowledge-assisted semantic video ...

引用

4th international workshop on knowledge Markup and Semantic Annotation, SemAnnot 2004 - Located at the 3rd international Semantic Web Conference, ISWC 2004

作者： Dasiopoulou, S. Papastathis, V.K. Mezaris, V. Kompatsiaris, I. Strintzis, M.G. Information Processing Laboratory Electrical and Computer Engineering Department Aristotle University of Thessaloniki Thessaloniki 54124 Greece 1st Km Thermi-Panorama Rd. Thessaloniki 57001 Greece

An approach for knowledge assisted semantic analysis and annotation of video content, based on an ontology infrastructure is presented. Semantic concepts in the context of the examined domain are defined in an ontology, enriched with qualitative attributes of the semantic objects (e.g. color homogeneity), multimedia processing methods (color clustering, respectively), and numerical data or low-level features generated via training (e.g. color models, also defined in the ontology). Semantic Web technologies are used for knowledge representation in rdF/rdFS language. Rules in F-logic are defined to describe how tools for multimedia analysis should be applied according to different object attributes and low-level features, aiming at the detection of video objects corresponding to the semantic concepts defined in the ontology. This supports flexible and managed execution of various application and domain independent multimedia analysis tasks. This ontology-based approach provides the means of generating semantic metadata and as a consequence Semantic Web services and applications have a greater chance of discovering and exploiting the information and knowledge in multimedia data. The proposed approach is demonstrated in the Formula One and Football domains and shows promising results.

关键词： knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Combining logic and optimization in cutting plane theory 3

引用

3rd international workshop on Frontiers of Combining Systems (FroCoS 2000)

作者： Bockmayr, A Eisenbrand, F Univ Henri Poincare LORIA F-54506 Vandoeuvre Nancy France Max Planck Inst Informat D-66123 Saarbrucken Germany

ISBN: (纸本)3540672818

Cutting planes were introduced in 1958 by Gomory in order to solve integer linear optimization problems. Since then, they have received a lot of interest, not only in mathematical optimization, but also in logic and complexity theory. In this paper, we present some recent results on cutting planes at the interface of logic and optimization. Main emphasis is on the length and the rank of cutting plane proofs based on the Gomory-Chvatal rounding principle.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Semantic Analysis of Concurrent Computing in Decentralized IoT and Robotics Applications 14

Semantic Analysis of Concurrent Computing in Decentralized I...

引用

14th IEEE international Symposium on Autonomous Decentralized Systems (ISADS) / 3rd international workshop on Service Assurance in System Wide Information Management (SASWIM)

作者： De Luca, Gennaro Chen, Yinong Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85287 USA

ISBN: (纸本)9781728116723

As IoT and robotics applications continue to become increasingly complex and decentralized, there is an increase in the difficulty of verifying requirements such as guarantees of reliability, efficiency, and correctness of the entire system. Modern IoT and robotics research and applications employ a variety of technologies to accommodate the distribution of real world IoT devices. Many of these technologies support the orchestration of these devices with concurrent computation and workflow-based processing, e.g., Intel Service Orchestration Layer. We developed a new workflow-based programming language VIPLE (Visual IoT/Robotics programming Language Environment), which supports the orchestration of decentralized IoT and robotics devices through concurrent computation. VIPLE has been used by many universities for teaching robotics programming, event-driven computing, service-oriented computing, and parallel computing concepts. Historically, simple single threaded applications could be verified by employing formal systems such as Hoare logic. It is difficult to verify parallel and distributed computing. In our recent research, we developed a novel system to verify the semantics and other requirements of decentralized applications written in VIPLE. This system is developed using a combination of the techniques offered in Hoare logic and Rely-Guarantee logic, and it is applied using the automatically generated Pi-Calculus representation of VIPLE applications. This paper focuses on the foundations of this system, its ability to handle concurrent computing and decentralized applications, as well as its ability to support automated verification and semantic analysis.

关键词： Workflow Visual programming Internet of Things Robotics Pi-Calculus

来源：评论

学校读者我要写书评

暂无评论

Adding knowledge updates to 3APL

Adding knowledge updates to 3APL

引用

4th international workshop on programming Multi-Agent Systems, ProMAS 2006

作者： Nigam, Vivek Leite, João CENTRIA New University of Lisbon Portugal

ISBN: (纸本)9783540719557

3APL is a widely known multi-agent programming language. However, when to be used in certain domains and environments, 3APL has some limitations related to its simplistic update operator that only allows for updates to the extensional part of the belief base and its lack of a language with both default and strong negation to enable the representation and reasoning about knowledge with the open and closed world assumptions. In this paper, we propose to address these issues by modifying the belief base of 3APL to be represented by Dynamic logic programming, an extension of Answer-Set programming that allows for the representation of knowledge that changes with time. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Object support in an array-based GPGPU extension for Ruby 3

Object support in an array-based GPGPU extension for Ruby

引用

3rd ACM SIGPLAN international workshop on Libraries, Languages, and Compilers for Array programming, ARRAY 2016

作者： Springer, Matthias Masuhara, Hidehiko Department of Mathematical and Computing Sciences Tokyo Institute of Technology Japan

ISBN: (纸本)9781450343848

This paper presents implementation and optimization techniques to support objects in Ikra, an array-based parallel extension to Ruby with dynamic compilation. The high-level goal of Ikra is to allow developers to exploit GPU-based high-performance computing without paying much attention to intricate details of the underlying GPU infrastructure and CUDA. Ikra supports dynamically-typed object-oriented programming in Ruby and performs a number of optimizations. It supports parallel operations (e.g., map, each) on arrays of polymorphic objects, allowing polymorphic method calls inside a kernel by compiling them to conditional branches. To reduce branch divergence, Ikra shuffles thread assignments to base array elements based on runtime types of elements. To facilitate memory coalescing, Ikra stores objects in a structure-of-arrays (SoA) representation (columnar object layout). To eliminate intermediate data in global memory, Ikra merges cascaded parallel sections into one kernel using symbolic execution. Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Deduction-based Refinement Planning 3

Deduction-based Refinement Planning

引用

3rd international Conference on Artificial Intelligence Planning Systems, AIPS 1996

作者： Stephan, Werner Biundo, Susanne Stuhlsatzenhausweg 3 SaarbrückenD-66123 Germany

ISBN: (纸本)0929280970

We introduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refinement proceeds by stepwise transforming non-constructive problem specifications into executable plans. For each refinement step there is a correctness proof guaranteeing the soundness of refinement and with that the generation of provably correct plans. By solving the hard deduction problems once and for all on the abstract level, planning on the concrete level becomes more efficient. With that, our approach aims at making deductive planning feasible in realistic contexts. Our approach is based on a temporal logic framework that allows for the representation of specifications and plans on the same linguistic level. Basic actions and plans are specified using a programming language the constructs of which are formulae of the logic. Abstract solutions are represented as—possibly recursive—procedures. It is this common level of representation and the fluid transition between specifications and plans our refinement process basically relies upon. Copyright © 1996 AAAI (***). All rights reserved.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

A logic-based decision support system for the diagnosis of headache disorders according to the ICHD-3 international classification

引用

THEORY AND PRACTICE OF logic programming 2020年第6期20卷 864-879页

作者： COSTABILE, R. O. B. E. R. T. A. CATALANO, G. E. L. S. O. M. I. N. A. CUTERI, B. E. R. N. A. R. D. O. MORELLI, C. O. N. C. E. T. T. A. M. A. R. I. A. LEONE, N. I. C. O. L. A. MANNA, M. A. R. C. O. Univ Calabria Dept Math & Comp Sci Calabria Italy DLVSyst Srl Arcavacata Di Rende Italy

Decision support systems play an important role in medical fields as they can augment clinicians to deal more efficiently and effectively with complex decision-making processes. In the diagnosis of headache disorders, however, existing approaches and tools are still not optimal. On the one hand, to support the diagnosis of this complex and vast spectrum of disorders, the international Headache Society released in 1988 the international Classification of Headache Disorders (ICHD), now in its 3rd edition: a 200 pages document classifying more than 300 different kinds of headaches, where each is identified via a collection of specific nontrivial diagnostic criteria. On the other hand, the high number of headache disorders and their complex criteria make the medical history process inaccurate and not exhaustive both for clinicians and existing automatic tools. To fill this gap, we present head-asp, a novel decision support system for the diagnosis of headache disorders. Through a REST Web Service, head-asp implements a dynamic questionnaire that complies withICHD-3by exploiting two logical modules to reach a complete diagnosis while trying to minimize the total number of questions being posed to patients. Finally, head-asp is freely available on-line and it is receiving very positive feedback from the group of neurologists that is testing it.

关键词： knowledge representation ASP Artificial Intelligence ICHD-3

来源：评论

学校读者我要写书评

暂无评论

A logical characterisation of ordered disjunction 3

A logical characterisation of ordered disjunction

引用

3rd workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010 - Collocated with the international Conference on logic programming, ICLP 2010

作者： Cabalar, Pedro Department of Computer Science Corunna University Corunna Spain

In this paper we consider a logical treatment for the ordered disjunction operator × introduced by Brewka, Niemelä and Syrjänen in their logic Programs with Ordered Disjunctions (LPOD). LPODs are used to represent preferences in logic programming under the answer set semantics. Their semantics is defined by first translating the LPOD into a set of normal programs (called split programs) and then imposing a preference relation among the answer sets of these split programs. We concentrate on the first step and show how a suitable translation of the ordered disjunction as a derived operator into the logic of Here-and-There allows capturing the answer sets of the split programs in a direct way. We use this characterisation not only for providing an alternative implementation for LPODs, but also for checking several properties (under strongly equivalent transformations) of the × operator, like for instance, its distributivity with respect to conjunction or regular disjunction. We also make a comparison to an extension proposed by Kärger, Lopes, Olmedilla and Polleres, that combines × with regular disjunction. © 2020 workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A module system for meta-programming 4th

引用

4th international workshop on logic Program Synthesis and Transformation, LOPSTR 1994 and Metaprogramming in logic, META 1994

作者： Hill, P.M. School of Computer Studies University of Leeds LeedsLS2 9JT United Kingdom

ISBN: (纸本)9783540587927

The need for modules in the development of large programs is well known while meta-programming is widely regarded as a simple yet powerful methodology for knowledge representation and reasoning. Thus if we wish to reason about large knowledge bases, it is desirable that meta-programs should be designed to reason about modular programs. This paper describes a module system which allows the modules to be parametrised over the language symbols exported by the module and shows that this provides a natural environment for meta-programming where both the meta and object programs enjoy the same parametrised module system. © Springer-Verlag Berlin Heidelberg 1994.

关键词： knowledge representation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：