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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

88 篇 期刊文献
83 篇 会议
3 册 图书
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

160 篇 工学
- 140 篇 计算机科学与技术...
- 70 篇 软件工程
- 21 篇 电气工程
- 12 篇 信息与通信工程
- 9 篇 控制科学与工程
- 3 篇 仪器科学与技术
- 2 篇 机械工程
- 2 篇 动力工程及工程热...
- 2 篇 石油与天然气工程
- 1 篇 力学（可授工学、理...
- 1 篇 电子科学与技术（可...
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
29 篇 理学
- 22 篇 数学
- 3 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 科学技术史(分学科...
8 篇 管理学
- 6 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
3 篇 哲学
- 1 篇 哲学
2 篇 教育学
- 2 篇 教育学
1 篇 农学
1 篇 医学
- 1 篇 基础医学(可授医学...

主题

177 篇 declarative prog...
18 篇 logic programmin...
11 篇 answer set progr...
8 篇 prolog
6 篇 imperative progr...
6 篇 constraint progr...
5 篇 constraints
5 篇 programming lang...
5 篇 artificial intel...
5 篇 program complete...
5 篇 programming lang...
4 篇 program correctn...
4 篇 languages
4 篇 extensible middl...
4 篇 search
4 篇 metadata
4 篇 multidimensional...
4 篇 separation of co...
3 篇 cartesian progra...
3 篇 parallelism

机构

6 篇 univ pisa dept c...
3 篇 univ penn philad...
3 篇 linkoping univ d...
3 篇 univ new s wales...
3 篇 polish acad sci ...
2 篇 univ malaga lcc ...
2 篇 vrije universite...
2 篇 univ texas arlin...
2 篇 linkoping univ i...
2 篇 rise kista
2 篇 cau kiel inst in...
2 篇 univ parma dipar...
2 篇 univ politecn va...
2 篇 univ turku turku
2 篇 polish acad sci ...
2 篇 univ bergen berg...
2 篇 univ kentucky co...
2 篇 univ americas pu...
2 篇 johns hopkins un...
2 篇 university of am...

作者

7 篇 forti stefano
7 篇 brogi antonio
5 篇 drabent wlodzimi...
4 篇 mancilla blanca
4 篇 plaice john
3 篇 ferrari gian-lui...
3 篇 hellerstein jose...
3 篇 calimeri frances...
3 篇 loo boon thau
3 篇 hanus michael
3 篇 germano stefano
3 篇 gopal sriram
2 篇 barash mikhail
2 篇 casadei roberto
2 篇 stevens reinout
2 篇 salvador lucas
2 篇 henderson chris
2 篇 varela carlos a.
2 篇 stokke knut ande...
2 篇 enrico pontelli

语言

162 篇 英文
14 篇 其他
1 篇 中文

检索条件"主题词=Declarative Programming"

共 177 条记录，以下是91-100 订阅

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

详细简洁

排序：

Prompt2DeModel: declarative Neuro-Symbolic Modeling with Natural Language 18th

Prompt2DeModel: Declarative Neuro-Symbolic Modeling with Nat...

引用

18th International Conference on Neural-Symbolic Learning and Reasoning (NeSy)

作者： Faghihi, Hossein Rajaby Nafar, Aliakbar Uszok, Andrzej Karimian, Hamid Kordjamshidi, Parisa Michigan State Univ E Lansing MI 48824 USA Florida Inst Human & Machine Cognit Pensacola FL USA

ISBN: (纸本)9783031711695;9783031711701

This paper presents a conversational pipeline for crafting domain knowledge for complex neuro-symbolic models through natural language prompts. It leverages large language models to generate declarative programs in the DomiKnowS framework. The programs in this framework express concepts and their relationships as a graph in addition to logical constraints between them. The graph, later, can be connected to trainable neural models according to those specifications. Our proposed pipeline utilizes techniques like dynamic in-context demonstration retrieval, model refinement based on feedback from a symbolic parser, visualization, and user interaction to generate the tasks' structure and formal knowledge representation. This approach empowers domain experts, even those not well-versed in ML/AI, to formally declare their knowledge to be incorporated in customized neural models in the DomiKnowS framework.

关键词： Neuro-Symbolic AI Code Generation Constraint Integration declarative programming Language to Code Generative AI Large Language Models

来源：评论

学校读者我要写书评

暂无评论

A System for Using Wireless Sensor Networks as Globally Deductive Databases

A System for Using Wireless Sensor Networks as Globally Dedu...

引用

4th Annual IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WIMOB)/SecPriWiMob/SAUCEWiMob/HWN-RMQWiMob/STWiMob

作者： Choochaisri, Supasate Intanagonwiwat, Chalermek Chulalongkorn Univ Dept Comp Engn Bangkok 10330 Thailand

ISBN: (纸本)9780769533933

Several research efforts have abstracted wireless sensor networks as relational databases whose data can be easily queried by users. However, none of these works includes recursive query mechanisms and globally logic reasoning techniques necessary for powerful uses as in deductive databases. In this paper, we propose an approach for abstracting wireless sensor networks as deductive databases that consist of rules, predicates, and logic-based queries. Our approach enables globally logic reasoning and data relating on a query that can be recursive or non-recursive. Additionally, the approach is more convenient to users because the users no longer need to be concerned about local behaviors of each sensor node. We also present LogicQ, an underlying system for disseminating and processing logic-based queries as well as collecting data in an energy-efficient manner. LogicQ uses a data filtering and suppressing technique that directly corresponds to an injected logic-based query for energy savings. Our performance analysis indicates that LogicQ can handle logic-based queries efficiently in terms of completeness and soundness while minimizing the energy consumption.

关键词： declarative programming Deductive Database Logic programming Recursive Query Processing Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

Webstrates, Codestrates v2, and Varv: A Software Stack for Computational Media 22

Webstrates, Codestrates v2, and Varv: A Software Stack for C...

引用

12th Nordic Conference on Human-Computer Interaction (NordiCHI)

作者： Borowski, Marcel Klokmose, Clemens N. Aarhus Univ Aarhus Denmark

ISBN: (纸本)9781450394482

Today's software often comes in the form of applications: rigid turn-key products, which usually cannot be modified by their users. Computational media is an alternative vision of software that is inherently extensible and collaborative. With the Webstrates platform, we started to explore computational media almost a decade ago. Recently, we added the Codestrates v2 development platform and the Varv programming model to Webstrates. Together the three components enable the creation of inherently extensible and collaborative software on the web. In this demonstration, we introduce these three components and showcase their potential in a series of examples.

关键词： Computational Media Webstrates Codestrates Malleability declarative programming

来源：评论

学校读者我要写书评

暂无评论

On Development Practices for End Users

On Development Practices for End Users

引用

Workshop on New Trends in Search Computing/Workshop on Search Computing Challenges and Directions

作者： Bozzon, Alessandro Brambilla, Marco Imran, Muhammad Daniel, Florian Casati, Fabio Politecn Milan Dipartimento Elettron & Informaz I-20133 Milan Italy Univ Trento I-38123 Povo TN Italy

ISBN: (纸本)9783642196676

The paper discusses some trends in end user programming (EUP) and takes inspiration from the discussions in a panel and in a vertical session on research evaluation within the second Search Computing workshop. We discuss the controversial successes and failures in this field and we elaborate on which facilities could foster adoption of end user programming. We discuss various dimensions of end user programming, including vertical versus horizontal language definition, declarative versus imperative approaches. We exemplify our discussion in the realistic scenario of research evaluation by comparing the Search Computing and ResEval approaches.

关键词： crowd programming end user development mashup conceptual modeling declarative programming

来源：评论

学校读者我要写书评

暂无评论

On Completeness of Logic Programs 24th

On Completeness of Logic Programs

引用

24th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Drabent, Wlodzimierz Polish Acad Sci Inst Comp Sci PL-00901 Warsaw Poland Linkoping Univ IDA Linkoping Sweden

ISBN: (纸本)9783319178226;9783319178219

Program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the answers required by its specification. Little work has been devoted to reasoning about completeness. This paper presents a few sufficient conditions for completeness of definite programs. We also study preserving completeness under some cases of pruning of SLD-trees (e.g. due to using the cut). We treat logic programming as a declarative paradigm, abstracting from any operational semantics as far as possible. We argue that the proposed methods are simple enough to be applied, possibly at an informal level, in practical Prolog programming. We point out importance of approximate specifications.

关键词： Logic programming Program completeness declarative programming Approximate specification

来源：评论

学校读者我要写书评

暂无评论

GeneRHi-C: 3D GENomE Reconstruction from Hi-C data 10

GeneRHi-C: 3D GENomE Reconstruction from Hi-C data

引用

10th International Conference on Computational Systems-Biology and Bioinformatics (CSBio)

作者： MacKay, Kimberly Carlsson, Mats Kusalik, Anthony Univ Saskatchewan Dept Comp Sci Saskatoon SK Canada RISE Kista Sweden

ISBN: (纸本)9781450372152

Background: Many computational methods have been developed that leverage the results from biological experiments (such as Hi-C) to infer the 3D organization of the genome. Formally, this is referred to as the 3D genome reconstruction problem (3D-GRP). Hi-C data is now being generated at increasingly high resolutions. As this resolution increases, it has become computationally infeasible to predict a 3D genome organization with the majority of existing methods. None of the existing solution methods have utilized a non-procedural programming approach (such as integer programming) despite the established advantages and successful applications of such approaches for predicting high-resolution 3D structures of other biomolecules. Our objective was to develop a new solution to the 3D-GRP that utilizes non-procedural programming to realize the same advantages. Results: In this paper, we present a three-step consensus method (called GeneRHi-C;pronounced "generic") for solving the 3D-GRP which utilizes both new and existing techniques. Briefly, (1) the dimensionality of the 3D-GRP is reduced by identifying a biologically plausible, ploidy-dependent subset of interactions from the Hi-C data. This is performed by modelling the task as an optimization problem and solving it efficiently with an implementation in a non-procedural programming language. The second step (2) generates a biological network (graph) that represents the subset of interactions identified in the previous step. Briefly, genomic bins are represented as nodes in the network with weighted-edges representing known and detected interactions. Finally, the third step (3) uses the ForceAtlas 3D network layout algorithm to calculate (x, y, z) coordinates for each genomic region in the contact map. The resultant predicted genome organization represents the interactions of a population-averaged consensus structure. The overall workflow was tested with Hi-C data from Schizosaccharomyces pombe (fission yeast). The resul

关键词： 3D Genome Reconstruction Problem Mathematical Modelling declarative programming Integer programming Network Layouts

来源：评论

学校读者我要写书评

暂无评论

Formal description of web user interfaces for automatic generation

Formal description of web user interfaces for automatic gene...

引用

3rd International Conference on Web Information Systems and Technologies

作者： Cannella, Vincenzo Peri, Daniele Pirrone, Roberto Ardizzone, Edoardo Univ Palermo DINFO Viale Sci I-90128 Palermo Italy

ISBN: (纸本)9789728865788

In this work we present an extension of a paradigm for abstract description of user interfaces using data structures described in the Set Description Language (SDL). An experimental software system for the automatic design and generation of web client interfaces has been developed too, which makes use of the Extended SDL (ESDL). At first, an interface is described at the highest level of abstraction through the data it operates on, and it is generated in a way that enforces data correctness. Generation of interfaces is executed by an expert system on the basis of a set of rules expressed in first order logic. The development of the system relies on AJAX technology, which makes the developing process adaptive and allows the feasibility of dynamic web interfaces.

关键词： SDL interface design declarative programming model-view-control paradigm Prolog AJAX Web

来源：评论

学校读者我要写书评

暂无评论

ProFL: A Fault Localization Framework for Prolog 2020

ProFL: A Fault Localization Framework for Prolog

引用

29th ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA)

