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

12th international conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013

作者： Gonçalves, Ricardo Alteres, José Júlio CENTRIA Dep. Informática Faculdade Ciências e Tecnologia Universidade Nova de Lisboa Portugal

ISBN: (纸本)9781627487665

Deontic logic programming (DLP) is a framework combining deontic logic and non-monotonic logic programming, and it is useful to represent and reason about normative systems. In this paper we propose an implementation for reasoning in DLP that combines, in a modular way, a reasoner for deontic logic with a reasoner for stable model semantics. Copyright © 2013, international Foundation for Autonomous Agents and Multiagent Systems (***). All rights reserved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Explaining clusters with inductive logic programming and linked data 12

Explaining clusters with inductive logic programming and lin...

引用

12th international Semantic Web conference, ISWC 2013

作者： Tiddi, Ilaria D'Aquin, Mathieu Motta, Enrico Knowledge Media Institute Open University United Kingdom

Knowledge Discovery consists in discovering hidden regularities in large amounts of data using data mining techniques. the obtained patterns require an interpretation that is usually achieved using some background knowledge given by experts from several domains. On the other hand, the rise of Linked Data has increased the number of connected cross-disciplinary knowledge, in the form of RDF datasets, classes and relationships. Here we show how Linked Data can be used in an inductive logic programming process, where they provide background knowledge for finding hypotheses regarding the unrevealed connections between items of a cluster. By using an example with clusters of books, we show how different Linked Data sources can be used to automatically generate rules giving an underlying explanation to such clusters.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

Characterization of logic program revision as an extension of propositional revision

引用

thEORY AND PRACTICE OF logic programming 2016年第1期16卷 111-138页

作者： Schwind, Nicolas Inoue, Katsumi Transdisciplinary Res Integrat Ctr Chiyoda Ku Tokyo 1018430 Japan Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan

We address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LP P a new LP Q. Based on the structure of SE interpretations, Delgrande et al. (2008. Proc. of the 11th international conference on Principles of Knowledge Representation and Reasoning (KR'08), 411-421;2013b. Proc. of the 12th international conference on logic programming and Nonmonotonic Reasoning (LPNMR'13), 264-276) adapted the well-known AGM framework (Alchourron et al. 1985. Journal of Symbolic logic 50, 2, 510-530) to LP revision. they identified the rational behavior of LP revision and introduced some specific operators. In this paper, a constructive characterization of all rational LP revision operators is given in terms of orderings over propositional interpretations with some further conditions specific to SE interpretations. It provides an intuitive, complete procedure for the construction of all rational LP revision operators and makes easier the comprehension of their semantic and computational properties. We give a particular consideration to LPs of very general form, i.e., the generalized logic programs (GLPs). We show that every rational GLP revision operator is derived from a propositional revision operator satisfying the original AGM postulates. Interestingly, the further conditions specific to GLP revision are independent from the propositional revision operator on which a GLP revision operator is based. Taking advantage of our characterization result, we embed the GLP revision operators into structures of Boolean lattices, that allow us to bring to light some potential weaknesses in the adapted AGM postulates. To illustrate our claim, we introduce and characterize axiomatically two specific classes of (rational) GLP revision operators which arguably have a drastic behavior. We additionally consider two more restricted forms of LPs, i.e., the disjunctive logic programs (DLPs) and the normal logic programs (NLPs) and adapt our characterization result t

关键词： belief revision logic programming characterization theorems

来源：评论

学校读者我要写书评

暂无评论

Extended Knowledge Graphs: A Conceptual Study 12

Extended Knowledge Graphs: A Conceptual Study

引用

12th international Joint conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K) / 12th international conference on Knowledge Engineering and Ontology Development (KEOD)

作者： Adrian, Weronika T. Adrian, Marek Kluza, Krzysztof Stachura-Terlecka, Bernadetta Ligeza, Antoni AGH Univ Sci & Technol Al A Mickiewicza 30 PL-30059 Krakow Poland

ISBN: (纸本)9789897584749

the amount and variety of data that we produce every day pose a constant challenge for meaningful information processing. While knowledge graphs have gained a considerable attention in the recent years, due to their flexible and universal knowledge representation, they lack the mechanisms facilitating knowledge processing. In this paper, we propose an information system called extended knowledge graphs (EKG) that augments the concept of knowledge graphs with procedural attachments. We put forward the requirements and assumption of the EKG structure and present a categorisation of supported reasoning tasks.

关键词： Knowledge Graphs Semantic Networks Knowledge Representation KRR Rules Ontologies Reasoning logic programming Answer Set programming Prolog

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Linear programming for Capacity Planning in Optical Networks

Fuzzy Linear Programming for Capacity Planning in Optical Ne...

引用

12th international conference on Transparent Optical Networks (ICTON)

作者： Kavian, Yousef S. Rejeb, Ridha Strobel, Otto Shahid Chamran Univ Fac Engn Ahvaz Iran Inst Adv Engn & Res Aachen Germany Esslingen Univ Appl Sci Esslingen am Neckar Germany

ISBN: (纸本)9781424477982

Capacity planning is a challenging issue for designing next generation optical core networks. this paper presents a fuzzy linear programming (FLP) approach for capacity planning in optical networks under long-term demand uncertainty where the information of traffic loads is imprecise by nature. the simplicity of fuzzy logic is integrated with linear programming for capacity planning in optical backbones. the uncertainties in demand matrix are represented by membership functions using alpha-cut concept to provide a mathematical framework for dealing with non statistical uncertainties. the proposed approach offers the ability of consideration all conditions for decision making in optical networks. Simulation results show the efficiency of fuzzy linear programming method for capacity planning in optical networks. the proposed approach could be extended for considering other uncertainty sources in capacity planning problem of optical networks such as objective function and constraints.

