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

19th international conference on Inductive logic programming

作者： Torrey, Lisa Shavlik, Jude Univ Wisconsin Madison WI 53706 USA

ISBN: (纸本)9783642138393

We propose using a statistical-relational model, the Markov logic Network, for knowledge transfer in reinforcement learning. Our goal is to extract relational knowledge from a source task and use it to speed up learning in a related target task. We show that Markov logic Networks are effective models for capturing both source-task Q-functions and source-task policies. We apply them via demonstration, which involves using them for decision making in an initial stage of the target task before continuing to learn. through experiments in the RoboCup simulated-soccer domain, we show that transfer via Markov logic Networks can significantly improve early performance in complex tasks, and that transferring policies is more effective than transferring Q-functions.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Analyzing partially-implemented real-time systems

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1998年第8期24卷 602-614页

作者： Avrunin, GS Corbett, JC Dillon, LK Univ Massachusetts Dept Math & Stat Amherst MA 01003 USA Univ Hawaii Dept Informat & Comp Sci Honolulu HI 96822 USA Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA

Most analysis methods for real-time systems assume that all the components of the system are at roughly the same stage of development and can be expressed in a single notation, such as a specification or programming language. there are, however, many situations in which developers would benefit from tools that could analyze partially-implemented systems, those for which some components are given only as high-level specifications while others are fully implemented in a programming language. In this paper, we propose a method for analyzing such partially-implemented real-time systems. Here we consider real-time concurrent systems for which some components are implemented in Ada and some are partially specified using regular expressions and Graphical Interval logic (GIL), a real-time temporal logic. We show how to construct models of the partially-implemented systems that account for such properties as run-time overhead and scheduling of processes, yet support tractable analysis of nontrivial programs. the approach can be fully automated, and we illustrate it by analyzing a small example.

关键词： real-time concurrency static analysis Ada temporal logic hybrid systems Graphical Interval logic

来源：评论

学校读者我要写书评

暂无评论

logic for programming, Artificial Intelligence, and Reasoning 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Ken McMillan Aart Middeldorp Andrei Voronkov

ISBN: (数字)9783642452215

ISBN: (纸本)9783642452208

this book constitutes the proceedings of the 19th international conference on logic for programming, Artificial Intelligence and Reasoning, LPAR-19, held in December 2013 in Stellenbosch, South Africa. the 44 regular papers and 8 tool descriptions and experimental papers included in this volume were carefully reviewed and selected from 152 submissions. the series of international conferences on logic for programming, Artificial Intelligence and Reasoning (LPAR) is a forum where year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields and to exchange ideas in a scientifically emerging part of the world.

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

来源：评论

学校读者我要写书评

暂无评论

SELP - A system for studying strong equivalence between logic programs

SELP - A system for studying strong equivalence between logi...

引用

3rd international Workshop on Answer Set programming: Advances in theory and Implementation, ASP 2005, Co-located Event with the 19th international Joint conference on Artificial Intelligence, IJCAI 2005

作者： Chen, Yin Lin, Fangzhen Li, Lei Department of Computer Science South China Normal University China Software Institute Sun Yat-Sen University China Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

this paper describes a system called SELP for studying strong equivalence in answer set logic programming. the basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. this allows us to investigate some interesting properties of strong equivalence, such as a complete characterization for a rule to be strongly equivalent to another one, and checking whether a given set of rules is strongly equivalent to another, perhaps simpler set of rules.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Analyzing partially-implemented real-time systems 97

Analyzing partially-implemented real-time systems

引用

19th international conference on Software Engineering (ICSE 97) - Pulling Together

ISBN: (纸本)9780897919142

关键词： real-time concurrency static analysis Ada temporal logic hybrid systems Graphical Interval logic

来源：评论

学校读者我要写书评

暂无评论

Extending conceptual logic programs with arbitrary rules

Extending conceptual logic programs with arbitrary rules

引用

作者： Heymans, Stijn Van Nieuwenborgh, Davy Vermeir, Dirk Dept. of Computer Science Vrije Universiteit Brussel VUB Pleinlaan 2 B1050 Brussels Belgium

We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason with both ontological and rule-based knowledge, which is illustrated by simulating reasoning in an expressive description logic (DL) equipped with DL-safe rules. Furthermore, ECLPs are more expressive in the sense that they enable nonmonotonic reasoning, a desirable feature in locally closed subareas of the Semantic Web.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

