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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

572 篇 会议
34 篇 期刊文献
19 册 图书

馆藏范围

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

日期分布

学科分类号

549 篇 工学
- 545 篇 计算机科学与技术...
- 304 篇 软件工程
- 16 篇 电气工程
- 13 篇 信息与通信工程
- 13 篇 控制科学与工程
- 2 篇 材料科学与工程（可...
- 2 篇 农业工程
- 1 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 环境科学与工程（可...
- 1 篇 食品科学与工程（可...
97 篇 理学
- 90 篇 数学
- 5 篇 物理学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 生物学
26 篇 管理学
- 19 篇 图书情报与档案管...
- 8 篇 管理科学与工程(可...
- 2 篇 工商管理
3 篇 法学
- 3 篇 社会学
2 篇 农学
- 2 篇 作物学
1 篇 教育学
- 1 篇 教育学
1 篇 医学
- 1 篇 临床医学

主题

221 篇 logic programmin...
45 篇 answer set progr...
39 篇 semantics
23 篇 computer circuit...
21 篇 knowledge repres...
19 篇 nonmonotonic rea...
18 篇 artificial intel...
15 篇 formal logic
11 篇 mathematical log...
10 篇 logics and meani...
8 篇 answer-set progr...
8 篇 description logi...
8 篇 atoms
8 篇 programming tech...
7 篇 inductive logic ...
6 篇 software enginee...
6 篇 asp
6 篇 knowledge repres...
6 篇 semantic web
6 篇 stable models

机构

20 篇 vienna univ tech...
10 篇 univ potsdam pot...
10 篇 univ kentucky de...
7 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 university of po...
6 篇 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 calabria de...
5 篇 univ alberta dep...
5 篇 vienna univ tech...
4 篇 vienna universit...
4 篇 univ potsdam ins...
4 篇 university of ca...
4 篇 simon fraser uni...

作者

32 篇 schaub torsten
24 篇 gebser martin
22 篇 ricca francesco
18 篇 leone nicola
18 篇 tompits hans
17 篇 eiter thomas
16 篇 woltran stefan
16 篇 alviano mario
13 篇 faber wolfgang
13 篇 cabalar pedro
10 篇 ianni giovambatt...
9 篇 lifschitz vladim...
9 篇 calimeri frances...
9 篇 fink michael
9 篇 pearce david
9 篇 you jia-huai
8 篇 eiter t
8 篇 leite joao
8 篇 leone n
8 篇 son tran cao

语言

618 篇 英文
4 篇 其他
3 篇 中文

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

共 625 条记录，以下是581-590 订阅

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

详细简洁

排序：

Magic Sets and their application to data integration

引用

10th international conference on Database theory (ICDT 2005)

作者： Faber, Wolfgang Greco, Gianluigi Leone, Nicola Univ Calabria Dept Math I-87030 Arcavacata Di Rende Italy

ISBN: (纸本)3540242880

Recently, effective methods model query-answering in data integration systems and inconsistent databases in terms of cautious reasoning over Datalog programs under the stable model semantics. Since this task is computationally expensive (co-NP-complete), there is a clear need of suitable techniques for query optimization, in order to make such methods feasible for data-intensive applications. We propose a generalization of the well-known Magic Sets technique to Datalog programs with (possibly unstratified) negation under the stable model semantics. Our technique produces a new program whose evaluation is more efficient (due to a smaller instantiation) in general, while preserving full query-equivalence for both brave and cautious reasoning, provided that the original program is consistent. Soundness under cautious reasoning is always guaranteed, even if the original program is inconsistent. In order to formally prove the correctness of our Magic Sets transformation, we introduce a novel notion of modularity for Datalog under the stable model semantics, which is more suitable for query answering than previous module definitions. We prove that a query on such a module can be evaluated independently from the rest of the program, while preserving soundness under cautious reasoning. Importantly, for consistent programs, both soundness and completeness are guaranteed for brave reasoning and cautious reasoning. Our Magic Sets optimization constitutes an effective method for enhancing the performance of data integration systems in which query-answering is carried out by means of cautious reasoning over Datalog programs. In fact, results of experiments in the EU project INFOMIX, show that Magic Sets are fundamental for the scalability of the system. (c) 2006 Elsevier Inc. All rights reserved.

关键词： logic programming stable models data integration Magic Sets answer sets modularity

来源：评论

学校读者我要写书评

暂无评论

Event Calculus for reasoning about Erlang Systems

Event Calculus for Reasoning about Erlang Systems

引用

Mexican international conference on Artificial Intelligence, MICAI

作者： Manuel Hern´ndez

the event calculus is a logic-based formalism for dealing with temporal reasoning concerns. Erlang is a functional programming language designed from the ground up for tackling distributed programming problems. In this paper, it is shown that the event calculus is a suitable tool for designing and analyzing distributed systems written as Erlang programs.

关键词： Calculus Iris Servers Message passing programming Education Communication channels

来源：评论

学校读者我要写书评

暂无评论

Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description) 11th

