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

Implementation and Application of Functional Languages: 18th international Symposium, IFL 2006 Revised Selected Papers

引用

18th international Symposium on Implementation and Application of Functional Languages, IFL 2006

ISBN: (纸本)9783540741299

the proceedings contain 15 papers. the topics discussed include: on optimising shape-generic array programs using symbolic structural information;index vector elimination-making index vectors affordable;functional-based synthesis of a systolic array for GCD computation;comparing alternative evaluation strategies for stream-based parallel functional languages;parallel coordination made explicit in a functional setting;a conference management system based on the iData toolkit;a pattern logic for prompt lazy assertions in Haskell;IVOR,a proof engine;proving program properties specified with subtype marks;uniqueness typing redefined;heuristics for type error discovery and recovery;testing properties of generic functions;worst-case execution times for a purely functional language;and automatic partial inversion of inductively sequential functions.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Extended semantics and optimization algorithms for CP-networks

引用

COMPUTATIONAL INTELLIGENCE 2004年第2期20卷 218-245页

作者： Brafman, RI Dimopoulos, Y Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Univ Cyprus Dept Comp Sci Nicosia Cyprus

Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)-nets were designed to make the process of preference elicitation simpler and more intuitive for lay users by graphically structuring a set of CP preference statements-preference statements that most people find natural and intuitive. Beside their usefulness in the process of preference elicitation, CP-nets support efficient optimization algorithms that are crucial in most applications (e. g., the selection of the best action to execute or the best product configuration). In various contexts, CP-nets with an underlying cyclic structure emerge naturally. Often, they are inconsistent according to the current semantics, and the user is required to revise them. In this paper, we show how optimization queries can be meaningfully answered in many "inconsistent" networks without troubling the user with requests for revisions. In addition, we describe a method for focusing the user's revision process when revisions are truly needed. In the process, we provide a formal semantics that justifies our approach and new techniques for computing optimal outcomes. Some of the methods we use are based on a reduction to the problem of computing stable models for nonmonotonic logic programs, and we explore this relationship closely.

关键词： preference elicitation knowledge representation CP-nets answer-set programming nonmonotonic logic programs graphical models

来源：评论

学校读者我要写书评

暂无评论

Forecasting US NASDAQ Stock Index Values using Hybrid Forecasting Systems 18

Forecasting US NASDAQ Stock Index Values using Hybrid Foreca...

引用

18th international conference on Computer and Information Technology (ICCIT)

作者： Banik, Shipra Khan, A. F. M. Khodadad Independent Univ Sch Engn & Comp Sci Dhaka Bangladesh

ISBN: (纸本)9781467399302

Capability to predict precise future stock values is the most important factor in financial market to make profit. Because of virtual trading, now a day this market has turn into one of the hot targets where any person can earn profit. thus, predicting the correct future value of a stock has become an area of hot interest. this paper attempt to forecast NASDAQ stock index values using novel hybrid forecasting models based on widely used soft computing models and time series models. the daily historical US NASDAQ closing stock index for the periods of 08 February 1971 to 24 July 2015 is used and is applied our proposed hybrid forecasting models to see whether considered forecasting models can closely forecast daily NASDAQ stock index values. Mean absolute error and root mean square error between observed and predicted NASDAQ stock index are considered as evaluation criterions. the result is compared on the basis of selected individual forecasting time series model and individual soft computing forecasting models and the proposed hybrid forecasting models. Our experimental evidences show that the proposed hybrid back-propagation artificial neural network and genetic algorithm forecasting model has outperformed as compare to other considered forecasting models for forecasting daily US NASDAQ stock index. We trust that daily US NASDAQ stock index forecasts will be notice for a number of spectators who wish to construct strategies about this index.

关键词： Time series Forecast Soft computing forecasting model Time series forecasting model Fuzzy logic Genetic programming Statistical evaluation measures

来源：评论

学校读者我要写书评

暂无评论

Tight Integration of Rule-Based Tools in Game Development 18th

