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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

665 篇 会议
31 篇 期刊文献
19 册 图书

馆藏范围

714 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

638 篇 工学
- 633 篇 计算机科学与技术...
- 361 篇 软件工程
- 27 篇 电气工程
- 26 篇 控制科学与工程
- 20 篇 信息与通信工程
- 2 篇 材料科学与工程（可...
- 2 篇 建筑学
- 1 篇 电子科学与技术（可...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 轻工技术与工程
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 食品科学与工程（可...
- 1 篇 生物工程
141 篇 理学
- 131 篇 数学
- 6 篇 物理学
- 6 篇 系统科学
- 4 篇 统计学（可授理学、...
- 3 篇 生物学
- 1 篇 化学
29 篇 管理学
- 19 篇 图书情报与档案管...
- 11 篇 管理科学与工程(可...
- 2 篇 工商管理
4 篇 法学
- 4 篇 社会学
2 篇 教育学
- 2 篇 教育学
2 篇 文学
- 2 篇 外国语言文学
1 篇 哲学
- 1 篇 哲学
1 篇 农学

主题

251 篇 logic programmin...
47 篇 semantics
44 篇 answer set progr...
27 篇 computer circuit...
21 篇 knowledge repres...
19 篇 nonmonotonic rea...
18 篇 artificial intel...
16 篇 formal logic
11 篇 constraint progr...
9 篇 knowledge repres...
9 篇 mathematical log...
9 篇 atoms
9 篇 logics and meani...
9 篇 ontology
8 篇 answer-set progr...
8 篇 calculations
7 篇 software enginee...
7 篇 asp
7 篇 programming tech...
6 篇 description logi...

机构

19 篇 vienna univ tech...
11 篇 univ kentucky de...
10 篇 univ potsdam pot...
7 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 univ minho ctr a...
6 篇 university of po...
6 篇 univ potsdam ins...
5 篇 vienna universit...
5 篇 univ potsdam ins...
5 篇 univ a coruna la...
5 篇 tu wien austria
5 篇 univ genoa dibri...
5 篇 univ calabria ar...
5 篇 univ calabria de...
5 篇 univ alberta dep...
4 篇 university of ca...
4 篇 simon fraser uni...
4 篇 department of co...

作者

32 篇 schaub torsten
25 篇 gebser martin
22 篇 ricca francesco
18 篇 tompits hans
16 篇 woltran stefan
16 篇 eiter thomas
15 篇 leone nicola
14 篇 alviano mario
13 篇 faber wolfgang
12 篇 cabalar pedro
10 篇 inoue katsumi
9 篇 giordano laura
9 篇 lifschitz vladim...
9 篇 ianni giovambatt...
9 篇 calimeri frances...
9 篇 fink michael
8 篇 eiter t
8 篇 leite joao
8 篇 leone n
8 篇 son tran cao

语言

705 篇 英文
6 篇 其他
5 篇 中文

检索条件"任意字段=8th International Conference on Logic Programming and Nonmonotonic Reasoning"

共 715 条记录，以下是31-40 订阅

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

详细简洁

排序：

A Simulation for Supply Chains Contract Execution 17th

A Simulation for Supply Chains Contract Execution

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Tran, Long Son, Tran Cao Flynn, Dylan Balduccini, Marcello New Mexico State Univ Las Cruces NM 88003 USA St Josephs Univ Philadelphia PA 19131 USA

ISBN: (纸本)9783031742088;9783031742095

Supply chains exhibit complex dynamics and intricate dependencies among their components, whose understanding is crucial for addressing the challenges highlighted by recent global disruptions. this paper presents a novel multi-agent system designed to simulate supply chains, linking reasoning about dynamic domains and multi-agent systems to reasoning about the high-level primitives of the NIST CPS Framework. Our approach synthesizes existing research on supply chain formalization and integrates these insights with multi-agent techniques, employing a declarative approach to model interactions and dependencies. the simulation framework models a set of autonomous agents within a partially observable environment, and whose interactions are dictated by contracts. the system dynamically reconciles agents' actions, assessing their feasibility and consequences. Based on the state of the domain, the simulation framework also draws conclusions about the high-level notions of requirements and concerns of the NIST CPS Framework, which provide a uniform and domain-agnostic vocabulary for the understanding of such complex systems as supply chains.

关键词： Answer Set programming Dynamic Domains Multi-Agent Systems MAS Simulation Contract Formalization Supply Chains

来源：评论

学校读者我要写书评

暂无评论

Compiling Metric Temporal Answer Set programming 17th

Compiling Metric Temporal Answer Set Programming

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Becker, A. Cabalar, P. Dieguez, M. Hahn, S. Romero, J. Schaub, T. Univ A Coruna La Coruna Spain Univ Angers LERIA Angers France Univ Potsdam Potsdam Germany

ISBN: (纸本)9783031742088;9783031742095

We develop a computational approach to Metric Answer Set programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challenge is to maintain scalability when dealing with fine-grained timing constraints, which can significantly exacerbate ASP's grounding bottleneck. To address this issue, we leverage extensions of ASP with difference constraints, a simplified form of linear constraints, to handle time-related aspects externally. Our approach effectively decouples metric ASP from the granularity of time, resulting in a solution that is unaffected by time precision.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards Explainable Weather Forecasting through FastLAS 17th

Towards Explainable Weather Forecasting Through FastLAS

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Dreossi, Talissa Dovier, Agostino Formisano, Andrea Law, Mark Manzato, Agostino Russo, Alessandra Tait, Matthew Univ Udine Udine Italy ILASP Ltd London England ARPA FVG OSMER Udine Italy Imperial Coll London London England

ISBN: (纸本)9783031742088;9783031742095

Weather forecasting is important for saving lives, protecting property, and supporting economic activities. It provides timely warnings for severe weather, improves agricultural planning, and aids in disaster management. Neural networks and deep learning methods can achieve impressive accuracy in weather prediction, but their black-box nature lacks in explainability. To address this limitation, we investigated the potential of FastLAS, an Inductive logic programming (ILP) framework, to produce reliable and, more important, explainable weather predictions. FastLAS learns ASP programs whose syntax and structural semantics resemble natural human language, making them easily understandable and interpretable by humans. the supportedness of stable models allows a clear explanation of the predictions. Our empirical evaluation on data from an Italian weather forecasting center shows that our approach is capable of learning predictive models from small dataset (a few samples instead of the thousands needed by neural networks) achieving an accuracy higher than statistical machine learning base lines.

关键词： ILP logic programming AI Explainability

来源：评论

学校读者我要写书评

暂无评论

Using Learning from Answer Sets for Robust Question Answering with LLM 17th

Using Learning from Answer Sets for Robust Question Answerin...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Kareem, Irfan Gallagher, Katie Borroto, Manuel Ricca, Francesco Russo, Alessandra Univ Calabria Dept Math & Comp Sci Cosenza Italy Univ Chicago Chicago IL 60637 USA Imperial Coll London Dept Comp London England

ISBN: (纸本)9783031742088;9783031742095

Large Language Models (LLMs) lack the ability for commonsense reasoning and learning from text. In this work, we present a system, called LLM2LAS, for learning commonsense knowledge from story-based question and answering expressed in natural language. LLM2LAS combines the semantic parsing capability of LLMs with ILASP for learning commonsense knowledge expressed as answer set programs. LLM2LAS requires only few examples of questions and answers to learn general commonsense knowledge and correctly answer unseen questions. An empirical evaluation demonstrates the viability of our approach.

关键词： logic-based Learning Knowledge Representation Question and Answering (Q&A)

来源：评论

学校读者我要写书评

暂无评论

ASP-Based Large Neighborhood Prioritized Search for Course Timetabling 17th

ASP-Based Large Neighborhood Prioritized Search for Course T...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Sugimori, Irumi Inoue, Katsumi Nabeshima, Hidetomo Schaub, Torsten Soh, Takehide Tamura, Naoyuki Banbara, Mutsunori Nagoya Univ Nagoya Aichi Japan Natl Inst Informat Tokyo Japan Univ Yamanashi Kofu Yamanashi Japan Univ Potsdam Potsdam Germany Kobe Univ Kobe Hyogo Japan

ISBN: (纸本)9783031742088;9783031742095

We develop an approach to solve curriculum-based course timetabling (CB-CTT) problems with Large Neighborhood Prioritized Search (LNPS) based on Answer Set programming (ASP). LNPS is a metaheuristic that starts with an initial solution and then iteratively tries to obtain improved solutions by alternately destroying and prioritized searching for a current solution. Our approach relies on high-level domain-specific LNPS configurations for efficient CB-CTT solving, and both the grounding and solving tasks are delegated to a heuristically-driven answer set optimizer implementing the LNPS algorithm. the resulting system teaspoon-lnps demonstrates that LNPS can significantly enhance the solving performance of ASP for CB-CTT solving. Furthermore, we show the competitiveness of our declarative approach by empirically contrasting it to the best known bounds obtained by more dedicated algorithms.

关键词： Answer Set programming Large Neighborhood Prioritized Search Course Timetabling

来源：评论

学校读者我要写书评

暂无评论

Consequence Operators of Characterization logics - the Case of Abstract Argumentation 17th

Consequence Operators of Characterization Logics - The Case ...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Baurnann, Ringo Strass, Hannes Univ Leipzig Leipzig Germany Ctr Scalable Data Analyt & Artificial Intelligenc Dresden Germany Tech Univ Dresden Dresden Germany

ISBN: (纸本)9783031742088;9783031742095

the analysis of properties of consequence operators has been a very active field in the formative years of non-monotonic reasoning. One possible approach to do this is to start with a model-theoretic semantics and then to study the logical consequence relation induced by that semantics. In this paper we follow that approach and analyse resulting consequence operators of so-called characterization logics. Roughly speaking, a characterization logic characterizes, via its own notion of ordinary equivalence, another logic's notion of strong equivalence. For example, the logic of here and there is a characterization logic for answer set programs, because strong equivalence of the latter is characterized by ordinary equivalence of the former. In previous work, we showed that the consideration of finite knowledge bases only - a common assumption in the field of knowledge representation - guarantees the existence (and uniqueness) of characterization logics. In this paper, we apply this existence result to the field of abstract argumentation. We show that the associated consequence operator outputs a so-called reverse kernel, a useful construct that received comparably little attention in the literature so far. As an aside, we clarify that for several well-known logics, their canonical characterization consequence operators are well-behaved.

关键词： Characterization logic Strong Equivalence Abstract Argumentation

来源：评论

学校读者我要写书评

暂无评论

reasoning and Explanation Generation in Ad Hoc Collaboration Between Humans and Embodied AI 17th

Reasoning and Explanation Generation in Ad Hoc Collaboration...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Dodampegama, Hasra Sridharan, Mohan Univ Edinburgh Sch Informat Inst Percept Act & Behav Edinburgh Midlothian Scotland

ISBN: (纸本)9783031742088;9783031742095

An assistive embodied AI agent often has to collaborate with previously unseen humans. State of the art frameworks for such ad hoc teamwork use a large labeled dataset of prior observations to model the behavior of other agents and to determine the ad hoc (i.e., embodied AI) agent's behavior. these approaches do not support rapid incremental revisions or transparency, and the necessary resources (e.g., training examples, computation) are not readily available in practical domains. Our previous work introduced an architecture that enabled an ad hoc agent to choose its actions in simple simulated domains based on non-monotonic logical reasoning with prior domain knowledge and models learned from limited examples to predict the behavior of other agents. Here, we extend this architecture to enable an ad hoc embodied AI agent to collaborate with a human performing household tasks in a complex indoor environment, focusing on the ad hoc agent's ability to identify and reason with relevant knowledge, and provide relational descriptions as explanations of its behavior and that of the human. We evaluate our architecture's capabilities in VirtualHome, a realistic 3D simulation environment.

关键词： Ad hoc teamwork Non-monotonic logical reasoning Ecological rationality Explanation generation Embodied AI

来源：评论

学校读者我要写书评

暂无评论

Modelling Dialogues in a Concurrent Language for Argumentation 17th

Modelling Dialogues in a Concurrent Language for Argumentati...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Bistarelli, Stefano Chiara, Maria M. Taticchi, Carlo Univ Perugia Perugia Italy Univ G dAnnunzio Chieti Italy

ISBN: (纸本)9783031742088;9783031742095

In the fast-growing area of Artificial Intelligence (AI), the ability of autonomous agents to engage in complex debates is crucial for consensus building on beliefs, actions, or goals and forms the basis for applications in decision-making, planning, opinion polling, and negotiation. In this paper, we leverage the Timed Concurrent Language for Argumentation, a modelling language derived from concurrent programming paradigms and Argumentation theory, to introduce well-known high-level propositions (claim, counter, why, argue, concede, and retract) to model various debate forms, making it a powerful tool for agent interaction. the obtained constructs, specifically designed for multi-agent reasoning and the facilitation of argumentation, define the dialogue language DICLA (DIalogic Concurrent Language for Argumentation) that enables domain experts to employ advanced computational argumentation tools without needing programming skills, bridging the gap between theoretical argumentation models and practical, real-world applications.

关键词： Computational Argumentation Debates Concurrency Multi-agent reasoning

来源：评论

学校读者我要写书评

暂无评论

Monitoring and Scheduling of Semiconductor Failure Analysis Labs 17th

Monitoring and Scheduling of Semiconductor Failure Analysis ...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Mastria, Elena Pagliaro, Domenico Calimeri, Francesco Perri, Simona Pleschberger, Martin Schekotihin, Konstantin KAI GmbH Villach Austria Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy Univ Klagenfurt Dept AI & Cybersecur Klagenfurt Austria

ISBN: (纸本)9783031742088;9783031742095

Finding non-conformities, such as physical failures causing electrical malfunctioning of a device, in modern semiconductor devices is challenging. Highly qualified employees in a failure analysis (FA) lab typically use sophisticated and expensive tools like scanning electron microscopes to identify and locate such non-conformities. Given the increasing complexity of investigated devices and very limited resources, labs may struggle to deliver analysis results in time. this paper proposes an approach to optimize the usage of FA lab resources by combining constraint programming with stream reasoning enabling situation-dependent monitoring of the lab's conditions and schedule maintenance. Evaluation results indicate that our system can significantly improve the tardiness of real-world FA labs, and all its computational tasks can be finished in an average time of 3.6 s, with a maximum of 15.2 s, which is acceptable for the lab's workflows.

关键词： Scheduling Monitoring Stream reasoning Constraint programming

来源：评论

学校读者我要写书评

暂无评论

LTLf2ASP: LTLf Bounded Satisfiability in ASP 17th

LTLf2ASP: LTLf Bounded Satisfiability in ASP

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Fionda, Valeria Ielo, Antonio Ricca, Francesco Univ Calabria Arcavacata Di Rende CS Italy

ISBN: (纸本)9783031742088;9783031742095

Finite variant of Linear Temporal logic (LTLf) is increasingly popular in Artificial Intelligence (AI).Indeed, several AI applications rely on checking the satisfiability of temporal specifications expressed in LTLf (e.g., planning, and model-checking). this paper describes ltlf2asp, an ASP-based system for bounded satisfiability checking of LTLf formulae. the approach is based on a natural encoding in ASP of temporal operators that is inspired to SAT-based approaches. Experiments show that our system compares favourably to the state-ofthe-art, and shows the ASP technology stack is a suitable alternative to SAT/SMT solvers for bounded satisfiability checking of LTLf formulae.

关键词： Linear Temporal logic over Finite Traces ASP

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：