Proving Non-Termination and Lower Runtime Bounds with LoAT (...

引用

11th international Joint conference on Automated reasoning (IJCAR) part of the Federated logic conference (FLoC)

作者： Frohn, Florian Giesl, Juergen Rhein Westfal TH Aachen LuFG Informat 2 Aachen Germany

ISBN: (纸本)9783031107696;9783031107689

We present the Loop Acceleration Tool (LoAT), a powerful tool for proving non-termination and worst-case lower bounds for programs operating on integers. It is based on the novel calculus from [10,11] for loop acceleration, i.e., transforming loops into non-deterministic straight-line code, and for finding non-terminating configurations. To implement it efficiently, LoAT uses a new approach based on unsat cores. We evaluate LoAT's power and performance by extensive experiments.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

4th international conference on HCI in Business, Government and Organizations, HCIBGO 2017, held as part of the 19th international conference on Human-Computer Interaction , HCI 2017

4th International Conference on HCI in Business, Government ...

引用

14th international conference on logic programming and nonmonotonic reasoning, LPNMR 2017

ISBN: (纸本)9783319584836

the proceedings contain 66 papers. the special focus in this conference is on HCI in Business, Government and Organizations. the topics include: Sharing economy versus access economy;employing relation visualizations to enhance the shopping experience on a used car trading platform;the effects of scarcity messages on online impulsive purchase;a survey based on the octalysis framework;priming and context effects of banner ads on consumer based brand equity;effect of timing and source of online product recommendations;optimize the coupon face value for online sellers;acceptance of personalization in omnichannel retailing;eye-tracking analysis of gender-specific online information research and buying behavior;participation in collaborative consumption;dueling for trust in the online fantasy sports industry;a longitudinal analysis;a theoretical model of incorporating gamification design into on-line marketing;extracting important knowledge from multiple markets using transfer learning;numbers speak where words fail;perceptions from security guards;the duality of envy in online social information consumption;context sensitive digital marketing;encouraging the participation in mobile collaborative consumption using gamification design;development of an online checklist for the assessment of alarm systems and alarm management in process control;impact of mobile it consumerization on organizations;a review on neuropsychophysiological correlates of flow;contract visualisation and a transaction cost equilibrium analysis on overlap between emergency response task groups.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adapting Approximation Fixpoint theory to Nondeterministic Hybrid reasoning 40

Adapting Approximation Fixpoint Theory to Nondeterministic H...

引用

Workshop of the 40th international conference on logic programming, ICLP-WS 2024

作者： Killen, Spencer You, Jia-Huai University of Alberta Edmonton Canada

Approximation fixpoint theory (AFT) is an abstract, algebraic framework for the study of operators and their fixpoints on bilattices. It is based on approximating operators (approximators for short) and has seen application in expressing semantics for a variety of nonmonotonic languages. the original AFT only treats consistent, symmetric, and exact approximators. Consequently, it lacks the means to deal with inconsistencies which may arise naturally in systems of hybrid reasoning. this problem was addressed by a generalization of AFT by Liu and You [1], which alters the exactness condition so that inconsistencies can be supported. However, neither the original AFT nor this generalized AFT is capable of expressing nondeterministic semantics, which is essential for characterizing disjunctive knowledge. the recent proposal of nondeterministic AFT by Heyninck et al. [2] only deals with consistent and exact approximations, and its definitions of orderings, fixpoints, and monotonicity deviate from that of the original AFT. Due to differences in these core definitions, it is highly challenging, if not impossible, to generalize nondeterministic AFT to handle inconsistencies. In this paper, we present a new framework which relies on a family of approximators in Liu and You’s formulation to express nondeterministic semantics abstractly and algebraically. As an application, we show how to capture the partial stable semantics of (disjunctive) hybrid MKNF knowledge bases. © 2024 Copyright for this paper by its authors.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Context modeling: Task model and practice model

引用

6th international Interdisciplinary conference on Modeling and Using Context (CONTEXT 2007)

作者： Brezillon, Patrick Univ Paris 06 LIP6 F-75016 Paris France

ISBN: (纸本)9783540742548

Contextual Graphs are a context-based formalism used in various real-world applications. they allow a uniform representation of elements of reasoning and of contexts for describing different human tasks such as troubleshooting and interpretation. A contextual graph represents a task realization. Its paths represent the different ways of reaching this realization, each way corresponding to a practice developed by an actor realizing the task. In this paper, we revisit the classical distinction between prescribed and effective tasks, procedures versus practices, logic of functioning versus logic of use, etc. in the light of this formalism. We discuss the position of the practice model with respect to the task model using an example involving troubleshooting a problem with a DVD player and another example involving the collaborative construction of an answer, and place this within the context of some other applications developed in the formalism of Contextual Graphs.

关键词： contextual graphs reasoning task activity procedures and practices

来源：评论

学校读者我要写书评

暂无评论

10th international Colloquium on Automata, Languages and programming, ICALP 1983

10th International Colloquium on Automata, Languages and Pro...

引用

10th international Colloquium on Automata, Languages and programming, ICALP 1983

ISBN: (纸本)9783540123170

the proceedings contain 60 papers. the special focus in this conference is on Automata, Languages and programming. the topics include: Symmetric and economical solutions to the mutual exclusion problem in a distributed system: Extended abstract;ambiguity and decision problems concerning number systems;on the observational semantics of fair parallelism;an O(N4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching;algebraic languages and polyomnoes enumeration;on the number of equal-sized semispaces of a set of points in the plane: Extended abstract;algebraic specifications with generating constraints;wythoff games, continued fractions, cedar trees and Fibonacci searches;initial index: A new complexity function for languages;an axiomatization of the intermittent assertion method using temporal logic;modular compiler descriptions based on abstract semantic data types;polynomial-time factorization of multivariate polynomials over finite fields;processes of place/transition-nets;a hardware semantics based on temporal intervals;Lower bounds for solving undirected graph problems on VLSI;concurrent probabilistic program, or: How to schedule if you must;Computation times of NP sets of different densities;rewrite methods for clausal and non-clausal theorem proving;complexity of infinite trees;incremental construction of unification algorithms in equational theories;topological characterizations of infinite behaviours of transition systems;tree automata and attribute grammars;effectively given spaces;a note on intersections of free submonoids of a free monoid;A fast sorting algorithm for VLSI;on the composition of morphisms and inverse morphisms;on the group complexity of a finite language;reasoning with time and chance: Extended abstract;factoring multivariate integral polynomials.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prolog Technology Reinforcement Learning Prover (System Description) 10th

Prolog Technology Reinforcement Learning Prover (System Desc...

引用

10th international Joint conference on Automated reasoning (IJCAR)

作者： Zombori, Zsolt Urban, Josef Brown, Chad E. Alfred Renyi Inst Math Budapest Hungary Eotvos Lorand Univ Budapest Hungary Czech Tech Univ Prague Czech Republic

ISBN: (纸本)9783030510541;9783030510534

We present a reinforcement learning toolkit for experiments with guiding automated theorem proving in the connection calculus. the core of the toolkit is a compact and easy to extend Prolog-based automated theorem prover called plCoP. plCoP builds on the leanCoP Prolog implementation and adds learning-guided Monte-Carlo Tree Search as done in the rlCoP system. Other components include a Python interface to plCoP and machine learners, and an external proof checker that verifies the validity of plCoP proofs. the toolkit is evaluated on two benchmarks and we demonstrate its extendability by two additions: (1) guidance is extended to reduction steps and (2) the standard leanCoP calculus is extended with rewrite steps and their learned guidance. We argue that the Prolog setting is suitable for combining statistical and symbolic learning methods. the complete toolkit is publicly released.

关键词： Automated theorem proving Reinforcement learning logic programming Connection tableau calculus

来源：评论

学校读者我要写书评

暂无评论

Prediction of Length of Hospital Stay in Preterm Infants a Case-Based reasoning View 8th

Prediction of Length of Hospital Stay in Preterm Infants a C...

引用

8th KES international conference on Intelligent Decision Technologies (KES-IDT)

作者： Coimbra, Ana Vicente, Henrique Abelha, Antonio Filipe Santos, M. Machado, Jose Neves, Joao Neves, Jose Univ Minho Dept Informat Braga Portugal Univ Evora Escola Ciencias & Tecnol Dept Quim Evora Portugal Univ Minho Ctr Algoritmi Braga Portugal Drs Nicolas & Asp Dubai U Arab Emirates

ISBN: (纸本)9783319396309;9783319396293

the length of stay of preterm infants in a neonatology service has become an issue of a growing concern, namely considering, on the one hand, the mothers and infants health conditions and, on the other hand, the scarce healthcare facilities own resources. thus, a pro-active strategy for problem solving has to be put in place, either to improve the quality-of-service provided or to reduce the inherent financial costs. therefore, this work will focus on the development of a diagnosis decision support system in terms of a formal agenda built on a logic programming approach to knowledge representation and reasoning, complemented with a case-based problem solving methodology to computing, that caters for the handling of incomplete, unknown, or even contradictory information. the proposed model has been quite accurate in predicting the length of stay (overall accuracy of 84.9 %) and by reducing the computational time with values around 21.3 %.

关键词： Preterm infants Length of stay Neonatology Knowledge representation and reasoning logic programming Case-based reasoning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共63页 << < 54 55 56 57 58 59 60 61 62 63 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：