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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

254 篇 会议
24 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

235 篇 工学
- 230 篇 计算机科学与技术...
- 146 篇 软件工程
- 11 篇 电气工程
- 9 篇 控制科学与工程
- 8 篇 信息与通信工程
- 3 篇 建筑学
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
- 1 篇 网络空间安全
77 篇 理学
- 73 篇 数学
- 6 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
11 篇 管理学
- 9 篇 管理科学与工程(可...
- 4 篇 工商管理
- 3 篇 图书情报与档案管...
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
1 篇 法学
- 1 篇 法学
1 篇 军事学
- 1 篇 军队指挥学

主题

60 篇 logic programmin...
34 篇 answer set progr...
18 篇 non-monotonic re...
15 篇 knowledge repres...
9 篇 semantics
7 篇 inductive logic ...
6 篇 computer circuit...
5 篇 fuzzy logic
5 篇 formal logic
5 篇 programming
4 篇 belief revision
4 篇 epistemic logic ...
4 篇 non-monotonic lo...
4 篇 model checking
4 篇 ontologies
4 篇 defeasible logic
4 篇 knowledge repres...
4 篇 machine learning
3 篇 equilibrium logi...
3 篇 abduction

机构

9 篇 univ potsdam pot...
6 篇 univ calabria ar...
5 篇 univ a coruna la...
4 篇 new mexico state...
4 篇 vrije univ bruss...
4 篇 imperial coll lo...
4 篇 univ milano bico...
4 篇 univ angers leri...
3 篇 tu wien austria
3 篇 univ genoa dibri...
3 篇 univ calabria de...
3 篇 vienna univ tech...
3 篇 tech univ dresde...
2 篇 university of ma...
2 篇 univ torino dipa...
2 篇 katholieke univ ...
2 篇 univ calabria di...
2 篇 univ hasselt has...
2 篇 univ politecn ma...
2 篇 univ ferrara dip...

作者

16 篇 ricca francesco
9 篇 cabalar pedro
8 篇 alviano mario
7 篇 fandinno jorge
6 篇 schaub torsten
6 篇 maratea marco
5 篇 maher michael j.
5 篇 gebser martin
4 篇 eiter thomas
4 篇 son tran cao
3 篇 akbar siami nami...
3 篇 governatori guid...
3 篇 gaggl sarah alic...
3 篇 perez gilberto
3 篇 riguzzi fabrizio
3 篇 penaloza rafael
3 篇 formisano andrea
3 篇 aguado felicidad
3 篇 russo alessandra
3 篇 ielo antonio

语言

282 篇 英文

检索条件"任意字段=17th International Conference on Logic Programming and Non-monotonic Reasoning"

共 282 条记录，以下是231-240 订阅

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

详细简洁

排序：

Semantic-driven Goal-Oriented Development of AAL Environments

Semantic-driven Goal-Oriented Development of AAL Environment...

引用

17th international conference on Collaboration Technologies and Systems (CTS)

作者： Cameranesi, Marco Diamantini, Claudia Potena, Domenico Storti, Emanuele Univ Politecn Marche Dipartimento Ingn Informaz Via Brecce Bianche I-60131 Ancona Italy

ISBN: (纸本)9781509022991

In recent years, a multitude of assistive technologies have been devised to enhance people's capabilities by means of environments that are adaptive, sensitive and responsive to human needs. Following this approach, Ambient Assisted Living (AAL) technologies are developed to provide support especially to elderly people for prevention and recognition of medical threats, and improvement of well-being. Towards this direction, the aim of this paper is to introduce the principles of a goal-oriented methodology devoted to support system designers in the development of AAL environments. In the methodology, AAL requirements are elicited, analysed and then formally represented in an ontology, which serves as a collaboratively built knowledge base. Here, high-level goals are described in terms of subgoals and tasks, that are then linked to corresponding measures and devices. On its top, logic-based reasoning functionalities provide means to retrieve explicit and hidden knowledge, as we show in two typical applications of the methodology, namely the development from scratch of an AAL environment starting from a set of high-level user requirements and the redesign of an existing implementation according to changed requirements.

关键词： ambient assisted living goal-oriented methodology ontology sensors logic programming

来源：评论

学校读者我要写书评

暂无评论

Gentzen-style characterizations of negation as failure 1st

Gentzen-style characterizations of negation as failure

引用

1st international conference on Artificial Intelligence and Symbolic Mathematical Computing, AISMC 1992

作者： Plaza, Jan A. University of Miami Department of Mathematics and Computer Science P.O. Box 249 085 Coral GablesFL33124 United States

ISBN: (纸本)9783540573227

We investigate Negation as Failure as incorporated in (nondeterministic) SLDNF-resolution and in (deterministic) PROLOG's resolution. We formulate three Gentzen-style systems which characterize prepositional SLDNF-resolution and propositional PROLOG's resolution in a sound and complete way (without assuming stratification or any other restrictions on programs.) Our analysis employs certain three-valued logics. the results of this paper can be of interest for rule-based expert systems which represent knowledge in propositional logic, and for other AI-systems which use Negation as Failure for non-monotonic reasoning. © Springer-Verlag Berlin Heidelberg 1993.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

JASP: A framework for integrating answer set programming with Java

JASP: A framework for integrating answer set programming wit...

引用

13th international conference on the Principles of Knowledge Representation and reasoning, KR 2012

作者： Febbraro, Onofrio Grasso, Giovanni Leone, Nicola Ricca, Francesco DLVSystem s.r.l. P.zza Vermicelli Polo Tecnologico Rende Italy Oxford University Department of Computer Science Parks Road Oxford United Kingdom University of Calabria Department of Mathematics Rende Italy

ISBN: (纸本)9781577355601

Answer Set programming (ASP) is a fully-declarative logic programming paradigm, which has been proposed in the area of knowledge representation and non-monotonic reasoning. Nowadays, the formal properties of ASP are well-understood, efficient ASP systems are available, and, recently, ASP has been employed in a few industrial applications. However, ASP technology is not mature for a successful exploitation in industry yet;mainly because ASP technologies are not integrated in the well-assessed development processes and platforms which are tailored for imperative/object-oriented programming languages. In this paper we present a new programming framework blending ASP with Java. the framework is based on JASP, an hybrid language that transparently supports a bilateral interaction between ASP and Java. JASP specifications are compliant with the JPA standard to perfectly fit extensively-adopted enterprise application technologies. the framework also encompasses an implementation of JASP as a plug-in for the Eclipse platform, called JDLV, which includes a compiler from JASP to Java. Moreover, we show a real-world application developed with JASP and JDLV, which highlights the effectiveness of our ASP-Java integration framework. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

A nonmonotonic extension of KLM preferential logic P

A nonmonotonic extension of KLM preferential logic P

引用

17th international conference on logic for programming, Artificial Intelligence, and reasoning, LPAR-17

作者： Giordano, Laura Gliozzi, Valentina Olivetti, Nicola Pozzato, Gian Luca Dip. di Informatica U. Piemonte O. Alessandria Italy Dip. Informatica Univ. di Torino Italy LSIS-UMR CNRS 6168 Marseille France

ISBN: (纸本)364216241X

In this paper, we propose the logic P min , which is a nonmonotonic extension of Preferential logic P defined by Kraus, Lehmann and Magidor (KLM). In order to perform nonmonotonic inferences, we define a "minimal model" semantics. Given a modal interpretation of a minimal A-world as A ∧ ¬A, the intuition is that preferred, or minimal models are those that minimize the number of worlds where ¬¬A holds, that is of A-worlds which are not minimal. We also present a tableau calculus for deciding entailment in P min . © 2010 Springer-Verlag.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Foundations of Software Science and Computation Structures 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Anca Muscholl

ISBN: (数字)9783642548307

ISBN: (纸本)9783642548291

this book constitutes the proceedings of the 17th international conference on Foundations of Software Science and Computation Structures, FOSSACS 2014, held as part of the European Joint conferences on theory and Practice of Software, ETAPS 2014, which took place in Grenoble, France, in April 2014. the 28 papers included in this book, together with one invited talk, were selected from 106 full-paper submissions. the following topical areas are covered: probabilistic systems, semantics of programming languages, networks, program analysis, games and synthesis, compositional reasoning, bisimulation, categorical and algebraic models and logics of programming.

关键词： logics and Meanings of Programs Mathematical logic and Formal Languages programming Languages, Compilers, Interpreters Software Engineering Computation by Abstract Devices

来源：评论

学校读者我要写书评

暂无评论

On the splitting property for epistemic logic programs (extended abstract) 29

On the splitting property for epistemic logic programs (exte...

引用

29th international Joint conference on Artificial Intelligence, IJCAI 2020

作者： Cabalar, Pedro Fandinno, Jorge del Cerro, Luis Fariñas University of Corunna Spain University of Potsdam Germany IRIT University of Toulouse CNRS France

ISBN: (纸本)9780999241165

Epistemic logic programs constitute an extension of the stable model semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some objective literal is true in all or some stable models. However, its associated semantics has proved to be non-trivial, since the truth of subjective literals may interfere with the set of stable models it is supposed to query. As a consequence, no clear agreement has been reached and different semantic proposals have been made in the literature. In this paper, we review an extension of the well-known splitting property for logic programs to the epistemic case. this epistemic splitting property is defined as a general condition that can be checked on any arbitrary epistemic semantics. Its satisfaction has desirable consequences both in the representation of conformant planning problems and in the encoding of the so-called subjective constraints. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

1st international Joint conference on Automated reasoning, IJCAR 2001

引用

1st international Joint conference on Automated reasoning, IJCAR 2001 co-located with 3rd Workshop on Inference in Computational Semantics, ICoS 2001 and 9th Symposium on the Integration of Symbolic Computation and Mechanized reasoning, CALCULEMUS 2001

ISBN: (纸本)3540422544

the proceedings contain 59 papers. the special focus in this conference is on Description, Modal and Temporal logics. the topics include: Program termination analysis by size-change graphs;SET cardholder registration;algorithms, datastructures and other issues in efficient automated deduction;NExpTime-complete description logics with concrete domains;exploiting pseudo models for TBox and ABox reasoning in expressive description logics;the inverse method implements the automata approach for modal satisfiability;deduction-based decision procedure for a clausal miniscoped fragment of FTL;tableaux for temporal description logic with constant domains;free-variable tableaux for constant-domain quantified modal logics with rigid and non-rigid designation;instructing equational set-reasoning with otter;NP-completeness of refutability by literal-once resolution;ordered resolution vs. connection graph resolution;a model-based completeness proof of extended narrowing and resolution;a resolution-based decision procedure for the two-variable fragment with equality;superposition and chaining for totally ordered divisible abelian groups;on the evaluation of indexing techniques for theorem proving;preferred extensions of argumentation frameworks;bunched logic programming;a top-down procedure for disjunctive well-founded semantics;a second-order theorem prover applied to circumscription;a system for non-monotonic reasoning with logic programs under answer set semantics;conditional pure literal graphs;evaluating search heuristics and optimization techniques in propositional satisfiability;a system for deciding quantified boolean formulas satisfiability;a disconnection calculus theorem prover;more on implicit syntax;termination and reduction checking for higher-order logic programs;integrating connection-based theorem proving into interactive proof assistants and the extended least number heuristic.

关键词：

来源：评论

学校读者我要写书评

暂无评论

17th European conference on Multi-Agent Systems, EUMAS 2020, and 7th international conference on Agreement Technologies, AT 2020

17th European Conference on Multi-Agent Systems, EUMAS 2020,...

引用

17th European conference on Multi-Agent Systems, EUMAS 2020, and 7th international conference on Agreement Technologies, AT 2020

ISBN: (纸本)9783030664114

the proceedings contain 38 papers. the special focus in this conference is on Multi-Agent Systems. the topics include: Predicting the Winners of Borda, Kemeny and Dodgson Elections with Supervised Machine Learning;from Virtual Worlds to Mirror Worlds: A Model and Platform for Building Agent-Based eXtended Realities;decentralised Multi-intersection Congestion Control for Connected Autonomous Vehicles;Model-Checking Information Diffusion in Social Networks with PRISM;"Roads? Where We’re Going We Don’t Need Roads." Using Agent-Based Modeling to Analyze the Economic Impact of Hyperloop Introduction on a Supply Chain;sensitivity to Initial Conditions in Agent-Based Models;statecharts and Agent Technology: the Past and Future;a Game of Double Agents: Repeated Stackelberg Games with Role Switch;learning Summarised Messaging through Mediated Differentiable Inter-Agent Learning;integrating Deep Learning and non-monotonic logical reasoning for Explainable Visual Question Answering;multiagent Task Coordination as Task Allocation Plus Task Responsibility;anytime and Efficient Coalition Formation with Spatial and Temporal Constraints;congestion Management for Mobility-on-Demand Schemes that Use Electric Vehicles;disaster Response Simulation as a Testbed for Multi-Agent Systems;rewarding Miners: Bankruptcy Situations and Pooling Strategies;a Game-theoretical Analysis of Charging Strategies for Competing Double Auction Marketplaces;agents for Preserving Privacy: Learning and Decision Making Collaboratively;open Social Systems;preface;towards a theory of Intentions for Human-Robot Collaboration;a Faithful Mechanism for Privacy-Sensitive Distributed Constraint Satisfaction Problems;incentivising Exploration and Recommendations for Contextual Bandits with Payments;emotional Agents Make a (Bank) Run;An Interface for programming Verifiable Autonomous Agents in ROS;combining Lévy Walks and Flocking for Cooperative Surveillance Using Aerial Swarms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hoare-style reasoning from multiple contracts 13th

Hoare-style reasoning from multiple contracts

引用

13th international conference on Integrated Formal Methods, IFM 2017

作者： Owe, Olaf Ramezanifarkhani, Toktam Fazeldehkordi, Elahe Department of Informatics University of Oslo Oslo Norway

ISBN: (纸本)9783319668444

Modern software is often developed with advanced mechanisms for code reuse. A software module may build on other software modules or libraries where the source code is not available. And even if the source code is known, the binding mechanism may be such that the binding of methods is not known at verification time, and thus the underlying reused code cannot be determined. For example, in delta- oriented programming the binding of methods depends on the ordering of deltas in each product, making modular reasoning non-trivial. Similar problems occur with traits and subclassing. reasoning inside a module must then be based on partial knowledge of the methods, typically given by contracts in the form of pairs of pre- and post-conditions, and one may not derive new properties by re-verification of the (unavailable) source code. In the setting of Hoare logic, this gives some challenges to general rules for adaptation that goes beyond traditional systems for Hoare logic. We develop a novel way of reasoning from multiple contracts, which makes the traditional adaptation rules superfluous. the problem we address does not depend on the choice of programming language. We therefore focus on general rules rather than statement-specific rules. We show soundness and completeness for the suggested rules. © Springer international Publishing AG 2017.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Probabilistic assumption-based argumentation with DST evidence 17

Probabilistic assumption-based argumentation with DST eviden...

引用

17th Joint World Congress of international Fuzzy Systems Association and 9th international conference on Soft Computing and Intelligent Systems, IFSA-SCIS 2017

作者： Duy Hung, Nguyen Sirindhorn International Institute of Technology Thailand

ISBN: (纸本)9781509049172

We study the relationships between two prominent approaches to, respectively, non-additive degrees of belief and probabilistic argumentation: Demspter-Shafer theory (DST) and Probabilistic Assumption-based Argumentation (PABA). In particular we show that each DST body of evidence can be represented by a PABA framework, and DST combination rules can be simulated by a canonical rule for combining PABA frameworks. We then develop a PABA framework capable of taking DST evidence directly besides logical knowledge. We illustrate how this framework naturally models a decision making situation that DST alone seems ill-suited. © 2017 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：