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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

高级检索

分类表

所选分类

>> <<

限定检索结果

标题

标题
作者
主题词
出版物名称
出版社
机构
学科分类号
摘要
ISBN
ISSN
基金资助
索书号

作者

作者
标题
主题词
出版物名称
出版社
机构
学科分类号
摘要
ISBN
ISSN
基金资助
索书号

文献类型

6,088 篇 会议
2,200 篇 期刊文献
99 册 图书
18 篇 学位论文
1 篇 科技报告

馆藏范围

8,402 篇 电子文献
6 种 纸本馆藏

日期分布

学科分类号

5,725 篇 工学
- 5,318 篇 计算机科学与技术...
- 3,509 篇 软件工程
- 566 篇 电气工程
- 304 篇 控制科学与工程
- 169 篇 信息与通信工程
- 84 篇 电子科学与技术（可...
- 59 篇 机械工程
- 39 篇 生物医学工程（可授...
- 39 篇 生物工程
- 36 篇 建筑学
- 29 篇 土木工程
- 26 篇 材料科学与工程（可...
- 25 篇 仪器科学与技术
1,422 篇 理学
- 1,258 篇 数学
- 118 篇 统计学（可授理学、...
- 75 篇 生物学
- 69 篇 系统科学
- 50 篇 物理学
- 26 篇 科学技术史(分学科...
594 篇 管理学
- 333 篇 图书情报与档案管...
- 294 篇 管理科学与工程(可...
- 118 篇 工商管理
64 篇 法学
- 39 篇 社会学
- 24 篇 法学
52 篇 哲学
- 36 篇 哲学
49 篇 教育学
- 44 篇 教育学
49 篇 医学
- 36 篇 基础医学(可授医学...
- 34 篇 临床医学
35 篇 文学
- 25 篇 外国语言文学
34 篇 农学
- 25 篇 作物学
25 篇 经济学
16 篇 艺术学
4 篇 历史学
2 篇 军事学

主题

8,406 篇 logic programmin...
603 篇 computer science
473 篇 computer languag...
339 篇 application soft...
306 篇 artificial intel...
244 篇 programming prof...
177 篇 computer archite...
173 篇 programmable log...
173 篇 hardware
168 篇 control systems
153 篇 computational mo...
153 篇 logic design
151 篇 prototypes
149 篇 concurrent compu...
148 篇 laboratories
144 篇 object oriented ...
144 篇 software enginee...
136 篇 functional progr...
130 篇 costs
129 篇 semantics

机构

33 篇 university of po...
31 篇 univ minho ctr a...
28 篇 tu wien austria
27 篇 new mexico state...
24 篇 univ pisa dipart...
23 篇 katholieke univ ...
22 篇 vienna univ tech...
19 篇 university of ca...
18 篇 univ kentucky de...
17 篇 univ potsdam pot...
17 篇 katholieke univ ...
15 篇 univ evora escol...
14 篇 suny stony brook...
14 篇 univ manchester ...
13 篇 texas tech univ ...
13 篇 university of co...
13 篇 univ minho dept ...
12 篇 univ maryland de...
12 篇 school of comput...
12 篇 univ london impe...

作者

82 篇 schaub torsten
57 篇 ricca francesco
54 篇 vicente henrique
51 篇 gebser martin
50 篇 eiter thomas
50 篇 neves jose
49 篇 woltran stefan
43 篇 faber wolfgang
39 篇 leone nicola
38 篇 son tran cao
37 篇 pontelli enrico
37 篇 cabalar pedro
31 篇 lifschitz vladim...
30 篇 gupta gopal
29 篇 denecker marc
28 篇 sakama chiaki
28 篇 maratea marco
26 篇 proietti maurizi...
26 篇 lierler yuliya
26 篇 inoue katsumi

语言

8,020 篇 英文
334 篇 其他
33 篇 中文
7 篇 日文
4 篇 俄文
2 篇 德文
2 篇 法文
2 篇 葡萄牙文
1 篇 斯洛伐克文
1 篇 土耳其文

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

共 8406 条记录，以下是381-390 订阅

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

详细简洁

排序：

相关度排序

相关度排序
时效性降序
时效性升序

On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth 26

On the Structural Complexity of Grounding - Tackling the ASP...

引用

26th European Conference on Artificial Intelligence, ECAI 2023

作者： Besin, Viktor Hecher, Markus Woltran, Stefan Tu Wien Austria Massachusetts Institute of Technology United States

ISBN: (纸本)9781643684369

Answer Set programming is widely applied research area for knowledge representation and for solving industrial domains. One of the challenges of this formalism focuses on the so-called grounding bottleneck, which addresses the efficient replacement of first-order variables by means of domain values. Recently, there have been several works in this direction, ranging from lazy grounding, hybrid solving, over translational approaches. Inspired by a translation from non-ground normal programs to ground disjunctive programs, we attack the grounding bottleneck from a more general angle. We provide a polynomial reduction for grounding disjunctive programs of bounded domain size by reducing to propositional epistemic logic programs (ELPs). By slightly adapting our reduction, we show new complexity results for non-ground programs that adhere to the measure treewidth. We complement these results by matching lower bounds under the exponential time hypothesis, ruling out significantly better algorithms. © 2023 The Authors.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Representative Answer Sets: Collecting Something of Everything 26

Representative Answer Sets: Collecting Something of Everythi...

引用

26th European Conference on Artificial Intelligence, ECAI 2023

作者： Böhl, Elisa Gaggl, Sarah Alice Rusovac, Dominik Logic Programming and Argumentation Group Tu Dresden Germany

ISBN: (纸本)9781643684369

Answer set programming (ASP) is a popular problem solving paradigm with applications in planning and configuration. In practice, the number of answer sets can be overwhelmingly high, which naturally causes interest in a concise characterisation of the solution space in terms of representative answer sets. We establish a notion of representativeness that refers to the entropy of specified target atoms within a collection of answer sets. Accordingly, we propose different approaches for collecting such representative answer sets, based on answer set navigation. Finally, we conduct experiments using our prototypical implementation, which reveals promising results. © 2023 The Authors.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Embarrassingly Greedy Inconsistency Resolution of Qualitative Constraint Networks 30

Embarrassingly Greedy Inconsistency Resolution of Qualitativ...

引用

30th International Symposium on Temporal Representation and Reasoning, TIME 2023

作者： Sioutis, Michael LIRMM UMR 5506 Université de Montpellier CNRS France

ISBN: (纸本)9783959772983

In this paper, we deal with inconsistency resolution in qualitative constraint networks (QCN). This type of networks allows one to represent and reason about spatial or temporal information in a natural, human-like manner, e.g., by expressing relations of the form x {is north of ∨ is east of} y. On the other hand, inconsistency resolution involves maximizing the amount of information that is consistent in a knowledge base;in the context of QCNs, this translates to maximizing the number of constraints that can be satisfied, via obtaining a qualitative solution (scenario) of the QCN that ignores/violates as few of the original constraints as possible. To this end, we present two novel approaches: a greedy constraint-based and an optimal Partial MaxSAT-based one, with a focus on the former due to its simplicity. Specifically, the greedy technique consists in adding the constraints of a QCN to a new, initially empty network, one by one, all the while filtering out the ones that fail the satisfiability check. What makes or breaks this technique is the ordering in which the constraints will be processed to saturate the empty QCN, and for that purpose we use many different strategies to form a portfolio-style implementation. The Partial MaxSAT-based approach is powered by Horn theory-based maximal tractable subsets of relations. Finally, we compare the greedy approach with the optimal one, commenting on the trade-off between obtaining repairs that are optimal and obtaining repairs in a manner that is fast, and make our source code available for anyone to use. 2012 ACM Subject Classification Theory of computation → Constraint and logic programming;Computing methodologies → Temporal reasoning © Michael Sioutis

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Reasoning about Ingredient Substitutions with Ontologies and Rules 17

Reasoning about Ingredient Substitutions with Ontologies and...

引用

17th International Rule Challenge and 7th Doctoral Consortium @ RuleM+RR, RuleML+RR-Companion 2023

作者： Adrian, Weronika T. Kutyla, Maciej Potoniec, Jędrzej Lawrynowicz, Agnieszka AGH University of Krakow Poland Poznan University of Technology Poland

Preparing healthy and delicious meals requires knowledge about the process, nutritional properties of the ingredients, and their combinations. When we face the need for substitution in a dish, e.g., for allergic or dietary reasons, we should know how removing one element and adding another influences the resulting experience. The paper proposes an ontology-based model for reasoning about ingredient substitution in food recipes, enhanced with a logic programming component for constraint satisfaction and optimization. This opens up possibilities for computer-aided decision support in the area of substitute recommendation. © 2023 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Prolog Education in Selected High Schools in Bulgaria

Prolog Education in Selected High Schools in Bulgaria

引用

2023 International Conference Automatics and Informatics, ICAI 2023

作者： Tabakova-Komsalova, Veneta Stoyanov, Ivan Kostadinova-Tzankova, Laska Dukovski, Atanas Ivanova, Tsvetomira University of Plovdiv 'Paisii Hilendarski' Plovdiv Bulgaria Information and Communication Technologies Bulgarian Academy of Sciences Sofia Bulgaria Institute of Information and Communication Technologies Bas Sofia Bulgaria Institute of Information and Communication Technologies Bulgarian Academy of Sciences Intelligent Systems Department Sofia Bulgaria Academy of Music Dance and Visual Arts 'Prof Asen Diamandiev' Plovdiv Bulgaria

ISBN: (纸本)9798350312911

2022 marks the 50th anniversary of the logic programming language Prolog. In this regard, the authors will join the international initiative known as 'Prolog Education and Thinking'. The initiative aims to acquaint students mainly with logical programming and Artificial Intelligence through the Prolog language. The article presents shortly the project called 'Digital Bulgaria in Prolog', with which we want to join the above-mentioned initiative. The main topic and the architecture of the supporting software are also presented. Furthermore, the beginning and the current state of the introduction of artificial intelligence education in two Bulgarian schools are briefly discussed. © 2023 IEEE.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Assessing Drivers’ Situation Awareness in Semi-Autonomous Vehicles 39

Assessing Drivers’ Situation Awareness in Semi-Autonomous V...

引用

39th International Conference on logic programming, ICLP 2023

作者： Suchan, Jakob Osterloh, Jan-Patrick Institute for Systems Engineering for Future Mobility Oldenburg Germany

Semi-autonomous driving, as it is already available today and will eventually become even more accessible, implies the need for driver and automation system to reliably work together in order to ensure safe driving. A particular challenge in this endeavour are situations in which the vehicle’s automation is no longer able to drive and is thus requesting the human to take over. In these situations the driver has to quickly build awareness for the traffic situation to be able to take over control and safely drive the car. Within this context we present a software and hardware framework to asses how aware the driver is about the situation and to provide human-centred assistance to help in building situation awareness. The framework is developed as a modular system within the Robot Operating System (ROS) with modules for sensing the environment and the driver state, modelling the driver’s situation awareness, and for guiding the driver’s attention using specialized Human Machine Interfaces (HMIs). A particular focus of this paper is on an Answer Set programming (ASP) based approach for modelling and reasoning about the driver’s interpretation and projection of the scene. This is based on scene data, as well as eye-tracking data reflecting the scene elements observed by the driver. We present the overall application and discuss the role of semantic reasoning and modelling cognitive functions based on logic programming in such applications. Furthermore we present the ASP approach for interpretation and projection of the driver’s situation awareness and its integration within the overall system in the context of a real-world use-case in simulated as well as in real driving. © Jakob Suchan and Jan-Patrick Osterloh.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Omega-Completeness of the logic of Here-and-There and Strong Equivalence of logic Programs 20

Omega-Completeness of the Logic of Here-and-There and Strong...

引用

20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023

作者： Fandinno, Jorge Lifschitz, Vladimir University of Nebraska Omaha United States University of Texas Austin United States

ISBN: (纸本)9781956792027

Theory of strongly equivalent transformations is an essential part of the methodology of representing knowledge in answer set programming. Strong equivalence of two programs can be sometimes characterized as the possibility of deriving the rules of each program from the rules of the other in some deductive system. This paper describes a system with this property for the language mini-GRINGO. The key to the proof is an ?-completeness theorem for the many-sorted logic of here-and-there. © 2023 Proceedings of the International Conference on Knowledge Representation and Reasoning. All rights reserved

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

logical English Demonstration 39

Logical English Demonstration

引用

39th International Conference on logic programming, ICLP 2023

作者： Kowalski, Robert Dávila, Jacinto Department of Computing Imperial College London United Kingdom Universidad de Los Andes Merida Venezuela

logical English (LE) is a natural language syntax for pure Prolog and other logic programming languages, such as ASP and s(CASP). Its main applications until now have been to explore the representation of a wide range of legal texts, helping to identify ambiguities, explore alternative representations of the same text, and compare the logical consequences of the alternatives. The texts include portions of loan agreements, accountancy law, Italian citizenship, EU law on criminal rights, International Swaps and Derivative contracts, and insurance contracts. The current implementation in SWI Prolog can be accessed at https://***. © 2023 Open Publishing Association. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck (Extended Abstract) 39

Body-Decoupled Grounding via Solving: A Novel Approach on th...

引用

39th International Conference on logic programming, ICLP 2023

作者： Besin, Viktor Hecher, Markus Woltran, Stefan TU Wien Austria Massachusetts Institute of Technology United States

Answer-Set programming (ASP) has seen tremendous progress over the last two decades and is nowadays successfully applied in many real-world domains. However, for certain problems, the well-known ASP grounding bottleneck still causes severe problems. This becomes virulent when grounding of rules, where the variables have to be replaced by constants, leads to a ground program that is too huge to be processed by the ASP solver. In this work, we tackle this problem by a novel method that decouples non-ground atoms in rules in order to delegate the evaluation of rule bodies to the solving process. Our procedure translates a non-ground normal program into a ground disjunctive program that is exponential only in the maximum predicate arity, and thus polynomial if this arity is bounded by a constant. We demonstrate the feasibility of this new method experimentally by comparing it to standard ASP technology in terms of grounding size, grounding time and runtime. © 2023 Open Publishing Association. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Sampling and probabilistic inference in D/Slps. 39

Sampling and probabilistic inference in D/Slps.

引用

39th International Conference on logic programming Workshops, ICLP Workshops 2023

作者： Angelopoulos, Nicos The Pirbright Institute United Kingdom

Stochastic logic programming (Slp) and Distributional logic programming (Dlp) are two closely related probabilistic logic programming formalisms that have been previously studied in the context of machine learning. The former is a restrictive form which has good parameter estimation results, while the latter is more expressive and has been used in the context of Bayesian machine learning. Although both formalisms have easily installed systems for performing the aforementioned machine learning tasks, these systems have previously no facilities for more general probabilistic inference over these probabilistic languages. Here we describe newly added facilities to both systems for sampling and probabilistic inference. We present unified ways to perform sampling, where SLD resolution is replaced by stochastic clause selection. Probabilistic inference where the probability of goals is calculated using standard SLD on augmented clauses. A number of simple and more complex examples are considered and for sampling we demonstrate stochastic properties by taking advantage a couple of auxiliary libraries that work well with the probabilistic packages considered here. initially, limitations of the expressivity of Slps are highlighted by juxtaposing it to the intuitive uniform membership program of Dlps. © 2023 CEUR-WS. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：