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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

668 篇 会议
32 篇 期刊文献
19 册 图书

馆藏范围

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

日期分布

学科分类号

648 篇 工学
- 645 篇 计算机科学与技术...
- 356 篇 软件工程
- 28 篇 控制科学与工程
- 22 篇 电气工程
- 18 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 生物工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 农业工程
129 篇 理学
- 120 篇 数学
- 5 篇 物理学
- 5 篇 生物学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
33 篇 管理学
- 23 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 7 篇 工商管理
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

247 篇 logic programmin...
46 篇 answer set progr...
44 篇 semantics
22 篇 computer circuit...
22 篇 artificial intel...
21 篇 knowledge repres...
20 篇 formal logic
18 篇 nonmonotonic rea...
12 篇 calculations
11 篇 mathematical log...
11 篇 logics and meani...
9 篇 constraint progr...
8 篇 answer-set progr...
8 篇 atoms
8 篇 inductive logic ...
8 篇 ontology
7 篇 knowledge repres...
7 篇 programming tech...
6 篇 software enginee...
6 篇 data description

机构

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

作者

35 篇 schaub torsten
25 篇 gebser martin
23 篇 ricca francesco
19 篇 tompits hans
18 篇 eiter thomas
17 篇 woltran stefan
16 篇 leone nicola
14 篇 alviano mario
12 篇 faber wolfgang
12 篇 cabalar pedro
11 篇 brain martin
11 篇 de vos marina
10 篇 calimeri frances...
10 篇 fink michael
10 篇 inoue katsumi
9 篇 ianni giovambatt...
9 篇 son tran cao
8 篇 giordano laura
8 篇 eiter t
8 篇 lifschitz vladim...

语言

713 篇 英文
4 篇 中文
2 篇 其他

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

共 719 条记录，以下是651-660 订阅

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

详细简洁

排序：

Automatic Composition of Melodic and Harmonic Music by Answer Set programming

Automatic Composition of Melodic and Harmonic Music by Answe...

引用

24th international conference on logic programming (ICLP)

作者： Boenn, Georg Brain, Martin De Vos, Marina Ffitch, John Univ Glamorgan Cardiff Sch Creat & Cultural Ind Pontypridd CF37 1DL M Glam Wales Univ Bath Dept Comp Sci Bath BA2 7AY Avon England

ISBN: (纸本)9783540899815

the composition of most styles of music is governed by rules. the natural statement of these rules is declarative ("the highest and lowest notes in a piece must be separated by a consonant interval") and non deterministic ("the base note of a key can be followed by any note in the key"). We show that by approaching the automation and analysis of composition as a knowledge representation task and formalising these rules in a suitable logical language, powerful and expressive intelligent composition tools can easily be built. this paper describes the use of answer set programming to construct an automated system that can compose both melodic and harmonic music, diagnose errors in human compositions and serve as a computer-aided composition tool. the use of a fully declarative language and an "off-the-shelf" reasoning engine allows the creation of tools which are significantly simpler, smaller and more flexible than those produced by existing approaches. It also combines harmonic and melodic composition in a single framework, which is a new feature in the growing area of algorithmic composition.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Automated reasoning 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540710707

ISBN: (纸本)9783540710691

this book constitutes the refereed proceedings of the 4th international Joint conference on Automated reasoning, IJCAR 2008, held in Sydney, Australia, in August 2008. the 26 revised full research papers and 13 revised system descriptions presented together with 4 invited papers and a summary of the CASC-J4 systems competition were carefully reviewed and selected from 80 full paper and 17 system description submissions. the papers address the entire spectrum of research in automated reasoning and are organized in topical sections on specific theories, automated verification, protocol verification, system descriptions, modal logics, description logics, equational theories, theorem proving, CASC, the 4th IJCAR ATP system competition, logical frameworks, and tree automata.

关键词： Artificial Intelligence Software Engineering/programming and Operating Systems programming Techniques Mathematical logic and Formal Languages logics and Meanings of Programs Software Engineering

来源：评论

学校读者我要写书评

暂无评论

7th international Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing, RSFDGrC 1999

7th International Workshop on New Directions in Rough Sets, ...

引用

7th international Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, RSFDGrC 1999

ISBN: (纸本)3540666451

the proceedings contain 68 papers. the special focus in this conference is on Rough Computing, Rough Set theory and Its Applications. the topics include: Decision rules, bayes’ rule and rough sets;from computation with measurements to computation with perceptions;on text mining techniques for personalization;a road to discovery science;approximate distributed synthesis and granular semantics for computing with words;discovery of rules about complications;rough genetic algorithms;a rough-fuzzy neural computational approach;toward spatial reasoning in the framework of rough mereology;an algorithm for finding equivalence relations from tables with non-deterministic information;on the extension of rough sets under incomplete information;an alternative formulation;formal rough concept analysis;noise reduction in telecommunication channels using rough sets and neural networks;rough set analysis of electrostimilation test database for the prediction of post-operative profits in cochlear implanted patients;a rough set-based approach to text classification;modular rough fuzzy MLP;correspondence and complexity results;handling missing values in rough set analysis of multi-attribute and multi-criteria decision problems;the generic rough set inductive logic programming model and motifs in strings;rough problem settings for inductive logic programming;using rough sets with heuristics to feature selection;the discretization of continuous attributes based on compatibility rough set and genetic algorithm;level cut conditioning approach to the necessity measure specification;four c-regression methods and classification functions and context-free fuzzy sets in data mining context.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Digital forensics evidence analysis: An answer set programming approach for generating investigation hypotheses 13th

