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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

511 篇 期刊文献
350 篇 会议
11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

824 篇 工学
- 790 篇 计算机科学与技术...
- 400 篇 软件工程
- 57 篇 电气工程
- 24 篇 信息与通信工程
- 24 篇 控制科学与工程
- 7 篇 机械工程
- 6 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 2 篇 仪器科学与技术
- 2 篇 航空宇航科学与技...
407 篇 理学
- 388 篇 数学
- 11 篇 生物学
- 9 篇 统计学（可授理学、...
- 5 篇 科学技术史(分学科...
- 2 篇 物理学
- 2 篇 地球物理学
- 2 篇 系统科学
- 1 篇 地理学
27 篇 管理学
- 23 篇 管理科学与工程(可...
- 2 篇 公共管理
- 2 篇 图书情报与档案管...
14 篇 哲学
- 8 篇 哲学
10 篇 法学
- 9 篇 法学
- 1 篇 社会学
7 篇 医学
- 3 篇 基础医学(可授医学...
- 2 篇 临床医学
5 篇 教育学
- 4 篇 教育学
- 2 篇 心理学(可授教育学...
4 篇 农学
1 篇 经济学
- 1 篇 应用经济学

主题

872 篇 answer set progr...
78 篇 logic programmin...
68 篇 knowledge repres...
36 篇 knowledge repres...
32 篇 nonmonotonic rea...
28 篇 artificial intel...
26 篇 equilibrium logi...
24 篇 inductive logic ...
23 篇 non-monotonic re...
21 篇 stable models
19 篇 stable model sem...
17 篇 stream reasoning
16 篇 aggregates
16 篇 computational co...
15 篇 strong equivalen...
12 篇 theory
11 篇 description logi...
11 篇 forgetting
11 篇 semantic web
11 篇 machine learning

机构

35 篇 univ potsdam pot...
19 篇 univ calabria ar...
17 篇 univ calabria de...
15 篇 sabanci univ fac...
14 篇 univ genoa dibri...
14 篇 univ calabria de...
12 篇 univ a coruna la...
12 篇 univ genoa genoa
11 篇 univ politecn ma...
11 篇 texas tech univ ...
11 篇 vienna univ tech...
11 篇 vrije univ bruss...
11 篇 new mexico state...
10 篇 tu wien austria
10 篇 univ calabria de...
10 篇 vienna univ tech...
10 篇 univ klagenfurt ...
10 篇 univ texas austi...
8 篇 macquarie univ d...
8 篇 univ calabria co...

作者

49 篇 schaub torsten
44 篇 alviano mario
43 篇 ricca francesco
36 篇 dodaro carmine
35 篇 cabalar pedro
32 篇 eiter thomas
29 篇 maratea marco
28 篇 leone nicola
28 篇 gebser martin
27 篇 calimeri frances...
24 篇 fandinno jorge
23 篇 erdem esra
22 篇 ianni giovambatt...
20 篇 lifschitz vladim...
20 篇 gupta gopal
19 篇 zangari jessica
19 篇 perri simona
18 篇 balduccini marce...
18 篇 lierler yuliya
18 篇 faber wolfgang

语言

849 篇 英文
18 篇 其他
2 篇 土耳其文
2 篇 中文
1 篇 斯洛伐克文

检索条件"主题词=Answer set Programming"

共 872 条记录，以下是761-770 订阅

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

详细简洁

排序：

Modelling the Outlier Detection Problem in ASP(Q) 24th

Modelling the Outlier Detection Problem in ASP(Q)

引用

24th International Conference on Practical Aspects of Declarative Languages, PADL 2022

作者： Bellusci, Pierpaolo Mazzotta, Giuseppe Ricca, Francesco University of Calabria Rende Italy

ISBN: (纸本)9783030944780

Knowledge discovery techniques had important impact in several relevant application domains. Among the most important knowledge discovery tasks is outlier detection. Outlier detection is the task of identifying anomalous individuals in a given population. This task is very demanding from the computational complexity point of view, being located in the second level of the polynomial hierarchy. Angiulli et al. in 2007 proposed to employ answer set programming (ASP) to compute outliers. Their solution is based on the saturation technique and, as a consequence, it is very hard to evaluate by ASP systems. In this paper we resort to answer set programming with Quantifiers (ASP(Q)) to provide a more declarative, compact and efficient modeling of the outlier detection problem. An experiment on syntetic benchmarks proves that our ASP(Q)-based solution can handle databases that are three order of magnitude larger than the ASP-based one proposed by Angiulli et al. © 2022, Springer Nature Switzerland AG.

关键词： answer set programming Knowledge representation Outlier detection

来源：评论

学校读者我要写书评

暂无评论

PickUp Planner: A Scheduling and Dynamic Routing Service for Connected Vehicles 4

PickUp Planner: A Scheduling and Dynamic Routing Service for...

引用

4th International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Feljan, Aneta Vulgarakis Bararsani, Azadeh Got, Nicholas Ericsson Res Stockholm Sweden Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781509064656

Scheduling is needed in a multitude of smart city domains, such as public transportation, logistics, organization of events and parts delivery in assembly lines. In this paper, we present the architecture and implementation of PickUp Planner, a service that enables scheduling and dynamic routing of connected vehicles for picking up number of users distributed in the city. The service dynamically reconfigures the routes of the vehicles based on real-time traffic condition information, which in turn is gathered from the road infrastructure and other connected vehicles registered to the service. The crux of the service is the usage of a novel vehicle routing and scheduling algorithm that combines clustering algorithms and answer set programming. Our evaluation shows that the algorithm decreases the total distance traveled by the vehicles, and therefore reduces fuel consumption and emissions from the vehicles. We also conclude that answer set programming solvers may not be the best choice for scenarios in which there is a high number of users to be served frequently.

关键词： vehicle routing and scheduling answer set programming clustering implementation service

来源：评论

学校读者我要写书评

暂无评论

A Semantic Characterization for ASP Base Revision 11th

A Semantic Characterization for ASP Base Revision

引用

11th International Conference on Scalable Uncertainty Management (SUM)

作者： Garcia, Laurent Lefevre, Claire Papini, Odile Stephan, Igor Wurbel, Eric Univ Angers LERIA Angers France Aix Marseille Univ CNRS UMR 7296 LSIS Marseille France

ISBN: (纸本)9783319675824;9783319675817

The paper deals with base revision for answer set programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision strategies, namely addition strategy or removal and/or addition strategy. These strategies allow one to define families of rule-based revision operators. The paper presents a semantic characterization of these families of revision operators in terms of answer sets. This characterization allows one to equivalently consider the evolution of syntactic logic programs and the evolution of their semantic content.

关键词： answer set programming Base revision Belief revision Belief change Non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Testing and debugging techniques for answer set solver development

Testing and debugging techniques for answer set solver devel...

引用

26th International Conference on Logic programming (ICLP)

作者： Brummayer, Robert Jarvisalo, Matti Johannes Kepler Univ Linz Inst Formal Models & Verificat Linz Austria Univ Helsinki Dept Comp Sci FIN-00014 Helsinki Finland

This paper develops automated testing and debugging techniques for answer set solver development. We describe a flexible grammar-based black-box ASP fuzz testing tool which is able to reveal various defects such as unsound and incomplete behavior, i.e. invalid answer sets and inability to find existing solutions, in state-of-the-art answer set solver implementations. Moreover, we develop delta debugging techniques for shrinking failure-inducing inputs on which solvers exhibit defective behavior. In particular, we develop a delta debugging algorithm in the context of answer set solving, and evaluate two different elimination strategies for the algorithm.

关键词： answer set programming answer set solvers testing debugging

来源：评论

学校读者我要写书评

暂无评论

Outpatient Day Service Operations: A Case Study Within Rheumatology Diseases Management 3rd

Outpatient Day Service Operations: A Case Study Within Rheum...

引用

3rd International Conference on Health Care Systems Engineering (HCSE)

作者： Ielpa, Giuseppe Guido, Rosita Conforti, Domenico Univ Calabria DIMEG Arcavacata Di Rende Italy

ISBN: (纸本)9783319661469;9783319661452

This work presents an innovative quantitative approach, based on an optimization model, to manage outpatient Day Service operations. The main objective of the research work is to maximize admitted patient flow in order to use available resources efficiently. The model is designed with the help of answer set programming and implemented in Datalog with Disjunction (DLV) system. As significant case study, we consider the Rheumatology domain. Preliminary results are presented.

关键词： Patient admission planning Access rules Priority Appointment scheduling answer set programming Day service

来源：评论

学校读者我要写书评

暂无评论

Reasoning support for risk prediction and prevention in independent living

Reasoning support for risk prediction and prevention in inde...

引用

24th International Conference on Logic programming (ICLP)

作者： Mileo, A. Merico, D. Bisiani, R. Univ Milano Bicocca NOMADIS Res Lab Dept Informat Syst & Commun I-20126 Milan Italy

In recent years there has been a growing interest in solutions for the delivery of clinical care for the elderly because of the large increase in aging population. Monitoring a patient in his home environment is necessary to ensure continuity of care in home settings, but, to be useful, this activity must not be too invasive for patients and a burden for caregivers. We prototyped a system called Secure and IN Dependent lIving (SINDI), focused on (a) collecting a limited amount of data about the person and the environment through Wireless Sensor Networks (WSN), and (b) inferring from these data enough information to support caregivers in understanding patients' well-being and in predicting possible evolutions of their health. Our hierarchical logic-based model of health combines data from different sources, sensor data, tests results, common-sense knowledge and patient's clinical profile at the lower level, and correlation rules between health conditions across upper levels. The logical formalization and the reasoning process are based on answer set programming. The expressive power of this logic programming paradigm makes it possible to reason about health evolution even when the available information is incomplete and potentially incoherent, while declarativity simplifies rules specification by caregivers and allows automatic encoding of knowledge. This paper describes how these issues have been targeted in the application scenario of the SINDI system.

关键词： answer set programming wireless sensor networks independent living prediction context-awareness knowledge representation dependency graph

来源：评论

学校读者我要写书评

暂无评论

Representing hybrid automata by action language modulo theories

Representing hybrid automata by action language modulo theor...

引用

33rd International Conference on Logic programming colocated with the 23rd International Conference on Principles and Practice of Constraint programming / 20th International Conference on Theory and Applications of Satisfiability Testing

作者： Lee, Joohyung Loney, Nikhil Meng, Yunsong Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85281 USA Houzz Inc Palo Alto CA USA

Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them. We show how to succinctly represent hybrid automata in an action language which in turn is defined as a high-level notation for answer set programming modulo theories-an extension of answer set programs to the firstorder level similar to the way satisfiability modulo theories (SMT) extends propositional satisfiability (SAT). We first show how to represent linear hybrid automata with convex invariants by an action language modulo theories. A further translation into SMT allows for computing them using SMT solvers that support arithmetic over reals. Next, we extend the representation to the general class of non-linear hybrid automata allowing even non-convex invariants. We represent them by an action language modulo ordinary differential equations, which can be compiled into satisfiability modulo ordinary differential equations. We present a prototype system CPLUS2ASPMT based on these translations, which allows for a succinct representation of hybrid transition systems that can be computed effectively by the state-of-the-art SMT solver dReal.

关键词： answer set programming Action languages Hybrid automata

来源：评论

学校读者我要写书评

暂无评论

A declarative approach to distributed computing: Specification, execution and analysis

A declarative approach to distributed computing: Specificati...

引用

29th International Conference on Logic programming ICLP

作者： Ma, Jiefei Le, Franck Wood, David Russo, Alessandra Lobo, Jorge Imperial Coll London London England IBM Corp Waston Lab Armonk NY 10504 USA ICREA Univ Pompeu Fabra Barcelona Spain

There is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (i) specified as action theories of fluents and actions;(ii) executed as collections of distributed state machines, where devices are abstracted as (input/output) automata that can exchange messages;and (iii) analysed using existing results on connecting causal theories and answer set programming. Results on the application of our approach to different classes of network protocols are also presented.

关键词： action theory answer set programming network protocols distributed computing

来源：评论

学校读者我要写书评

暂无评论

Degrees of Laziness in Grounding Effects of Lazy-Grounding Strategies on ASP Solving 15th

Degrees of Laziness in Grounding Effects of Lazy-Grounding S...

引用

15th International Conference on Logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Taupe, Richard Weinzierl, Antonius Friedrich, Gerhard Siemens AG Osterreich Vienna Austria Alpen Adria Univ Klagenfurt Klagenfurt Austria Vienna Univ Technol Inst Log & Computat Vienna Austria

ISBN: (纸本)9783030205287;9783030205270

The traditional ground-and-solve approach to answer set programming (ASP) suffers from the grounding bottleneck, which makes large-scale problem instances unsolvable. Lazy grounding is an alternative approach that interleaves grounding with solving and thus uses space more efficiently. The limited view on the search space in lazy grounding poses unique challenges, however, and can have adverse effects on solving performance. In this paper we present a novel characterization of degrees of laziness in grounding for ASP, i.e. of compromises between lazily grounding as little as possible and the traditional full grounding upfront. We investigate how these degrees of laziness compare to each other formally as well as, by means of an experimental analysis using a number of benchmarks, in terms of their effects on solving performance. Our contributions are the introduction of a range of novel lazy grounding strategies, a formal account on their relationships and their correctness, and an investigation of their effects on solving performance. Experiments show that our approach performs significantly better than state-of-the-art lazy grounding in many cases.

关键词： answer set programming Lazy grounding Heuristics

来源：评论

学校读者我要写书评

暂无评论

Formalizing and Reasoning About Supply Chain Contracts Between Agents 25th

Formalizing and Reasoning About Supply Chain Contracts Betwe...

引用

25th International Symposium on Practical Aspects of Declarative Languages (PADL)

作者： Flynn, Dylan Nadeau, Chasity Shantz, Jeannine Balduccini, Marcello Son, Tran Cao Griffor, Edward R. St Josephs Univ Philadelphia PA 19131 USA New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA Natl Inst Stand & Technol Gaithersburg MD 20899 USA

ISBN: (纸本)9783031248405;9783031248412

Inspired by the recent problems in supply chains, we propose an approach to declarative modeling of contracts between agents that will eventually support reasoning about resilience of and about ways to improve supply chains. Specifically, we present a high-level language for specifying and reasoning about contracts over action domains of agents. We assume that the behavior of the agents can be formally expressed through action theories and view a contract as a collection of constraints. Each constraint specifies the responsibility of an agent to achieve a certain result by a deadline. Each agent also has a mapping between constraints and the agent's concerns, i.e. issues that the agent is concerned about, which are modeled in accordance with the CPS Framework proposed by the National Institute of Standards and Technology. We discuss how common questions related to the fulfillment of a contract or the concerns of the agents can be answered and computed via answer set programming.

关键词： Specifying and reasoning about contracts Supply chain Cyber-Physical System Framework answer set programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 73 74 75 76 77 78 79 80 81 82 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：