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

13th ACM/IEEE international conference on Cyber-Physical Systems (ICCPS )

作者： Karimi, Abolfazl Duggirala, Parasara Sridhar Univ N Carolina Chapel Hill NC 27515 USA

ISBN: (纸本)9781665409674

this paper presents a new framework for generating test-case scenarios for autonomous vehicles. We address two challenges in automatic test-case generation: first, a formal notion of test-case complexity, and second, an algorithm to generate more-complex test-cases. We characterize the complexity of a test-case by its set of solutions, and compare two complexities by the subset relation. the novelty of our definition is that it only relies on the pass-fail criteria of the test-case, rather than indirect or subjective assessments of what may challenge an ego vehicle to pass a test-case. Given a testcase, we model the problem of generating a more complex test-case as a constraint-satisfaction search problem. the search variables are the changes to the given test-case, and the search constraints define a solution to the search problem. the constraints include steering geometry of cars, the geometry of lanes, the shape of cars, traffic rules, bounds on longitudinal acceleration of cars, etc. To conquer the computational challenge, we divide the constraints to three categories and satisfy them with simulation, answer set programming, and SMT solving. We have implemented our algorithm using the Scenic libraries and the CARLA simulator and generate test-cases for several 3-way and 4-way intersections with different topologies. Our experiments demonstrate that both CARLA's autopilot and autopilot-plus-RSS (Responsibility-Sensitive Safety) can fail as the complexity of test-cases increase.

关键词： test-case complexity test-case generation traffic rules logic programming Answer Set programming Bezier curves SMT CARLA Scenic

来源：评论

学校读者我要写书评

暂无评论

13th international conference on Computer Aided Verification, CAV 2001

引用

13th international conference on Computer Aided Verification, CAV 2001

ISBN: (纸本)3540423451

the proceedings contain 48 papers. the special focus in this conference is on Model Checking and theorem Proving. the topics include: Software documentation and the verification process;certifying model checkers;formalizing a JVML verifier for initialization in a theorem prover;automated inductive verification of parameterized protocols;a practical approach to coverage in model checking;a fast bisimulation algorithm;symmetry and reduced symmetry in model checking;transformation-based verification using generalized retiming;a decomposed representation for layered symbolic manipulation of boolean functions;divide and conquer combinational logic equivalence VERification with false negative elimination;finite instantiations in equivalence logic with uninterpreted functions;model-checking with formula-dependent abstract models;verifying network protocol implementations by symbolic refinement checking;automatic abstraction for verification of timed circuits and systems;automated verification of a randomized distributed concensus protocol using cadence SMV and PRISM;analysis of recursive state machines;parameterized verification with automatically computed inductive assertions;a validity checker for the logic of equality with uninterpreted functions and memories, exploiting positive equality, and conservative transformations;automatic generation, verification, and implementation of security protocols;integrated canonizer and solver;a toolset for analysing algebraic specifications;a parallel verification platform for concurrent systems;the SLAM toolkit;iterating transducers;attacking symbolic state explosion;a unifying model checking approach for safety properties of parameterized systems;a BDD-based model checker for recursive programs;model checking the world wide web;the temporal logic sugar and a tool for reachability analysis of complex systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance tuning in answer set programming 1

引用

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

作者： Buddenhagen, Matthew Lierler, Yuliya University of Nebraska at Omaha OmahaNE United States

ISBN: (数字)9783319232645

ISBN: (纸本)9783319232638

Performance analysis and tuning are well established software engineering processes in the realm of imperative programming. this work is a step towards establishing the standards of performance analysis in the realm of answer set programming – a prominent constraint programming paradigm. We present and study the roles of human tuning and automatic configuration tools in this process. the case study takes place in the realm of a real-world answer set programming application that required several hundred lines of code. Experimental results suggest that human-tuning of the logic programming encoding and automatic tuning of the answer set solver are orthogonal (complementary) issues. © Springer international Publishing Switzerland 2015.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Cooperation of Algebraic Constraint Domains in Higher-Order Functional and logic programming

Cooperation of Algebraic Constraint Domains in Higher-Order ...

引用

13th international conference on Algebraic Methodology and Software Technology

作者： del Vado Virseda, Rafael Univ Complutense Madrid Dpto Sistemas Informat & Computac E-28040 Madrid Spain

ISBN: (纸本)9783642177958

this paper presents a theoretical framework for the integration of the cooperative constraint solving of several algebraic domains into higher-order functional and logic programming on A-abstractions, using an instance of a generic Constraint Functional logic programming (CFLP) scheme over a so-called higher-order coordination domain. We provide this framework as a powerful computational model for the higher-order cooperation of algebraic constraint domains over real numbers and integers, which has been useful in practical applications involving the hybrid combination of its components, so that more declarative and efficient solutions can be promoted. Our proposal of computational model has been proved sound and complete with respect to the declarative semantics provided by the CFLP scheme, and enriched with new mechanisms for modeling the intended cooperation among the algebraic domains and a novel higher-order constraint domain equipped with a sound and complete constraint solver for solving higher-order equations. We argue the applicability of our approach describing a prototype implementation on top of the constraint functional logic system TOY.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Characterizing Predicate Arity and Spatial Structure for inductive Learning of Game Rules 13

