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-bas...
详细信息
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.
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 mor...
详细信息
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.
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 perso...
详细信息
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.
In the wider perspective of narrowing down some of the gaps that prevent the adoption of declarative logicprogramming within highly dynamically changing environments, we focus in this paper on the context of integrat...
详细信息
ISBN:
(纸本)9783030351663;9783030351656
In the wider perspective of narrowing down some of the gaps that prevent the adoption of declarative logicprogramming 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.
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);logicprogramming with recurrence domains;extensional em...
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);logicprogramming 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 withthe 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.
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 proc...
详细信息
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
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.
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 ...
详细信息
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 ...
详细信息
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.
this book constitutes the refereed proceedings of the 18thinternationalconference on Formal Engineering Methods, ICFEM 2016, held in Tokyo, Japan, in November 2016. the 27 revised full papers presented together wit...
详细信息
ISBN:
(数字)9783319478463
ISBN:
(纸本)9783319478456
this book constitutes the refereed proceedings of the 18thinternationalconference on Formal Engineering Methods, ICFEM 2016, held in Tokyo, Japan, in November 2016. the 27 revised full papers presented together withthree invited talks were carefully reviewed and selected from 64 submissions. the conference focuses in all areas related to formal engineering meth-ods, such as verification and validation, software engineering, formal specification and modeling, software security, and software reliability.
暂无评论