引用

13th international conference on logic programming and nonmonotonic reasoning, LPNMR 2015

作者： Costantini, Stefania De Gasperis, Giovanni Olivieri, Raffaele Dipartimento di Ingegneria e Scienze dell’Informazione e Matematica Universitá degli Studi dell’Aquila Via Vetoio 1 L’Aquila67100 Italy Viale di Tor di Quinto 119 Rome00191 Italy

ISBN: (纸本)9783319232638

the results of the evidence analysis phase in Digital Forensics (DF) provide objective data which however require further elaboration by the investigators: in fact, they must contextualize analysis results within an investigative environment so as to provide possible hypotheses that can be proposed as proofs in court, to be evaluated by lawyers and judges. Aim of our research has been that of exploring the applicability of Answer Set programming (ASP) to the automatization of evidence analysis. this brings many advantages, among which that of making different possible investigative hypotheses explicit, whereas different human experts working on the case often devise and select, relying on intuition, discordant interpretations. Very complex investigations for which human experts can hardly find solutions turn out in fact to be reducible to optimization problems in classes P or NP or not far beyond, that can thus be expressed in ASP. As a proof of concept, in this paper we present the formulation of some real investigative cases via simple ASP programs, and discuss how this leads to the formulation of concrete investigative hypotheses. © Springer international Publishing Switzerland 2015.

关键词： Digital forensics

来源：评论

学校读者我要写书评

暂无评论

Two applications of the ASP-Prolog system: Decomposable programs and multi-context systems

引用

15th international conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2014

作者： Son, Tran Cao Pontelli, Enrico Le, Tiep Department of Computer Science New Mexico State University United States

ISBN: (纸本)9783319041315

this paper presents two applications of the ASP-Prolog system, one of the earliest modular logic programming frameworks for integrating ASP and traditional Prolog/CLP reasoning. Both applications represent significant challenges to existing ASP technologies and share some common traits-mostly related to the inadequacy of the ground-and-solve approach. the first application stems from several practical experiences in using state-of-the-art Answer Set programming (ASP) solvers to tackle combinatorial problems in different domains (e.g., bioinformatics, distributed constraint problem solving). A recurrent issue is the presence of computationally tractable subproblems that turn out to be challenging, or even practically infeasible, for current ASP technologies. the second application of ASP-Prolog is its use to compute the equilibrium semantics of Multi-Context Systems (MCS). © 2014 Springer international Publishing.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Structural constraint-based modeling and reasoning with basic configuration cells 7

引用

7th international conference on Principles and Practice of Constraint programming, CP 2001

作者： Gasca, Rafael M. Ortega, Juan A. Toro, Miguel Department of Languages and Computer Systems University of Sevilla Avda. Reina Mercedes s/n Sevilla41012 Spain

ISBN: (纸本)3540428631

Configuration tasks are an important application area in engineering design. the proposed solving techniques use either a constraint based framework or a logic-based approach. We propose a methodology to obtains desired configuration using basic configuration cells (BCC). they are built by means of the predefined components and connections of the given configuration problem. In practical applications of configuration tasks the BCCs and configuration goals are represented according to object-oriented programming paradigm. they are mapped into a numeric constraint satisfaction problem. the transformation of a basic configuration cell into a new one generates a sequence of numeric constraint satisfaction problems. We propose an algorithm that solves this sequence of problems in order to obtain a configuration solution according to the desired requirements or that detects inconsistencies in the requirements. the integration of object oriented and constraint programming paradigms allows us to achieve a synergy that produces results that could not be obtained if each one were working individually. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

On Anti-subsumptive Knowledge Enforcement 1

引用

20th international conference on logic for programming, Artificial Intelligence and reasoning (LPAR)

作者： Gregoire, Eric Lagniez, Jean-Marie Univ Artois CNRS CRIL Rue Jean Souvraz SP18 F-62307 Lens France

ISBN: (数字)9783662488997

ISBN: (纸本)9783662488997;9783662488980