引用

13th European conference on Computer Vision (ECCV)

作者： Dwibedi, Debidatta Mukerjee, Amitabha Indian Inst Technol Kanpur 208016 Uttar Pradesh India

ISBN: (纸本)9783319161815;9783319161808

Where do the predicates in a game ontology come from? We use RGBD vision to learn a) the spatial structure of a board, and b) the number of parameters in a move or transition. these are used to define state-transition predicates for a logical description of each game state. Given a set of videos for a game, we use an improved 3D multi-object tracking to obtain the positions of each piece in games such as 4-peg solitaire or Towers of Hanoi. the spatial positions occupied by pieces over the entire game is clustered, revealing the structure of the board. Each frame is represented as a Semantic Graph with edges encoding spatial relations between pieces. Changes in the graphs between game states reveal the structure of a "move". Knowledge from spatial structure and semantic graphs is mapped to FOL descriptions of the moves and used in an inductive logic framework to infer the valid moves and other rules of the game. Discovered predicate structures and induced rules are demonstrated for several games with varying board layouts and move structures.

关键词： Predicate discovery Spatial structure discovery Game rule learning Semantic graphs Multi-object tracking Vision-based ontology discovery inductive logic programming Kinect

来源：评论

学校读者我要写书评

暂无评论

A new FMS simulator with object-oriented-programming techniques

引用

JOURNAL OF MATERIALS PROCESSING TECHNOLOGY 1998年第1-3期76卷 238-245页

作者： Li, XN Yuan, HB Huang, XY Cheung, EHM Nanjing Univ Sci & Technol Sch Mfg Engn Nanjing Peoples R China City Univ Hong Kong Dept Mfg Engn Kowloon Hong Kong

With the advance of research, design and operation of flexible manufacturing systems (FMS), new requirements have been presented for FMS simulators. these new requirements are high modelling efficiency, high model validity and credibility, more user-friendly features, real control and scheduling logic similar to a real FMS, and effective and correct analysis of results, etc. In this paper, a new FMS simulator (FMSSIM) based an object-oriented-programming (OOP) and some new techniques is introduced. the new techniques include: (i) fully interactive graphical modelling technique, with which the simulation modelling only needs 2-4 h to complete and thp model data are highly consistent and accurate;(ii) real FMS-like simulation control and scheduling, with which various control and scheduling algorithms such as Al-based heuristic scheduling can be easily implemented;(iii) the Intelligent Evaluator, with which the efficiency and accuracy of the evaluation process can be improved. Practical use has shown that the FMSSIM has a good performance in modelling, operation and evaluation. meeting the new requirements for a modern FMS simulator. (C) 1998 Elsevier Science S.A. All rights reserved.

关键词： flexible manufacturing system simulation simulator FMS simulation FMS modelling evaluation intelligent evaluation

来源：评论

学校读者我要写书评

暂无评论

Clause-learning for modular systems 13th

引用

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

作者： Mitchell, David Ternovska, Eugenia Computational Logic Laboratory Simon Fraser University Burnaby Canada

ISBN: (纸本)9783319232638

We present an algorithm, CDCL-AMS, for solving Modular Systems consisting of a set of modules where, for each module, we have a simple "black-box" solver. the algorithm is based on the Conflict- Directed Clause Learning algorithm for SAT, and communicates asynchronously with the black-box solvers to accommodate high variability in response latencies. © Springer international Publishing Switzerland 2015.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

FasTraC a decentralized traffic control system based on logic programming 13th

FasTraC a decentralized traffic control system based on logi...

引用

13th international conference on Automated Deduction, CADE 1996

作者： Felici, Giovanni Rinaldi, Giovanni Truemper, Klaus Rome Italy University of Texas at Dallas P.O. Box 830688 RichardsonTX75083-0688 United States CNR - IASI Istituto di Analisi dei Sistemi e Informatica Rome Italy

ISBN: (纸本)3540615113

the FasTraC system provides all facilities to design and validate a decentralized traffic control system for a urban network. Each signal is controlled by an independent control unit. the behavior of the control units is formulated in propositional logic using the quasi-English language of the Leibniz System for logic programming. the latter system compiles these formulations into algorithms that are executed by the control units. © Springer-Verlag Berlin Heidelberg 1996.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Infinitary equilibrium logic and strong equivalence 13th

引用

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

作者： Harrison, Amelia Lifschitz, Vladimir Pearce, David Valverde, Agustín University of Texas AustinTX United States Universidad Politéecnica de Madrid Madrid Spain University of Málaga Málaga Spain

ISBN: (纸本)9783319232638

Strong equivalence of logic programs is an important concept in the theory of answer set programming. Equilibrium logic was used to show that propositional formulas are strongly equivalent if and only if they are equivalent in the logic of here-and-there. We extend equilibrium logic to formulas with infinitely long conjunctions and disjunctions, define and axiomatize an infinitary counterpart to the logic of here-and-there, and show that the theorem on strong equivalence holds in the infinitary case as well. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：