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

13th international Symposium on Functional and logic programming, FLOPS 2016

ISBN: (纸本)9783319296036

the proceedings contain 15 papers. the special focus in this conference is on Functional and logic programming. the topics include: the hard-won lessons of the fifth generation computer project;from sets to bits in coq;from proposition to program;the boolean constraint solver of SWI-prolog;probabilistic inference by program transformation in Hakaru;space-efficient planar acyclicity constraints;executable relational specifications of polymorphic type systems using prolog;proof relevant corecursive resolution;a coq library for internal verification of running-times;a transformational approach to parametric accumulated-cost static profiling;polymorphic types in erlang function specifications;declarative foreign function binding through generic programming;incremental computing with abstract data structures and declarative programming with algebra.

关键词：

来源：评论

学校读者我要写书评

暂无评论

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

ISBN: (纸本)9783319232638

the proceedings contain 48 papers. the special focus in this conference is on logic programming and Nonmonotonic Reasoning. the topics include: Stable models for temporal theories;algorithmic decision theory meets logic;relational and semantic data mining;shift design with answer set programming;advances in WASP;improving coordinated SMT-based system synthesis by utilizing domain-specific heuristics;integrating ASP into ROS for reasoning in robots;automated inference of rules with exception from past legal cases using ASP;solving constraint satisfaction problems with answer set programming;a theory of intentions for intelligent agents;answer set programming modulo acyclicity;a framework for goal-directed query evaluation with negation;implementing preferences with asprin;diagnosing automatic whitelisting for dynamic remarketing ads using hybrid ASP;performance tuning in answer set programming;enablers and inhibitors in causal justifications of logic programs;efficient problem solving on tree decompositions using binary decision diagrams;knowledge acquisition via non-monotonic reasoning in distributed heterogeneous environments;a formal theory of justifications;a new computational logic approach to reason with conditionals;interactive debugging of non-ground ASP programs;linking open-world knowledge bases using nonmonotonic rules;ASP, amalgamation, and the conceptual blending workflow;diagnostic reasoning for robotics using action languages;connecting object-oriented and logic programming;reasoning with forest logic programs using fully enriched automata;ASP solving for expanding universes and combining heuristics for configuration problems using answer set programming;infinitary equilibrium logic and strong equivalence and compacting boolean formulae for inference in probabilistic logic programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming

引用

BIOSYSTEMS 2016年 149卷 139-153页

作者： Ostrowski, M. Pauleve, L. Schaub, T. Siegel, A. Guziolowski, C. Univ Potsdam Potsdam Germany INRIA Rennes France Univ Paris Sud LRI UMR 8623 CNRS Orsay France Univ Rennes 1 CNRS IRISA UMR 6074 Rennes France CNRS IRCCyN UMR 6597 Ecole Cent Nantes Nantes France

Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks;for a larger case study, our method provides optimal answers after 7 min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. (C) 2016 Elsevier Ireland Ltd. All rights reserved.

关键词： Model identification Time series data Multiplex phosphoproteomics data Boolean networks Answer Set programming

来源：评论

学校读者我要写书评

暂无评论

CCA 2016 - 13th international conference on Computability and Complexity in Analysis - Proceedings

CCA 2016 - 13th International Conference on Computability an...

引用

13th international conference on Computability and Complexity in Analysis, CCA 2016

the proceedings contain 19 papers. the topics discussed include: the real numbers in homotopy type theory;undecidability of the spectral gap;choices that we face: the good, the bad and the recursive;variants of layerwise computability;on the computational content of Vitali's covering theorem;continuous reductions on quasi-polish spaces and self-dual sets;Whitney's extension theorem and projection operators;exact real arithmetic with perturbation analysis and proof of correctness;representations for feasibly approximable functions;on sequentially compact choice and overt choice;on formal verification in imperative multi-valued programming over continuous data types;a topological view on algebraic computation models;and representations of analytic functions and Weihrauch degrees.

关键词：

来源：评论

学校读者我要写书评

暂无评论

13th IFIP WG 1.3 international Workshop on Coalgebraic Methods in Computer Science, CMCS 2016 Colocated with Satellite Event of the Joint conference on theory and Practice of Software, ETAPS 2016

引用

13th IFIP WG 1.3 international Workshop on Coalgebraic Methods in Computer Science, CMCS 2016 Colocated with Satellite Event of the Joint conference on theory and Practice of Software, ETAPS 2016

ISBN: (纸本)9783319403694

the proceedings contain 13 papers. the special focus in this conference is on Coalgebraic Methods in Computer Science. the topics include: Fixed points of functors;compositional coinduction with sized types;lawvere categories as composed props;transitivity and difunctionality of bisimulations;affine monads and side-effect-freeness;duality of equations and coequations via contravariant adjunctions;category theoretic semantics for theorem proving in logic programming;product rules and distributive laws;on the logic of generalised metric spaces;a complete logic for behavioural equivalence in coalgebras of finitary set functors;coalgebraic completeness-via-canonicity;relational lattices via duality and on local characterization of global timed bisimulation for abstract continuous-time systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scheduling Home Hospice Care with logic-Based Benders Decomposition 1

引用

13th international conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming (CPAIOR)

作者： Heching, Aliza Hooker, John N. Compassionate Care Hosp Grp New York NY USA Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (数字)9783319339542

ISBN: (纸本)9783319339542;9783319339535

