this book constitutes the proceedings of the 19thinternationalconference on logic for programming, Artificial Intelligence and Reasoning, LPAR-19, held in December 2013 in Stellenbosch, South Africa. the 44 regular ...
详细信息
ISBN:
(数字)9783642452215
ISBN:
(纸本)9783642452208
this book constitutes the proceedings of the 19thinternationalconference 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 internationalconferences 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.
this paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. the basic function of the system is to check if two given ground disjunctive logic programs are equivalent, an...
详细信息
this paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. 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.
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 mem...
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.
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 k...
详细信息
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.
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 progra...
详细信息
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 logicprogramming 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.
Withthe 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 knowledg...
详细信息
ISBN:
(纸本)9783642138393
Withthe 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.
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 t...
详细信息
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 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...
详细信息
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.
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 learni...
详细信息
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.
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 l...
详细信息
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.
暂无评论