the anti-subsumptive enforcement of a clause delta in a set of clauses Delta consists in extracting one cardinality-maximal satisfiable subset Delta' of Delta boolean OR {delta} that contains d but that does not strictly subsume delta. In this paper, the computational issues of this problem are investigated in the Boolean framework. Especially, the minimal change policy that requires a minimal number of clauses to be dropped from Delta can lead to an exponential computational blow-up. Indeed, a direct and natural approach to anti-subsumptive enforcement requires the computation of all inclusion-maximal subsets of Delta boolean OR{delta} that, at the same time, contain d and are satisfiable with delta(j) where (sic)delta(j) is some strict sub-clause of delta. On the contrary, we propose a method that avoids the computation of this possibly exponential number of subsets of clauses. Interestingly, it requires only one single call to a Partial-Max-SAT procedure and appears tractable in many realistic situations, even for very large Delta. Moreover, the approach is easily extended to take into account a preference pre-ordering between formulas and lay the foundations for the practical enumeration of all optimal solutions to the problem of making d subsumption-free in Delta under a minimal change policy.

关键词： Preemption Subsumption Belief change Partial-Max-SAT Boolean logic

来源：评论

学校读者我要写书评

暂无评论

Manifold answer-set programs and their applications

引用

Symposium on Constructive Mathematics in Computer Science in honor of Michael Gelfond on the occasion of his 65th birthday, 2010

作者： Faber, Wolfgang Woltran, Stefan University of Calabria Italy Vienna University of Technology Austria

ISBN: (纸本)9783642208317

In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or cautious consequences of a program P 1 as input to another program P 2 in order to provide the desired solutions to the problem to be solved. In practice, the evaluation of the program P 1 currently has to be decoupled from the evaluation of P 2 using an intermediate step which collects the desired consequences of P 1 and provides them as input to P 2. In this work, we present a novel method for representing such a procedure within a single program, and thus within the realm of ASP itself. Our technique relies on rewriting P 1 into a so-called manifold program, which allows for accessing all desired consequences of P 1 within a single answer set. then, this manifold program can be evaluated jointly with P 2 avoiding any intermediate computation step. For determining the consequences within the manifold program we use weak constraints, which is strongly motivated by complexity considerations. As applications, we present encodings for computing the ideal extension of an abstract argumentation framework and for computing world views of a particular class of epistemic specifications. © Springer-Verlag Berlin Heidelberg 2011.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

5th international conference on Parallel Architectures and Languages Europe, PARLE 1993

5th International Conference on Parallel Architectures and L...

引用

5th international conference on Parallel Architectures and Languages Europe, PARLE 1993

ISBN: (纸本)9783540568919

the proceedings contain 79 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Simulation-based comparison of hash functions for emulated shared memory;task management, virtual shared memory, and multithreading in a distributed memory implementation of sisal;simulating the data diffusion machine;an FP based programming language for efficient parallel programming of multiprocessor networks;the data-parallel categorical abstract machinedata parallel implementation of extensible sparse functional arrays;embeddings of tree-related networks in incomplete hypercubes;optimal mappings of m dimensional FFT communication to k dimensional mesh for arbitrary m and k;the united functions and objects approach;detection of recurrences in sequential programs with loops;parallel programming using skeleton functions;data-parallel portable software platform: principles and implementation;a compositional approach for fault-tolerance using specification transformation;concurrent metatem — a language for modelling reactive systems;trace-based compositional reasoning about fault tolerant systems;a kahn principle for networks of nonmonotonic real-time processes;adaptive multicast wormhole routing in 2D mesh multicomputer;the impact of packetization in wormhole-routed networks;a high-performance flat concurrent logic programming system;exploiting recursion-parallelism in prolog;why and how in the elipsys or-parallel CLP system;skewed-associative caches;trace-splitting for the parallel simulation of cache memory;locality and false sharing in coherent-cache parallel graph reduction;SLiD — a cost-effective and scalable limited-directory scheme for cache coherence and formal development of actor programs using structured algebraic petri nets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fine Grained SMT Proofs for the theory of Fixed-Width Bit-Vectors 20th

引用

20th international conference on logic for programming, Artificial Intelligence and reasoning (LPAR)

作者： Hadarean, Liana Barrett, Clark Reynolds, Andrew Tinelli, Cesare Deters, Morgan Univ Oxford Oxford England NYU New York NY USA Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Univ Iowa Iowa City IA USA

ISBN: (纸本)9783662488997;9783662488980

Many high-level verification tools rely on SMT solvers to efficiently discharge complex verification conditions. Some applications require more than just a yes/no answer from the solver. For satisfiable quantifier-free problems, a satisfying assignment is a natural artifact. In the unsatisfiable case, an externally checkable proof can serve as a certificate of correctness and can be mined to gain additional insight into the problem. We present a method of encoding and checking SMT-generated proofs for the quantifier-free theory of fixed-width bit-vectors. Proof generation and checking for this theory poses several challenges, especially for proofs based on reductions to propositional logic. Such reductions can result in large resolution subproofs in addition to requiring a proof that the reduction itself is correct. We describe a fine-grained proof system formalized in the LFSC framework that addresses some of these challenges with the use of computational side-conditions. We report results using a proof-producing version of the CVC4 SMT solver on unsatisfiable quantifier-free bit-vector benchmarks from the SMT-LIB benchmark library.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 62 63 64 65 66 67 68 69 70 71 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：