作者： Thompson, George Sullivan, Allison K. North Carolina A&T State Univ Greensboro NC 27411 USA Univ Texas Arlington Arlington TX 76019 USA

ISBN: (纸本)9781450380089

Prolog is a declarative, first-order logic that has been used in a variety of domains to implement heavily rules-based systems. However, it is challenging to write a Prolog program correctly. Fortunately, the SWI-Prolog environment supports a unit testing framework, plunit, which enables developers to systematically check for correctness. However, knowing a program is faulty is just the first step. The developer then needs to fix the program which means the developer needs to determine what part of the program is faulty. ProFL is a fault localization tool that adapts imperative-based fault localization techniques to Prolog's declarative environment. ProFL takes as input a faulty Prolog program and a plunit test suite. Then, ProFL performs fault localization and returns a list of suspicious program clauses to the user. Our toolset encompasses two different techniques: ProFLs, a spectrum-based technique, and ProFLm, a mutation-based technique. This paper describes our Python implementation of ProFL, which is a commandline tool, released as an open-source project on GitHub (https://***/geoorge1d127/ProFL). Our experimental results show ProFL is accurate at localizing faults in our benchmark programs.

关键词： Prolog Fault localization declarative programming

来源：评论

学校读者我要写书评

暂无评论

Blockchain's fame reaches the execution of personalized touristic itineraries 28