Tight Integration of Rule-Based Tools in Game Development

引用

18th international conference of the Italian-Association-for-Artificial-Intelligence (AIIA)

作者： Angilica, Denise Ianni, Giovambattista Pacenza, Francesco Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

ISBN: (纸本)9783030351663;9783030351656

In the wider perspective of narrowing down some of the gaps that prevent the adoption of declarative logic programming within highly dynamically changing environments, we focus in this paper on the context of integrating reasoning modules in real-time videogames. Integrating rule-based AI within the commercial game development life-cycle poses a number of unsolved challenges, each with non-obvious solution. For instance, it is necessary to cope with strict time performance requirements;the duality between procedural code and declarative specifications prevents easy integration;the concurrent execution of reasoning tasks and game updates requires proper information passing strategies between the two involved sides. In this work we illustrate our recent progress on how to embed rule-based reasoning modules into the well-known Unity game development engine. To this end, we report about thinkEngine, a framework in which a tight integration of declarative formalisms within the typical game development workflow is made possible. We prove the viability of our approach by developing a proof-of-concept Unity game that makes use of ASP-based AI modules.

关键词： Answer Set programming Artificial Intelligence Game programming Knowledge Representation and Reasoning logic Programs Rule-based Systems Unity

来源：评论

学校读者我要写书评

暂无评论

18th international Colloqulum on Automata, Languages, and programming, ICALP 1991

引用

18th international Colloqulum on Automata, Languages, and programming, ICALP 1991

ISBN: (纸本)9783540542339

the proceedings contain 60 papers. the special focus in this conference is on Automata. the topics include: On the semantics of logic programs (invited lecture);logic programming with recurrence domains;extensional embedding of a strongly stable model of PCF;uniform ideals and strictness analysis;program composltion and modular verification;the power of reeonfiguration;general resolution of tseitin formulas is hard;program checkers for probability generation;the expressive power of implicit specifications;on confluent semi-commutations-decidability and complexity results;a kleene theorem for infinite trace languages;canonical sets of horn clauses;a specialized completion procedure for monadic string-rewriting systems presentsng groups;provably recursive programs and program extraction;efficient algorithms for path problems with general cost criteria;computing shortest paths and distances in planar graphs;efflcient maximal cubic graph cuts;improving known solutions is hard;collapsing degrees via strong computation;a parallel algorithm for two processors precedence constraint scheduling;an efflcient NG algorithm for finding hamiltonlan cycles in dense directed graphs;satisflablllty of systems of ordinal notations with the subterm property is decldable;the meaning of negative premises in transition system specifications;deciding history preserving bislmllarlty;adding action refinement to a finite process algebra;improved parallel computations with matrices and polynomials;finding minimal forbidden minors using a finite congruence;better algorithms for the pathwidth and treewidth of graphs;bounded delay and regularity of ambiguity;balancing order and chaos in image generation;minimal NFA problems are hard and computing shortest transversals.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Answer-Set programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling 18

Answer-Set Programming for Lexicographical Makespan Optimisa...

引用

18th international conference on Principles of Knowledge Representation and Reasoning, KR 2021

作者： Eiter, thomas Geibinger, Tobias Musliu, Nysret Oetsch, Johannes Skočovský, Peter Stepanova, Daria Institute for Logic and Computation TU Wien Favoritenstraße 9-11 ViennaA-1040 Austria CD-Lab Artis TU Wien Robert Bosch Campus 1 Renningen D-71272 Germany Bosch Center for AI Robert Bosch Campus 1 Renningen D-71272 Germany

ISBN: (纸本)9781956792997