We propose an exact optimization method for home hospice care staffing and scheduling, using logic-based Benders decomposition (LBBD). the objective is to match hospice care aides with patients and schedule visits to patient homes, so as to maximize the number of patients serviced by available staff, while meeting requirements of the patient plan of care and scheduling constraints imposed by the patients and the staff. the Benders master problem assigns aides to patients and days of the week and is solved by mixed integer programming (MIP). the routing and scheduling subproblem decouples by aide and day of the week and is solved by constraint programming. We report preliminary computational results for problem instances obtained from a major hospice care provider. We find that LBBD is superior to state-of-the-art MIP and solves problems of realistic size, if the aim is to conduct staff planning on a rolling basis while maintaining continuity of the care arrangement for patients currently receiving service.

关键词： Home health care problem Routing and scheduling logic-based Benders decomposition Home hospice care

来源：评论

学校读者我要写书评

暂无评论

13th international conference on Integration of AI and OR Techniques in Constraint programming, CPAIOR 2016

13th International Conference on Integration of AI and OR Te...

引用

13th international conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming, CPAIOR 2016

ISBN: (纸本)9783319339535

the proceedings contain 29 papers. the special focus in this conference is on Integration of AI and OR Techniques in Constraint programming. the topics include: On CNF encodings of decision diagrams;time-series constraints: improvements and application in CP and MIP contexts;decomposition based on decision diagrams;logic-based decomposition methods for the travelling purchaser problem;lagrangian decomposition via sub-problem search;non-linear optimization of business models in the electricity market;weighted spanning tree constraint with explanations;application to an energy cost-aware production planning problem for tissue manufacturing;cyclic routing of unmanned aerial vehicles;parallelizing constraint programming with learning;parallel composition of scheduling solvers;rail capacity modelling with constraint programming;scheduling home hospice care with logic-based benders decomposition;a global constraint for mining sequential patterns with GAP constraint;a reservoir balancing constraint with applications to bike-sharing;optimization models for a real-world snow plow routing problem;a stochastic continuous optimization backend for MiniZinc with applications to geometrical placement problems;balancing nursing workload by constraint programming;designing spacecraft command loops using two-dimension vehicle routing;constraint programming approach for spatial packaging problem;detecting semantic groups in MIP Models;revisiting two-sided stability constraints;optimal flood mitigation over flood propagation approximations;a bit-vector solver with word-level propagation;a new solver for the minimum weighted vertex cover problem and optimal upgrading schemes for effective shortest paths in networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling and Solving the Soft Constraints for Supply Chain Problems Using the Hybrid Approach 13th

引用

13th international conference on Distributed Computing and Artificial Intelligence (DCAI)

作者： Sitek, Pawel Kielce Univ Technol Dept Informat Syst Kielce Poland

ISBN: (纸本)9783319401621;9783319401614

Many real-life problems in Supply Chain (SC) are over-constrained. Insufficient resources and time requirements result in an inability to all constraints. In some cases, their fulfillment requires very intensive computing. One way to overcome these difficulties is to soften some of the constraints. Natural environment for the modeling and solving of problems with constraints is constraint programming (CP), which is, however, ineffective on optimization problems and constraints containing a sum of many decision variables. this is when the idea to hybridize CP and other environments originated. the article presents the concept of modeling and solving soft constraints in SC problems using the hybrid approach. the illustrative example provided in the paper illustrates effectiveness and possibilities of this approach.

关键词： Soft constrains Constraint logic programming Optimization Mathematical programming Supply Chain

来源：评论

学校读者我要写书评

暂无评论

logic-Based Decomposition Methods for the Travelling Purchaser Problem 1

引用

13th international conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming (CPAIOR)

作者： Booth, Kyle E. C. Tran, Tony T. Beck, J. Christopher Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada

ISBN: (数字)9783319339542

ISBN: (纸本)9783319339542;9783319339535

We present novel branch-and-check and logic-based Benders decomposition techniques for the Travelling Purchaser Problem, an important optimization problem with applications in vehicle routing, logistics, and warehouse management. Our master problem determines a set of markets and directed travel arcs that satisfy product purchase constraints with relaxed travel costs. Our subproblem identifies subtours within this master assignment and produces a set of generalized subtour elimination cuts. We show that the proposed technique demonstrates strong performance on the asymmetric problem variants, finding optimal solutions to previously unsolved instances, while performing competitively on a number of symmetric problem classes. Furthermore, our model is implemented unchanged for the four problem variants whereas other state-of-the-art approaches are variant-specific.

关键词： Vehicle routing

来源：评论

学校读者我要写书评

暂无评论

Minaturized Safety PLC on a Chip for Industrial Control Applications 13th

引用

13th international conference on Distributed Computing and Artificial Intelligence (DCAI)

作者： Hayek, Ali Boercsoek, Josef Univ Kassel Dept Elect Engn & Comp Sci Chair Comp Architecture & Syst Programming Kassel Germany

ISBN: (纸本)9783319401621;9783319401614

In this paper a safety programmable logic controller as a single chip solution is presented. the presented control system is based on a certified application specific integrated circuit for safety-critical applications according to the safety standard IEC 61508 second Edition, meeting the safety integrity level SIL3. Furthermore, SIL3 compliant operating system and middleware are also briefly presented in this paper. A further main focus of this paper is led on the graphical programming in application development is provided by graphical integrated development environment for configuring and programming the safety controller. the presented safety solution is freely configurable and programmable using graphical interface and achieves flexible, compact, low-cost and yet advanced process control and automation for safety related applications.

关键词： Safety systems Control systems Real-time systems Systems-on-hip

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：