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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

103 篇 会议
19 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

93 篇 工学
- 92 篇 计算机科学与技术...
- 76 篇 软件工程
- 4 篇 控制科学与工程
- 3 篇 电气工程
- 1 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 信息与通信工程
- 1 篇 化学工程与技术
- 1 篇 食品科学与工程（可...
- 1 篇 安全科学与工程
61 篇 理学
- 57 篇 数学
- 3 篇 系统科学
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 化学
3 篇 医学
- 1 篇 基础医学(可授医学...
2 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

22 篇 logic programmin...
17 篇 answer set progr...
9 篇 semantics
6 篇 logic
6 篇 computer languag...
5 篇 programming
5 篇 inductive logic ...
4 篇 program transfor...
4 篇 java
4 篇 distributed comp...
4 篇 artificial intel...
3 篇 software systems
3 篇 programming prof...
3 篇 software enginee...
3 篇 electronic mail
3 篇 parallel program...
3 篇 stable models
3 篇 visualization
3 篇 machine learning
3 篇 verification

机构

4 篇 imdea software i...
2 篇 alan turing inst...
2 篇 roskilde univ ro...
2 篇 univ melbourne d...
2 篇 univ piemonte or...
2 篇 univ nova lisboa...
2 篇 dept informat p-...
2 篇 spanish council ...
2 篇 katholieke univ ...
2 篇 kobe univ nada k...
2 篇 university of ox...
2 篇 abb research lad...
2 篇 sabanci univ fac...
2 篇 univ alberta edm...
2 篇 abb research ban...
2 篇 univ potsdam d-1...
2 篇 res org informat...
2 篇 macquarie univ d...
2 篇 univ so calif de...
2 篇 suny stony brook...

作者

4 篇 stuckey peter j.
3 篇 bartholomew mich...
3 篇 schaub torsten
3 篇 hermenegildo man...
3 篇 zhang yan
3 篇 balduccini marce...
3 篇 erdem esra
3 篇 chu geoffrey
3 篇 aziz rehan abdul
3 篇 morales jose f.
3 篇 lee joohyung
3 篇 inoue katsumi
2 篇 uras tansel
2 篇 giordano laura
2 篇 dumancic sebasti...
2 篇 soh takehide
2 篇 maher michael j.
2 篇 spiotta matteo
2 篇 jorissen albert
2 篇 janssens gerda

语言

125 篇 英文
1 篇 中文

检索条件"任意字段=29th International Conference on Inductive Logic Programming"

共 126 条记录，以下是111-120 订阅

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

详细简洁

排序：

Algebraic, logical and network representations in the design of software for combinatorial optimization

Algebraic, logical and network representations in the design...

引用

Annual Hawaii international conference on System Sciences (HICSS)

作者： C. Coullard R. Fourer Northwestern University Evanston IL USA

We survey three problem representations that are popularly applied in combinatorial optimization: algebraic modeling languages, constraint logic programming languages, and network diagrams. After first describing the kinds of optimization methods and systems most commonly associated with these alternatives, we consider how each representation has been advantageous and how its advantages have come to influence (or ought to influence) the design of the others. We focus especially on the possibility that general-purpose system designs, which are highly successful in other areas, might be extended to combinatorial optimization.

关键词： Intelligent networks Software design Design optimization Mathematical model Optimization methods Constraint optimization logic Linear programming Communication standards Packaging

来源：评论

学校读者我要写书评

暂无评论

7th international conference on Automated Deduction,CADE 1984

7th International Conference on Automated Deduction,CADE 198...

引用

7th international conference on Automated Deduction,CADE 1984

ISBN: (纸本)9780387960227

the proceedings contain 29 papers. the special focus in this conference is on Automated Deduction. the topics include: Termination of a Set of Rules Modulo a Set of Equations;associative-Commutative Unification;a Linear Time Algorithm for a Subcase of Second Order Instantiation;a New Equational Unification Method: A Generalisation of Martelli-Montanari’s Algorithm;a Case Study of theorem Proving by the Knuth-Bendix Method: Discovering that x3= x Implies Ring Commutativity;a Narrowing Procedure for theories with Constructors;a General inductive Completion Algorithm and Application to Abstract Data Types;the Next Generation of Interactive theorem Provers;the Linked Inference Principle, II: the User’s Viewpoint;a Portable Environment for Research in Automated Reasoning;a New Interpretation of the Resolution Principle;using Examples, Case Analysis, and Dependency Graphs in theorem Proving;expansion Tree Proofs and their Conversion to Natural Deduction Proofs;analytic and Non-analytic Proofs;applications of Protected Circumscription;implementation Strategies for Plan-Based Deduction;a programming Notation for Tactical Reasoning;the Mechanization of Existence Proofs of Recursive Predicates;solving Word Problems in Free Algebras Using Complexity Functions;solving a Problem in Relevance logic with an Automated theorem Prover;a Natural Proof System Based on Rewriting Techniques;EKL—A Mathematically Oriented Proof Checker;A Linear Characterization of NP-Complete Problems;a Satisfiability Tester for Non-Clausal Propositional Calculus;a Decision Method for Linear Temporal logic;a Progress Report on New Decision Algorithms for Finitely Presented Abelian Groups;canonical Forms in Finitely Presented Algebras.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Gamma programming paradigm and heterogeneous computing

Gamma programming paradigm and heterogeneous computing

引用

Annual Hawaii international conference on System Sciences (HICSS)

作者： V.K. Murthy E.V. Krishnamurthy School of Computing and Mathematics Deakin University Geelong VIC Australia Research School of Information Sciences and Engineering Australian National University Canberra ACT Australia

the Gamma programming paradigm is based on the multiset data structure. In this model a succession of chemical reactions consume the elements of the multiset or multiset of tuples, and produce new elements according to specific rules. this paper describes how the Gamma paradigm can be integrated with the entity-relationship (ER) model to structure parallel and distributed programs. Such an integration can permit querying as well as application programming in a seamless fashion based on the notion of transactions and provides for heterogeneous processing. We also describe how to design a scheduler for the Gamma paradigm and how this paradigm is useful in heterogeneous programming.

关键词： Parallel processing Chemical elements Erbium Parallel programming Data structures Algorithm design and analysis Network servers Artificial intelligence Genetic programming logic programming

来源：评论

学校读者我要写书评

暂无评论

Epistemic Specifications with Probabilities

Epistemic Specifications with Probabilities

引用

international conference on Tools for Artificial Intelligence (ICTAI)

作者： Shutao Zhang Zhizheng Zhang School of Computer Science and Engineering Southeast University Nanjin Jiangsu China

this paper develops a probabilistic-epistemic logic program language, PELP, by introducing probabilistic modal operators K w and PL into LP MLN programs, where w is a sub-interval of [0, 1]. Intuitively, a probabilistic epistemic literal K w e denotes that e is known with a probability in w, and a probabilistic comparing literal PL(e 1 , e 2 ) denotes it is known that the probability of e 1 is less than the one of e 2 . the semantics of the new language is based on the semantics of LP MLN and epistemic specifications. In this paper, we analyze the relationship between PELP and some other epistemic logic programming languages. We also propose an algorithm for solving PELP programs, and then investigate the application of PELP for modeling and solving the Monty Hall problem and a conformant planning problem with a threshold.

关键词： Probabilistic logic Cognition Semantics logic programming Syntactics Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Binary Constraint Trees and Structured Decomposability 29

Binary Constraint Trees and Structured Decomposability

引用

29th international conference on Principles and Practice of Constraint programming, CP 2023

作者： Kučera, Petr Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University Prague Czech Republic

ISBN: (纸本)9783959773003

A binary constraint tree (BCT, Wang and Yap 2022) is a normalized binary CSP whose constraint graph is a tree. A BCT constraint is a constraint represented with a BCT where some of the variables may be hidden (i.e. existentially quantified and used only for internal representation). Structured decomposable negation normal forms (SDNNF) were introduced by Pipatsrisawat and Darwiche (2008) as a restriction of decomposable negation normal forms (DNNF). Both DNNFs and SDNNFs were studied in the area of knowledge compilation. In this paper we show that the BCT constraints are polynomially equivalent to SDNNFs. In particular, a BCT constraint can be represented with an SDNNF of polynomial size and, on the other hand, a constraint that can be represented with an SDNNF, can be represented as a BCT constraint of polynomial size. this generalizes the result of Wang and Yap (2022) that shows that a multivalued decision diagram (MDD) can be represented with a BCT. Moreover, our result provides a full characterization of binary constraint trees using a language that is well studied in the area of knowledge compilation. It was shown by Wang and Yap (2023) that a CSP on n variables of domain sizes bounded by d that has treewidth k can be encoded as a BCT on O(n) variables with domain sizes O(dk+1). We provide an alternative reduction for the case of binary CSPs. this allows us to compile any binary CSP to an SDNNF of size that is parameterized by d and k. © Petr Kučera.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

A Clinical Set-up Tool (CST) For Rapid Stimulator programming

A Clinical Set-up Tool (CST) For Rapid Stimulator Programmin...

引用

29th Annual international conference of the IEEE Engineering in Medicine and Biology Society (EMBS 2007), vol.9

作者： P. Tresadern S. B. thies L. P. J. Kenney D. Howard J. Y. Goulermas Centre for Rehabilitation and Human Performance Research University of Sanford UK Department of Electrical Engineering and Electronics University of Liverpool UK

this paper presents an intuitive approach to the programming of Functional Electrical Stimulation (FES) hardware. A stimulation sequence is defined as a Finite State Machine (FSM) that is created and modified via an easy-to-use interface. Using a USB-equipped stimulator, data from an internal accelerometer are streamed to a PC whilst the subject undergoes the motion of interest. Simultaneously, the clinician labels the collected data via a number of key presses in order to train a sequence of simple classifiers. the 'optimal' (in a quantitative sense) parameters are then uploaded directly back to the stimulator for immediate stand-alone operation.

关键词： Accelerometers Functional programming Neuromuscular stimulation Hardware Automata logic programming profession Universal Serial Bus Presses Signal restoration

来源：评论

学校读者我要写书评

暂无评论

Analysing Gene Regulatory Networks by both Constraint programming and Model-Checking

Analysing Gene Regulatory Networks by both Constraint Progra...

引用

29th Annual international conference of the IEEE Engineering in Medicine and Biology Society (EMBS 2007), vol.11

作者： Jonathan Fromentin Jean-Paul Comet Pascale Le Gall Olivier Roux IRCCyN UMR 6597 CNRS École Centrale de Nantes Nantes France IBISC UMR 8042 & CNRS Université d'Evry Evry France

In this article, we propose a formal method to analyse gene regulatory networks (GRN). the dynamics of such systems is often described by an ordinary differential equation system, but has also been abstracted into a discrete transition system. this modeling depends on parameters for which different values are possible. Each instantiation of these parameters defines a possible dynamics and verification tools can be used to select the tuples of values which lead to dynamics consistent with known behaviours. GRN are so complex that their discrete modeling gives a number of possible dynamics exponential in function of the GRN's size (number of genes and interactions). In this paper, we propose to use constraint programming and CTL formal language to determine the set of all dynamics consistent with the known behavioral properties without enumerating all of them. this approach allows us therefore to minimize the computation time necessary for the research of these parameters.

关键词： Biological system modeling Dynamic programming Differential equations Formal languages Biology computing Cost accounting logic programming Proteins Piecewise linear techniques Genetics

来源：评论

学校读者我要写书评

暂无评论

Synchronous distribution of SIGNAL programs

Synchronous distribution of SIGNAL programs

引用

Annual Hawaii international conference on System Sciences (HICSS)

作者： P. Aubry P. Le Guernic S. Machard IRISA/INRIA Rennes France

SIGNAL, a synchronous and data-flow oriented language, allows the user to design safe real-time applications. Its compiler uses a single formalism called "synchronized data-flow graphs" (SDFGs) all along the conception chain from specification to proof and verification. We show how this formalism can be kept on until distributed code generation. the described implementation, called synchronous distribution, respects the semantics of SIGNAL. We finally show the limits of SDFGs and conclude with a discussion on the necessity of another model describing dynamic behaviours of distributed executions.

关键词： Signal processing Clocks Equations Signal design Handicapped aids programming profession logic Frequency synchronization Calculus Hardware

来源：评论

学校读者我要写书评

暂无评论

Tracking Code Clones in Evolving Software

Tracking Code Clones in Evolving Software

引用

international conference on Software Engineering (ICSE)

作者： Ekwa Duala-Ekoko Martin P. Robillard School of Computer Science McGill University Montreal QUE Canada

Code clones are generally considered harmful in software development, and the predominant approach is to try to eliminate them through refactoring. However, recent research has provided evidence that it may not always be practical, feasible, or cost-effective to eliminate certain clone groups. We propose a technique for tracking clones in evolving software. Our technique relies on the concept of abstract clone region descriptors (CRD), which describe clone regions within methods in a robust way that is independent from the exact text of the clone region or its location in a file. We present our definition of CRDs, and describe a complete clone tracking system capable of producing CRDs from the output of a clone detection tool, notify developers of modifications to clone regions, and support the simultaneous editing of clone regions. We report on two experiments and a case study conducted to assess the performance and usefulness of our approach.

关键词： Cloning Software systems Monitoring Computer science Robustness Computer languages Writing logic programming Q factor programming profession

来源：评论

学校读者我要写书评

暂无评论

Modeling and Solving the Multi-agent Pathfinding Problem in Picat

Modeling and Solving the Multi-agent Pathfinding Problem in ...

引用

international conference on Tools for Artificial Intelligence (ICTAI)

作者： Roman Barták Neng-Fa Zhou Roni Stern Eli Boyarski Pavel Surynek Charles University Praha Czech Republic CUNY Brooklyn College and Graduate Center New York USA Ben Gurion University of the Negev Beer Sheva Israel AIST Charles University Tokyo Praha Japan Czech Republic

the multi-agent pathfinding (MAPF) problem has attracted considerable attention because of its relation to practical applications. In this paper, we present a constraint-based declarative model for MAPF, together with its implementation in Picat, a logic-based programming language. We show experimentally that our Picat-based implementation is highly competitive and sometimes outperforms previous approaches. Importantly, the proposed Picat implementation is very versatile. We demonstrate this by showing how it can be easily adapted to optimize different MAPF objectives, such as minimizing makespan or minimizing the sum of costs, and for a range of MAPF variants. Moreover, a Picat-based model can be automatically compiled to several general-purpose solvers such as SAT solvers and Mixed Integer programming solvers (MIP). this is particularly important for MAPF because some MAPF variants are solved more efficiently when compiled to SAT while other variants are solved more efficiently when compiled to MIP. We analyze these differences and the impact of different declarative models and encodings on empirical performance.

关键词： Encoding Linear programming Adaptation models Optimization Tools Computer languages Search problems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共13页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：