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

3rd international workshop on Graph Structures for knowledge representation and Reasoning, GKR 2013

作者： Labra Gayo, Jose Emilio Jeuring, Johan Álvarez Rodríguez, Jose María University of Oviedo Spain Utrecht University Open University of the Netherlands Netherlands South East European Research Center Greece

ISBN: (纸本)9783319045337

rdF is one of the cornerstones of the Semantic Web. It can be considered as a knowledge representation common language based on a graph model. In the functional programming community, inductive graphs have been proposed as a purely functional representation of graphs, which makes reasoning and concurrent programming simpler. In this paper, we propose a simplified representation of inductive graphs, called Inductive Triple Graphs, which can be used to represent rdF in a purely functional way. We show how to encode blank nodes using existential variables, and we describe two implementations of our approach in Haskell and Scala. © Springer international Publishing Switzerland 2014.

关键词： knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Formal reasoning with rough sets in multiple-source approximation systems

引用

international JOURNAL OF APPROXIMATE REASONING 2008年第2期49卷 466-477页

作者： Khan, Md. Aquil Banerjee, Mohua Indian Inst Technol Dept Math & Stat Kanpur 208016 Uttar Pradesh India

We focus on families of Pawlak approximation spaces, called multiple-source approximation systems (MSASs). These reflect the situation where information arrives from multiple sources. The behaviour of rough sets in MSASs is investigated - different notions of lower and upper approximations, and definability of a set in a MSAS are introduced. In this context, a generalized version of an information system, viz. multiple-source knowledge representation (KR)-system, is discussed. Apart from the indiscernibility relation which can be defined on a multiple-source KR-system, two other relations, viz. similarity and inclusion are considered. To facilitate formal reasoning with rough sets in MSASs, a quantified propositional modal logic LMSAS is proposed. Interpretations for sets of well-formed formulae (wffs) of LMSAS are defined on MSASs, and the various properties of rough sets in MSASs translate into logically valid wffs of the system. LMSAS is shown to be sound and complete with respect to this semantics. Some decidable problems are addressed. In particular, it is shown that for any LMSAS-wff alpha it is possible to check whether alpha is satisfiable in a certain class of interpretations with MSASs of a given finite cardinality. Moreover, it is also decidable whether any wff alpha is satisfiable in the class of all interpretations with MSASs having domain of a given finite cardinality. (C) 2008 Elsevier Inc. All rights reserved.

关键词： Approximation spaces Information systems Rough sets Modal logic First-order logic

来源：评论

学校读者我要写书评

暂无评论

Proposal of generalized rule programming model

Proposal of generalized rule programming model

引用

3rd workshop on knowledge Engineering and Software Engineering, KESE 2007 at the 30th German Conference on Artificial Intelligence, KI 2007

作者： Nalepa, Grzegorz J. Wojnicki, Igor Institute of Automatics AGH University of Science and Technology Al. Mickiewicza 30 30-059 Kraków Poland

Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic programming approaches. No generic solution for using rules to model business logic in classic software has been provided so far. In this paper a new approach for Generalized Rule-based programming (GREP) is given. It is based on a use of advanced rule representation called XTT, which includes an extended attribute-based language, a non-monotonic inference strategy, with explicit inference control on the rule level. The paper shows, how some typical programming constructions, as well as classic programs can be modelled in this approach. The paper also presents possibilities of efficient integration of this technique with existing software systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pattern discovery using semantic network analysis

Pattern discovery using semantic network analysis

引用

2012 3rd international workshop on Cognitive Information Processing, CIP 2012

作者： Burk, Robin Chappell, Alan Gregory, Michelle Joslyn, Cliff McGrath, Liam Battelle Memorial Institute 505 King Ave. Columbus OH 43201 United States Pacific Northwest National Laboratory P.O. Box 999 Richland WA United States

ISBN: (纸本)9781467318785

Cognitive information processing at higher conceptual levels requires a computational approach to knowledge representation and analysis. Semantic network analysis bridges the gap between probabilistic pattern recognition techniques and symbolic representations by replacing cumbersome and computationally complex forms of logic-based semantic inference common in symbolic approaches with mathematical metrics on graph representations of labelled, directed semantic networked data. These metrics in turn support assessment of evidentiary support for the presence of patterns of interest in which entities play specified roles in complex event scenarios. The resulting system allows patterns to be specified at higher levels of conceptual abstraction while also remaining robust to conflicting and incomplete information. © 2012 IEEE.

关键词： knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Inferred Interactive Controls Through Provenance Tracking of ROS Message Data 3

Inferred Interactive Controls Through Provenance Tracking of...

引用

3rd IEEE/ACM international workshop on Robotics Software Engineering (RoSE)

作者： Witte, Thomas Tichy, Matthias Ulm Univ Inst Software Engn & Programming Languages Ulm Germany

ISBN: (纸本)9781665444743

Interactive controls that enrich visualizations need domain knowledge to create a sensible visual representation, as well as access to parameters and data to manipulate. However, source data and the means to visualize them are often scattered across multiple components, making it hard to link a value change in the interface to the appropriate source data. Provenance, the documentation of the origin and history of message data, can be used to reverse the evaluation of a value and change it at its source. We present a communication pattern as well as a C++ support library for ROS to track the provenance of message data across multiple nodes and apply source changes, reversing any transformation on the tracked data. We demonstrate that it is possible to automatically infer interactive 3D user interfaces from standard, non-interactive ROS visualizations by leveraging this additional tracking information. Preliminary results from a prototypical implementation of multiple origin tracking enabled ROS nodes indicate, that this tracking introduces a significant but still practicable message size and serialization performance overhead. To apply this tracking to existing C++ codebases only small, syntactic changes are necessary: a wrapper type around tracked values hides all necessary bookkeeping.

