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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
23 篇 期刊文献
10 册 图书

馆藏范围

365 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

286 篇 工学
- 273 篇 计算机科学与技术...
- 190 篇 软件工程
- 19 篇 控制科学与工程
- 13 篇 电气工程
- 12 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 4 篇 电子科学与技术（可...
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 化学工程与技术
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 2 篇 土木工程
- 2 篇 农业工程
- 2 篇 生物工程
- 2 篇 安全科学与工程
87 篇 理学
- 71 篇 数学
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
- 2 篇 化学
37 篇 管理学
- 28 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 6 篇 工商管理
7 篇 医学
- 7 篇 临床医学
- 6 篇 基础医学(可授医学...
- 5 篇 药学(可授医学、理...
4 篇 教育学
- 4 篇 教育学
2 篇 农学
- 2 篇 作物学
1 篇 经济学
1 篇 法学
1 篇 文学

主题

86 篇 logic programmin...
29 篇 knowledge repres...
18 篇 semantics
13 篇 programming
12 篇 computer circuit...
10 篇 computer program...
9 篇 object oriented ...
9 篇 artificial intel...
9 篇 ontology
8 篇 logic gates
8 篇 mathematical log...
8 篇 functional progr...
6 篇 inductive logic ...
6 篇 programming tech...
6 篇 logics and meani...
6 篇 temporal logic
6 篇 logic design
4 篇 computer archite...
4 篇 logic
4 篇 logic circuits

机构

2 篇 genusion inc. am...
2 篇 computer science...
2 篇 univ adelaide sc...
2 篇 faculty of infor...
2 篇 department of co...
2 篇 dipartimento di ...
2 篇 univ minho ctr a...
2 篇 dlvsyst srl arca...
2 篇 listic universit...
2 篇 school of comput...
2 篇 vienna univ tech...
2 篇 school of softwa...
2 篇 open university ...
2 篇 centro algoritmi...
2 篇 facultad de mate...
2 篇 univ calabria de...
2 篇 etsii universida...
2 篇 university of wi...
2 篇 sri internationa...
2 篇 univ london impe...

作者

5 篇 vicente henrique
3 篇 dastani mehdi
3 篇 pereira luís mon...
3 篇 brain martin
3 篇 neves josé
3 篇 heymans stijn
3 篇 tompits hans
3 篇 de vos marina
2 篇 meseguer josé
2 篇 hommersom arjen
2 篇 durán f.
2 篇 porto antónio
2 篇 n. ajika
2 篇 leone nicola
2 篇 dell’acqua piera...
2 篇 de mel geeth
2 篇 madalina croitor...
2 篇 kelly peter m.
2 篇 dovier agostino
2 篇 hindriks koen v.

语言

357 篇 英文
8 篇 其他
4 篇 中文

检索条件"任意字段=3rd International Workshop on Logic Programming and Knowledge Representation"

共 365 条记录，以下是261-270 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

End-user development of knowledge bases for semi-automated formation of task cards 3

End-user development of knowledge bases for semi-automated f...

引用

3rd international workshop on Information, Computation, and Control Systems for Distributed Environments, ICCS-DE 2021

作者： Dorodnykh, N.O. Kotlov, Y.V. Nikolaychuk, O.A. Popov, V.M. Yurin, A.Y. 134 Lermontov str. Irkutsk664033 Russia 3 Kommunarov str. Irkutsk664003 Russia

The complexity of creating artificial intelligence applications remains high. One of the factors that cause such complexity is the high qualification requirements for developers in the field of programming. Development complexity can be reduced by using methods and tools based on a paradigm known as End-user development. One of the problems that requires the application of the methods of this paradigm is the development of intelligent systems for supporting the search and troubleshooting onboard aircraft. Some tasks connected with this problem are identified, including the task of dynamic formation of task cards for troubleshooting in terms of forming a list of operations. This paper presents a solution to this problem based on some principles of End-user development: model-driven development, visual programming, and wizard form-filling. In particular, an extension of the Prototyping expert systems based on transformations technology, which implements the End-user development, is proposed in the context of the problem to be solved for Sukhoi Superjet aircraft. The main contribution of the work is as follows: expanded the main technology method by supporting event trees formalism (as a popular expert method for formalizing scenarios for the development of problem situations and their localization);created a domain-specific tool (namely, Extended event tree editor) for building standard and extended event trees, including for diagnostic tasks;developed a module for supporting transformations of XML-like event tree representation format for the knowledge base prototyping system - Personal knowledge base designer. A description of the proposed extension and the means of its implementation, as well as an illustrative example, are provided. Copyright © 2021 for this paper by its authors.

关键词： Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

Three lessons in creating a knowledge base to enable reasoning, explanation and dialog 1

Three lessons in creating a knowledge base to enable reasoni...

引用

1st workshop on Natural Language Processing and Automated Reasoning, NLPAR 2013 - Co-located with 12th international Conference on logic programming and Nonmonotonic Reasoning, LPNMR 2013

作者： Chaudhri, Vinay K. Dinesh, Nikhil Inclezan, Daniela Artificial Intelligence Center SRI International Menlo ParkCA94025 United States

Our work is driven by the hypothesis that for a program to answer questions, explain the answers, and engage in a dialog just like a human does, it must have an explicit representation of knowledge. Such explicit representations occur naturally in many situations such as engineering designs created by engineers, a software requirement created in unified modeling language or a process flow diagram for a manufacturing process. Automated approaches based on natural language processing have progressed on tasks such as named entity recognition, fact extraction and relation learning. Use of automated methods can be problematic in situations where the conceptual distinctions used by humans for reasoning are not directly expressed in natural language or when the representation must be used to drive a high fidelity simulation. In this paper, we report on our effort to systematically curate a knowledge base for substantial fraction of text in a biology textbook [26]. While this experience and the process is interesting on its own, three aspects can be especially instructive for future development of knowledge bases by both manual and automatic methods: (1) Consider imposing a simplifying abstract structure on natural language sentences so that the surface form is closer to the target logical form to be extracted. (2) Adopt an upper ontology that is strongly motivated and influenced by natural language. (3) Develop a set of guidelines that captures how the conceptual distinctions in the ontology may be realized in natural language. Since the representation created by this process has been quite effective for answering questions and producing explanations, it gives a concrete target for what information should be extracted by the automated methods.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Projection and unification for conceptual graphs 3rd

引用

3rd international Conference on Conceptual Structures (ICCS 95)

作者： Willems, M Vrije Universiteit Amsterdam De Boelelaan 1081a Amsterdam 1081 HV Netherlands

ISBN: (纸本)3540601619

In this paper we will investigate subsumption and unification for structured descripitons by considering conceptual graphs with their projection and (maximal) join. The importance of projection for conceptual graphs is well-known as it essentially defines a partial order (subsumption hierarchy) on the graphs, that allows one to speed up search considerably. We investigate the complexity of projection by introducing a weaker notion of structural similarity, polyprojection. We prove that a polyprojection implies a projection for so-called non-repeating conceptual graphs. Furthermore, we show that a polyprojection can be determined by a polynomial algorithm. Indeed, the algorithm presented generalizes well-known algorithms for subtree isomorphism, and subsumption between feature term graphs. A maximal join is defined as the join on a maximally extended compatible projection. The operation is closely related to unification in feature logics and logic programming, but it is allows more flexibility of representation. In essence, a maximal join corresponds to the greatest lower bound of two conceptual graphs when the partial order due to projection is a lattice. Finally, unification of structured descriptions as maximal join is shown to be polynomially related to projection.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Behavioral and coinductive rewriting

Behavioral and coinductive rewriting

引用

The 3rd international workshop on Rewriting logic and its Applications

作者： Goguen, Joseph Lin, Kai Roşu, Grigore Computer Science and Engineering University of California at San Diego San Diego CA 92093 United States

Behavioral rewriting differs from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including notions like termination and confluence. We describe an efficient implementation of behavioral rewriting that uses standard rewriting. Circular coinductive rewriting combines behavioral rewriting with circular coinduction, giving a surprisingly powerful proof method for behavioral properties;it is implemented in the BOBJ system, which is used in our examples. These include several lazy functional stream program equivalences and a behavioral refinement. ©2000 Published by Elsevier Science B. V.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

3rd international workshop on New Approaches for Multidimensional Signal Processing, NAMSP 2022

3rd International Workshop on New Approaches for Multidimens...

引用

3rd international workshop on New Approaches for Multidimensional Signal Processing, NAMSP 2022

ISBN: (纸本)9789811978418

The proceedings contain 23 papers. The special focus in this conference is on New Approaches for Multidimensional Signal Processing. The topics include: Development of IoT Indoor Monitoring System for Independent Elderly;improving the Process of Evaluating User Stories Using the Paraconsistent Annotated Evidential logic Eτ;neural Network Algorithm Applied in Electrical Engineering Automation;Truss Structure Optimization Design Based on FE-PSO-SQP Algorithm;practice System of Ant Colony Optimization Algorithm in Business Administration;literature Review of Smart Contracts Using Blockchain Technology;a Comprehensive Study of 5th Generation Scheduling Algorithms;a Comparative Analysis of Homogeneous and Heterogeneous Protocols to Maximize the Lifetime of Wireless Sensor Network for Precision Agriculture;the Integration Development and Upgrading Path of Industry 4.0 Architecture Industrial Engineering Network Driven by Big Data;video Tracing of Moving Objects by Fusing Three-Term Decompositions;SAAS Application Prospect Analysis in Hrm and Methods to Upgrade the Contemporary System;All Digital Phase Locked Loop (ADPLL) and Its Blocks—A Comprehensive knowledge;on Realization of Smart Logistic Warehouse Management with Internet of Things;development and Design of Intelligent Traction System for Bulk Cargo Terminal;deep Learning Approaches for Classroom Audio Classification Using Mel Spectrograms;Tensor Spectral Pyramid for Color Video Sequences representation, Based on 3D FO-AHKLT;electromyography Signal Acquisition, Processing, Optimization and Its Applications;research on the Radar Signal Classification Method Based on the Deep Faith Network Model;measuring Machine Intelligence Using Black-Box-Based Universal Intelligence Metrics;COVID Detection Using ECG Image Reports: A Survey;disease Detection Techniques in Plants: Transition from Manual to Automation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An integrated architecture for surveillance and monitoring in an archaeological site 3

An integrated architecture for surveillance and monitoring i...

引用

3rd ACM international workshop on Video Surveillance and Sensor Networks, VSSN 2005

作者： Ardizzone, Edoardo La Cascia, Marco Lo Re, Giuseppe Ortolani, Marco DINFO - University of Palermo Viale delle Scienze ed. 6 Palermo90128 Italy

ISBN: (纸本)1595932429

This paper describes an on-going work aimed at designing and deploying a system for the surveillance and monitoring of an archaeological site, namely the "Valley of the Temples" in Agrigento, Italy. Given the relevance of the site from an artistical and historical point of view, it is important to protect the monuments from malicious or simply incautious behavior;however, the vastity of the area to be monitored and the vague definition of its boundaries make it unpractical to provide extensive coverage through traditional sensors or similar devices. We describe the design of an architecture for the surveillance of the site and for the monitoring of the visitors' behavior consisting in an integrated framework of networked sensors and cameras. Information will be collected by a minimal set of cameras deployed only at critical spots and coupled with higher-performance wireless sensor nodes. Both sets of devices will be supported by more densely deployed lower-cost wireless sensor so that the system will fulfill the concurrent goals of being minimally intrusive and remaining both responsive and efficient. Sensed data will be processed locally whenever possible and convenient, or otherwise sent to a central intelligent unit that will perform further and more sophisticated analyses using a reasoning system, will infer a higher level representation of the outdoor environment, and finally will be able to fine-tune the action of remote devices. © 2005 ACM.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A comparison of logic-based infrastructures for concern detection and extraction

A comparison of logic-based infrastructures for concern dete...

引用

6th international Conference on Aspect-Oriented Software Development, AOSD'07

作者： Kniesel, Günter Hannemann, Jan T., Rho Institut für Informatik III Universität Bonn Bonn Germany Department of Graphics and Computer Science University of Tokyo Tokyo Japan

In this paper we evaluate logic code analysis and transformation frameworks for their suitability as basic infrastructures for fast detection and extraction of (crosscutting) concerns. Using design patterns as example concerns, we identify desirable properties that an infrastructure should fulfill. We then report our initial results of evaluating candidate systems with respect to these properties. We show how high precision design pattern detectors can be easily formulated as predicates that are evaluated in mere seconds even on the sources of large software systems, such as the Eclipse IDE. Although details still remain to be analyzed further, our current results suggest that the pair JTransformer & CTC is a good candidate for a general infrastructure, combining very good querying performance, scalability and short turn-around times with a seamless integration of querying and transformation capabilities. Copyright 2007 ACM.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Handling relations over finite domains in the rule-based system ELAN

Handling relations over finite domains in the rule-based sys...

引用

The 3rd international workshop on Rewriting logic and its Applications

作者： Ringeissen, Christophe LORIA-INRIA 615 rue du Jardin Botanique F-54602 Villers-les-Nancy Cedex France

We present a methodology for handling efficiently relations over small finite domains in the rule-based programming language ELAN. Usually, a relation is specified as a first-order formula (a constraint) interpreted in a given algebraic structure. The concept of rewriting allows us to implement an algebraic structure in a very elegant way, by using rules for defining operators and predicates. Hence, we can directly obtain a rule-based executable specification computing all tuples of a relation, but in most cases, the related computation is completely inefficient. Indeed, the specification of a relation involves conditional rules, and a lot of rewriting steps fail after being tried. In this paper, we use a constraint solver in finite algebras to transform a naive rule-based ELAN specification of a relation into an efficient rule-based ELAN program with only unconditional rules. Thus, the constraint solver enables us to improve the rule-based computation of a relation. ©2000 Published by Elsevier Science B. V.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Defeasible Reasoning with Prototype Descriptions: A New Preference Order 37

Defeasible Reasoning with Prototype Descriptions: A New Pref...

引用

37th international workshop on Description logics, DL 2024

作者： Sacco, Gabriele Bozzato, Loris Kutz, Oliver Fondazione Bruno Kessler Via Sommarive 18 Trento38123 Italy Free University of Bozen-Bolzano Piazza Domenicani 3 Bolzano39100 Italy DiSTA - Università dell’Insubria Via O. Rossi 9 Varese21100 Italy

The representation of defeasible information in Description logics is a well-known issue and many formal approaches have been proposed. However, in these proposals, little attention has been devoted to studying their capabilities in capturing the interpretation of typicality and exceptions from an ontological and cognitive point of view. In this regard, we are developing a model of defeasible knowledge for description logics based on combining ideas from prototype theory, weighted description logic (aka ‘tooth logic’), and earlier work on justifiable exceptions. This machinery is then used to determine exceptions in case of conflicting axioms. In this paper, we analyse this formalisation with respect to some interesting cases where the defeasible properties to which we may have exceptions are also present as features in prototype descriptions. The analysis will suggest that a new preference order, which considers what happens inside the models, may be best suited and we outline how this new preference order can be defined. © 2024 Copyright for this paper by its authors.

关键词： Many valued logics

来源：评论

学校读者我要写书评

暂无评论

QuickFOIL: Scalable inductive logic programming

QuickFOIL: Scalable inductive logic programming

引用

3rd workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd international Conference on Very Large Data Bases, VLDB 2006

作者： Zeng, Qiang Patel, Jignesh M. Page, David University of Wisconsin-Madison United States

learning technique that learns first-order rules from relationalstructured data. However, to-date most ILP systems can only be applied to small datasets (tens of thousands of examples). A long-standing challenge in the field is to scale ILP methods to larger data sets. This paper presents a method called QuickFOIL that addresses this limitation. QuickFOIL employs a new scoring function and a novel pruning strategy that enables the algorithm to find highquality rules. QuickFOIL can also be implemented as an in-rdBMS algorithm. Such an implementation presents a host of query processing and optimization challenges that we address in this paper. Our empirical evaluation shows that QuickFOIL can scale to large datasets consisting of hundreds of millions tuples, and is often more than order of magnitude more efficient than other existing approaches. © 2014 VLDB Endowment 2150-8097/14/11.

关键词： Inductive logic programming (ILP)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共37页 << < 23 24 25 26 27 28 29 30 31 32 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：