关键词： Optical networks capacity planning uncertainty fuzzy logic linear programming

来源：评论

学校读者我要写书评

暂无评论

Graphical development of software for programmable logic controllers

Graphical development of software for programmable logic con...

引用

12th international Power Electronics and Motion Control conference

作者： Folch, Jose Roger Perez, Juan Pineda, Manuel Puche, Ruben Univ Politecn Valencia Dept Elect Engn E-46071 Valencia Spain

ISBN: (纸本)9781424401208

Graphical languages are standard in the field of computer programming. Complex software development is best handled by graphically connecting pre-built, fully tested and highly specialized software components, instead of writing and debugging thousands of lines of code. Modern programming environments include complete libraries of such components. In the field of Programmable logic Controllers (PLCs), this is not the case. PLC programs can be developed using graphical languages, as Ladder Diagrams (LD) or Function Block Diagrams (FBD), but the standard libraries are very limited, so the programmer must develop his own libraries, building software objects from scratch. In this paper, a framework is presented for automatically building complex software modules using based on two key pillars: on the one hand, using object oriented concepts as encapsulation, inheritance and generic programming, and, in the other one, closely following the physical model of the objects used in building electrical control cabinets (ECBs).

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

PageRank, ProPPR, and Stochastic logic Programs 1

引用

24th international conference on inductive logic programming (ILP)

作者： Van Daele, Dries Kimmig, Angelika De Raedt, Luc Katholieke Univ Leuven Dept Comp Sci Leuven Belgium

ISBN: (数字)9783319237084

ISBN: (纸本)9783319237084;9783319237077

A key feature of ProPPR, a recent probabilistic logic language inspired by stochastic logic programs (SLPs), is its use of personalized PageRank for efficient inference. We adopt this view of probabilistic inference as a random walk over a graph constructed from a labeled logic program to investigate the relationship between these two languages, showing that the differences in semantics rule out direct, generally applicable translations between them.

关键词： Probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

Innovative Approaches in Teaching programming: A Systematic Literature Review 12

Innovative Approaches in Teaching Programming: A Systematic ...

引用

12th international conference on Computer Supported Education (CSEDU)

作者： Santos, Simone C. Tedesco, Patricia Azevedo Borba, Matheus Brito, Matheus Univ Fed Pernambuco Ctr Informat Rua Jornalista Anibal Fernandes S-NCidade Univ BR-50740560 Recife PE Brazil

ISBN: (纸本)9789897584176

One of the main challenges of computing education is the teaching of computer programming. Technical skills related to algorithm logic, programming language syntax, and computational platforms are required to program. In addition, several non-technical skills are required, enabling the student to understand and to interpret real problems, to work in groups and to strive for effective and efficient solutions. To meet these challenges, innovative teaching methodologies have been applied in teaching programming, building learning environments that are more conducive to the development of these skills. In order to understand how these methodologies are being used, this work presents the result of a systematic literature review, motivated by the following research question: "What are the innovative teaching and learning approaches to programming, how are they applied and what are the main results of their application? In this study, we considered three digital libraries and found 24 primary studies, following the Kitchenham methodology. these studies were categorized into 6 groups and highlighted challenges related to the problems addressed, teaching environment, content, human capital involved and assessment process. the studies also showed evidence of success cases, as well as open paths for new research.

关键词： Educational Innovation Teaching Computer programming Systematic Literature Review

来源：评论

学校读者我要写书评

暂无评论

Declarative programming for artificial intelligence applications 07

Declarative programming for artificial intelligence applicat...

引用

12th ACM SIGPLAN international conference on Functional programming

作者： Lloyd, John W. Australian Natl Univ Coll Engn & Comp Sci Canberra ACT Australia

ISBN: (纸本)9781595938152

In this talk, I will consider some possible extensions to existing functional programming languages that would make them more suitable for the important and growing class of artificial intelligence applications. First, I will motivate the need for these language extensions. then I will give some technical detail about these extensions that provide the logic programming idioms, probabilistic computation, and modal computation. Some examples will be given to illustrate these ideas which have been implemented in the Bach programming language that is an extension of Haskell.

关键词： languages design functional logic modal probabilistic programming

来源：评论

学校读者我要写书评

暂无评论

Plugging Numeric Similarity in First-Order logic Horn Clauses Comparison

Plugging Numeric Similarity in First-Order Logic Horn Clause...

引用

12th international conference of the Italian-Association-for-Artificial-Intelligence on Advances in Artificial Intelligence

作者： Ferilli, S. Basile, T. M. A. Di Mauro, N. Esposito, F. Univ Bari Dipartimento Informat I-70121 Bari Italy

ISBN: (纸本)9783642239533

Horn clause logic is a powerful representation language exploited in logic programming as a computer programming framework and in inductive logic programming as a formalism for expressing examples and learned theories in domains where relations among objects must be expressed to fully capture the relevant information. While the predicates that make up the description language are defined by the knowledge engineer and handled only syntactically by the interpreters, they sometimes express information that can be properly exploited only with reference to a suitable background knowledge in order to capture unexpressed and underlying relationships among the concepts described. this is typical when the representation includes numerical information, such as single values or intervals, for which simple syntactic matching is not sufficient. this work proposes an extension of an existing framework for similarity assessment between First-Order logic Horn clauses, that is able to handle numeric information in the descriptions. the viability of the solution is demonstrated on sample problems.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：