A logic-Based Approach to Relation Extraction from Texts

A Logic-Based Approach to Relation Extraction from Texts

引用

19th international conference on Inductive logic programming

作者： Horvath, Tamas Paass, Gerhard Reichartz, Frank Wrobel, Stefan Univ Bonn Dept Comp Sci 3 D-5300 Bonn Germany Fraunhofer IAIS Sch Birlinghoven St Augustin Germany

ISBN: (纸本)9783642138393

In recent years, text mining has moved far beyond the classical problem of text classification with an increased interest in more sophisticated processing of large text corpora, such as, for example, evaluations of complex queries. this and several other tasks are based on the essential step of relation extraction. this problem becomes a typical application of learning logic programs by considering the dependency trees of sentences as relational structures and examples of the target relation as ground atoms of a target predicate. In tins way, each example is represented by a definite first-order Horn-clause. We show that an adaptation of Plotkin's least general generalization (LGG) operator can effectively be applied to such clauses and propose a simple and effective divide-and-conquer algorithm for listing a certain set of LGGs. We use these LGGs to generate binary features and compute the hypothesis by applying SVM to the feature vectors obtained. Empirical results on the ACE-2003 benchmark dataset indicate that the performance of our approach is comparable to state-of-the-art kernel methods.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Source-tracking unification 19th

引用

19th international conference on Automated Deduction, CADE 2003

作者： Choppella, Venkatesh Haynes, Christopher T. Computer Science Department Indiana University BloomingtonIN47405 United States

ISBN: (纸本)3540405593

We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugging unification-based systems, including the diagnosis of ill-typed programs and the generation of success and failure proofs in logic programming. the objects of source-tracking are deductions in the logic of unification. the semantics of deductions are paths over a unification graph whose labels form the language of suffixes of a semi-Dyck set. Based on this framework, two algorithms for generating proofs are presented: the first uses context-free shortest-path algorithms to generate optimal (shortest) proofs in time O(n3), where n is the number of vertices of the unification graph. the second algorithm integrates easily with standard unification algorithms, entailing an overhead of only a constant factor, but generates non-optimal proofs. these non-optimal proofs may be further simplified by group rewrite rules. © Springer-Verlag Berlin Heidelberg 2003.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Automated implementation of Petri Nets on PLCs with OOP 19

Automated implementation of Petri Nets on PLCs with OOP

引用

19th IEEE international conference on Emerging Technology and Factory Automation (ETFA)

作者： Basile, Francesco Chiacchio, Pasquale Coppola, Jolanda Gerbasio, Diego Univ Salerno Dipartimento Ing Informaz Ing Elettr & Matemat Ap Salerno Italy

ISBN: (纸本)9781479948451

In this paper a method is proposed to implement controllers and supervisors for manufacturing systems designed by Petri Nets (PNs) on Programmable logic Controllers (PLCs) using Object Oriented programming (OOP). In the resulting program each instruction is directly related to the evaluation of a transition, to the update of the marking, or to the enabling of a transition. this preserves the structure of PNs and entails reusability since it allows the user to easily modify the program directly, starting from the modifications made to the PN design.

关键词： Petri nets manufacturing systems object-oriented programming programmable controllers OOP PLC PN design object oriented programming program modification programmable logic controllers Arrays Heating IEC standards Object oriented modeling Reactive power Software XML

来源：评论

学校读者我要写书评

暂无评论

Sensor-based Petri net modeling for PLC stage programming of discrete-event control design

Sensor-based Petri net modeling for PLC stage programming of...

引用

19th IEEE international conference on Robotics and Automation (ICRA)

作者： Peng, SS Zhou, MC Department of Mechanical Engineering Chinese Military Academy Taiwan Taiwan

ISBN: (纸本)0780372727

Petri nets have been extensively applied for specification, design, verification, performance evaluation, and simulation of discrete event control systems (DECS). this paper proposes a real-time stage Petri net (RTSPN), to represent the stage programming of a programmable logic controller (PLC) for DECS. the new technique is able to simplify the design process of the complex PLC program without considering the interlocking problem within the ladder diagram. An illustrated example is used to explore the new methodology. the proposed method contains the power and flexibility of the Petri net analysis. It is believed that this technique is significant for the industry practice.

关键词： Petri nets programmable logic controller flexible machining cell

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：