Blockchain's fame reaches the execution of personalized tour...

引用

28th IEEE International Conference on Enabling Technologies - Infrastructure for Collaborative Enterprises (WETICE)

作者： Brahem, Amina Messai, Nizar Sam, Yacine Bhiri, Sami Devogele, Thomas Gaaloul, Walid Univ Tours LIFAT Tours France Univ Tunis El Manar Natl Engn Sch Tunis OASIS Tunis Tunisia Univ Paris Saclay Telecom SudParis UMR 5157 Samovar Paris France

ISBN: (纸本)9781728106762

Blockchain trends cover more and more tech domains making it one of the most used technologies in the last few years. This is due to two essential aspects. First, it is a distributed peer-to-peer network where there is no need for third part to execute operations between peers. Second, blockchain implements mechanisms to make the most data sensitive operations executed in a trusted way. Regarding these attractive aspects, we intend in this work to use the blockchain technology for the implementation of touristic itineraries. We consider the latter as process choreographies involving different participants. We intend to model and execute the touristic itineraries generated from a personalized trip planner called CART in raw XML format in a way that respects this collaborative aspect and resolves the problem of trust. We will propose a pattern and its transformation rules to reconstruct the itineraries presented in declarative annotations such as XML to smart contracts written in some smart contract-specific programming language called Solidity. Experimental results show promising perspectives of the deployment of the proposed solution to execute touristic plans.

关键词： Process choreography touristic itinerary blockchain smart contract declarative programming

来源：评论

学校读者我要写书评

暂无评论

S-Semantics-an Example 1

引用

31st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Drabent, Wlodzimierz Polish Acad Sci Inst Comp Sci Ul Jana Kazimierza 5 PL-01248 Warsaw Poland Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

ISBN: (数字)9783030988692

ISBN: (纸本)9783030988692;9783030988685

The s-semantics makes it possible to explicitly deal with variables in program answers. So it seems suitable for programs using nonground data structures, like open lists. However it is difficult to find published examples of using the s-semantics to reason about particular programs. Here we apply s-semantics to prove correctness and completeness of Fruhwirth's n queens program. This is compared with a proof, published elsewhere, based on the standard semantics and Herbrand interpretations.

关键词： Logic programming s-semantics Program correctness Program completeness declarative programming Specification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：