We deal with a challenging scheduling problem on parallel-machines with sequence-dependent setup times and release dates from a real-world application of semiconductor workshop production. there, jobs can only be processed by dedicated machines, thus few machines can determine the makespan almost regardless of how jobs are scheduled on the remaining ones. this causes problems when machines fail and jobs need to be rescheduled. Instead of optimising only the makespan, we put the individual machine spans in non-ascending order and lexicographically minimise the resulting tuples. this achieves that all machines complete as early as possible and increases the robustness of the schedule. We study the application of Answer-Set programming (ASP) to solve this problem. While ASP eases modelling, the combination of timing constraints and the considered objective function challenges current solving technology. the former issue is addressed by using an extension of ASP by difference logic. For the latter, we devise different algorithms that use multi-shot solving. To tackle industrial-sized instances, we study different approximations and heuristics. Our experimental results show that ASP is indeed a promising KRR paradigm for this problem and is competitive with state-of-the-art CP and MIP solvers. Copyright © 2021, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

HSF(C): A Software Verifier Based on Horn Clauses (Competition Contribution)

HSF(C): A Software Verifier Based on Horn Clauses (Competiti...

引用

18th international conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)

作者： Grebenshchikov, Sergey Gupta, Ashutosh Lopes, Nuno P. Popeea, Corneliu Rybalchenko, Andrey Tech Univ Munich D-80290 Munich Germany IST Austria Klosterneuburg Austria INESC ID IST TU Lisbon Lisbon Portugal

HSF(C) is a tool that automates verification of safety and liveness properties for C programs. this paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool.

ISBN: (纸本)9783642287565

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Shostak light 18th

引用

18th international conference on Automated Deduction, CADE 2002

作者： Ganzinger, Harald MPI Informatik SaarbrückenD-66123 Germany

ISBN: (纸本)3540439315

We represent the essentialingredien ts of Shostak’s procedure at a high level of abstraction, and as a refinement of the Nelson-Oppen procedure. We analyze completeness issues of the method based on a general notion of theories. We also formalize a notion of σ-models and show that on the basis of Shostak’s procedure we cannot distinguish a theory from its approximation represented by the class of its σ-models. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Strengthening of Feasibility Cuts in logic-Based Benders Decomposition 1

引用

18th international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Karlsson, Emil Ronnberg, Elina Linkoping Univ Dept Math S-58183 Linkoping Sweden Saab AB S-58188 Linkoping Sweden

ISBN: (数字)9783030782306

ISBN: (纸本)9783030782306;9783030782290

As for any decomposition method, the computational performance of a logic-based Benders decomposition (LBBD) scheme relies on the quality of the feedback information. therefore, an important acceleration technique in LBBD is to strengthen feasibility cuts by reducing their sizes. this is typically done by solving additional subproblems to evaluate potential cuts. In this paper, we study three cut-strengthening algorithms that differ in the computational efforts made to find stronger cuts and in the guarantees with respect to the strengths of the cuts. We give a unified description of these algorithms and present a computational evaluation of their impact on the efficiency of a LBBD scheme. this evaluation is made for three different problem formulations, using over 2000 instances from five different applications. Our results show that it is usually beneficial to invest the time needed to obtain irreducible cuts. In particular, the use of the depth-first binary search cut-strengthening algorithm gives a good performance. Another observation is that when the subproblem can be separated into small independent problems, the impact of cut strengthening is dominated by that of the separation, which has an automatic strengthening effect.

关键词： logic-based Benders decomposition Cut strengthening Feasibility cuts Irreducible infeasible subset of constraints

来源：评论

学校读者我要写书评

暂无评论

Formal Methods and Software Engineering 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Kazuhiro Ogata Mark Lawford Shaoying Liu

ISBN: (数字)9783319478463

ISBN: (纸本)9783319478456

this book constitutes the refereed proceedings of the 18th international conference on Formal Engineering Methods, ICFEM 2016, held in Tokyo, Japan, in November 2016. the 27 revised full papers presented together with three invited talks were carefully reviewed and selected from 64 submissions. the conference focuses in all areas related to formal engineering meth-ods, such as veriﬁcation and validation, software engineering, formal speciﬁcation and modeling, software security, and software reliability.

关键词： Software Engineering programming Techniques programming Languages, Compilers, Interpreters logics and Meanings of Programs Mathematical logic and Formal Languages Computer Communication Networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：