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

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

来源：评论

学校读者我要写书评

暂无评论

8th international Workshop on Reduction Strategies in Rewriting and programming, WRS 2008 and collocated with the 19th international conference on Rewriting Techniques and Applications, RTA 2008

8th International Workshop on Reduction Strategies in Rewrit...

引用

8th international Workshop on Reduction Strategies in Rewriting and programming, WRS 2008 and collocated with the 19th international conference on Rewriting Techniques and Applications, RTA 2008

the proceedings contain 8 papers. the special focus in this conference is on Rewriting Techniques and Applications. the topics include: New developments in environment machines;strategy-based rewrite semantics for membrane systems preserves maximal concurrency of rewrite actions;recognizing strategies;operational termination of conditional rewriting with built-in numbers and semantic data structures;completion as post-process in program inversion of injective functions;a transformational approach to prove outermost termination automatically;computing with diagrams in classical logic and closure of tree automata languages under innermost rewriting.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Knowledge-Directed theory Revision

Knowledge-Directed Theory Revision

引用

19th international conference on Inductive logic programming

作者： Ali, Kamal Leung, Kevin Konik, Tolga Choi, Dongkyu Shapiro, Dan Stanford Univ Ctr Study Language & Informat Cognit Syst Lab Stanford CA 94305 USA

ISBN: (纸本)9783642138393

Using domain knowledge to speed up learning is widely accepted but theory revision of such knowledge continues to use general syntactic operators. Using such operators for theory revision of teleoreactive logic programs is especially expensive in which proof of a top-level goal involves playing a game. In such contexts, one should have the option to complement general theory revision with domain-specific knowledge. Using American football as an example, we use Icarus' multi-agent teleoreactive logic programming ability to encode a coach agent whose concepts correspond to faults recognized in execution of the play and whose skills correspond to making repairs in the goals of the player agents. Our results show effective learning using as few as twenty examples. We also show that structural changes made by such revision can produce performance gains that cannot be matched by doing only numeric optimization.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Ideal Downward Refinement in the EL Description logic

Ideal Downward Refinement in the EL Description Logic

引用

19th international conference on Inductive logic programming

作者： Lehmann, Jens Haase, Christoph Univ Leipzig Dept Comp Sci Johannisgasse 26 D-04103 Leipzig Germany Oxford Univ Comp Lab Oxford England

ISBN: (纸本)9783642138393

With the proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledge bases grows, there is an increasing demand for tools assisting knowledge engineers in building up and maintaining their structure. For this purpose, concept learning algoritlans based on refinement operators have been investigated. In this paper, we provide an ideal refinement;operator for the description logic epsilon L and show that it is computationally feasible on large knowledge bases.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Policy Transfer via Markov logic Networks

Policy Transfer via Markov Logic Networks

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：