关键词： data provenance ROS source location tracking bidirectional evaluation interactive markers

来源：评论

学校读者我要写书评

暂无评论

logic, Algebra, and Geometry at the Foundation of Computer Science 3rd

Logic, Algebra, and Geometry at the Foundation of Computer S...

引用

3rd international Formal Methods Teaching workshop (FMTea) Held as Part of the 3rd World Congress on Formal Methods (FM)

作者： Hoare, Tony Mendes, Alexandra Ferreira, Joao F. Microsoft Res Cambridge England Univ Cambridge Comp Lab Cambridge England INESC TEC HASLab Porto Portugal Univ Beira Interior Dept Informat Covilha Portugal Univ Lisbon INESC ID Lisbon Portugal Univ Lisbon Inst Super Tecn Lisbon Portugal

ISBN: (纸本)9783030324414;9783030324407

This paper shows by examples how the Theory of programming can be taught to first-year CS undergraduates. The only prerequisite is their High School acquaintance with algebra, geometry, and propositional calculus. The main purpose of teaching the subject is to support practical programming assignments and projects throughout the degree course. The aims would be to increase the student's enjoyment of programming, reduce the workload, and increase the prospect of success.

关键词： Algebra logic Geometry Teaching formal methods Unifying theories of programming

来源：评论

学校读者我要写书评

暂无评论

Age Prediction through Pelvis X-Ray Images A Case Based approach to Problem Solving 3

Age Prediction through Pelvis X-Ray Images A Case Based appr...

引用

3rd international Conference on Mathematics and Computers in Sciences and in Industry (MCSI)

作者： Martins, Diana Vicente, Henrique Alves, Victor Neves, Jose Univ Minho Dept Informat Braga Portugal Univ Evora Escola Ciencias & Tecnol Dept Quim Evora Portugal Univ Minho Ctr Algoritmi Braga Portugal

ISBN: (纸本)9781509009732

It is well known that the dimensions of the pelvic bones depend on the gender and vary with the age of the individual. Indeed, and as a matter of fact, this work will focus on the development of an intelligent decision support system to predict individual's age based on pelvis' dimensions criteria. On the one hand, some basic image processing technics were applied in order to extract the relevant features from pelvic X-rays. On the other hand, the computational framework presented here was built on top of a logic programming approach to knowledge representation and reasoning, that caters for the handling of incomplete, unknown, or even self-contradictory information, complemented with a Case Base approach to computing.

关键词： Intelligent Systems Pelvis X-ray Images logic programming Case Based Computing

来源：评论

学校读者我要写书评

暂无评论

Structured Traversal of Search Trees in Constraint-logic Object-Oriented programming 22nd

Structured Traversal of Search Trees in Constraint-Logic Obj...

引用

22nd international Conference on Applications of Declarative programming and knowledge Management, INAP 2019, the 33rd workshop on logic programming, WLP 2019, and the 27th workshop on Functional and Constraint logic programming, WFLP 2019

作者： Dageförde, Jan C. Teegen, Finn ERCIS Leonardo-Campus 3 Münster48149 Germany Institut für Informatik CAU Kiel Kiel24098 Germany

ISBN: (纸本)9783030467135

In this paper, we propose an explicit, non-strict representation of search trees in constraint-logic object-oriented programming. Our search tree representation includes both the non-deterministic and deterministic behaviours of executing an application. Introducing such a representation facilitates the use of various search strategies. In order to demonstrate the applicability of our approach, we incorporate explicit search trees into the virtual machine of the constraint-logic object-oriented programming language Muli. We then exemplarily implement three search algorithms that traverse the search tree on-demand: depth-first search, breadth-first search, and iterative deepening depth-first search. In particular, the last two strategies allow for a complete search, which is novel in constraint-logic object-oriented programming and highlights our main contribution. Finally, we compare the implemented strategies using several benchmarks. © 2020, Springer Nature Switzerland AG.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Defeasible deontic model for intelligent simulation

Defeasible deontic model for intelligent simulation

引用

3rd international workshop on Computer Supported Activity Coordination, CSAC 2006 - In Conjunction with ICEIS 2006

作者： Nakamatsu, Kazumi School of H.S.E. Univ. Hyogo Himeji 670-0092 Japan

ISBN: (纸本)9728865538

We introduce an intelligent drivers' model for traffic simulation in a small area including some intersections, which is formalized in a paraconsistent annotated logic program EVALPSN. The intelligent drivers' model can infer drivers' speed control actions such as "slow down" based on EVALPSN defeasible deontic reasoning and deal with minute speed change of cars in the simulation system.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

3rd international workshop on Extensions of logic programming, ELP 1992

引用

3rd international workshop on Extensions of logic programming, ELP 1992

ISBN: (纸本)9783540564546

The proceedings contain 19 papers. The special focus in this conference is on Extensions of logic programming. The topics include: SLWV — A theorem prover for logic programming;a correct goal-directed proof procedure for a general logic program with integrity constraints;declarative semantics of hypothetical logic programming with negation as failure;conditional narrowing with constructive negation;logic programming with functions over order-sorted feature terms;a direct semantic characterization of RELFUN;embedding finite sets in a logic programming language;a modal framework for structured logic programs;metalogic for state oriented programming;on the semantics of inheritance in logic programming: compositionality and full abstraction;the abstract scheme for concurrent programming;the π-calculus as a theory in linear logic: preliminary results;natural deduction proof theory for logic programming;a typed foundation for directional logic programming;an architecture for prolog extensions;techniques for implementing contexts in logic programming;implementing a notion of modules in the logic programming language λprolog and a-sufficiency and the definiens operation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：