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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

158 篇 会议
14 册 图书
5 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

123 篇 工学
- 119 篇 计算机科学与技术...
- 79 篇 软件工程
- 20 篇 电气工程
- 4 篇 信息与通信工程
- 3 篇 控制科学与工程
- 2 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 航空宇航科学与技...
- 2 篇 农业工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 环境科学与工程（可...
42 篇 理学
- 37 篇 数学
- 9 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
13 篇 管理学
- 8 篇 管理科学与工程(可...
- 6 篇 工商管理
- 5 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

26 篇 logic programmin...
9 篇 mathematical log...
9 篇 programming lang...
9 篇 artificial intel...
8 篇 logics and meani...
8 篇 constraint theor...
7 篇 programming tech...
5 篇 constraint satis...
5 篇 semantics
4 篇 constraint logic...
4 篇 computer program...
4 篇 functional progr...
3 篇 object oriented ...
3 篇 prolog (programm...
3 篇 software enginee...
3 篇 computer system ...
2 篇 computer science
2 篇 computer circuit...
2 篇 theory of comput...
2 篇 formal logic

机构

3 篇 ercis leonardo-c...
3 篇 univ complutense...
2 篇 institut für inf...
2 篇 fraunhofer first
2 篇 institut für wir...
2 篇 fraunhofer first...
2 篇 institut für inf...
2 篇 department of in...
2 篇 department of co...
2 篇 cau kiel inst in...
2 篇 michigan state u...
2 篇 htwk leipzig fak...
1 篇 arm inc architec...
1 篇 inria
1 篇 kielce univ tech...
1 篇 facoltà di scien...
1 篇 penn state univ ...
1 篇 singapore manage...
1 篇 univ politecn ca...
1 篇 lomonosov moscow...

作者

8 篇 hanus michael
4 篇 michael hanus
3 篇 hofstedt petra
3 篇 dageförde jan c.
3 篇 kuchen herbert
3 篇 antoy sergio
2 篇 waldmann johanne...
2 篇 sarna-starosta b...
2 篇 teegen finn
2 篇 winkelmann hendr...
2 篇 liu ke
2 篇 caballero rafael
2 篇 lepper markus
2 篇 dillon laura k.
2 篇 ricardo rocha
2 篇 seipel dietmar
2 篇 mossakowski till
2 篇 dasseville ingma...
2 篇 leuschel michael
2 篇 löffler sven

语言

175 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=18th International Workshop on Functional and Constraint Logic Programming"

共 177 条记录，以下是61-70 订阅

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

详细简洁

排序：

Embedding defeasible logic programs into generalized logic programs 28

Embedding defeasible logic programs into generalized logic p...

引用

28th workshop on (constraint) logic programming, WLP 2014 and 23rd international workshop on functional and (constraint) logic programming, WFLP 2014

作者： Baláž, Martin Frtús, Jozef Homola, Martin Šefránek, Ján Flouris, Giorgos Comenius Unversity in Bratislava Slovakia FORTH-ICS Greece

A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of "classical" logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strategy (CRS), in order to achieve an extended flexibility and generality. Our argumentation semantics is defined in the frame of assumption-based framework (ABF), which enables a unified view on different non-monotonic formalisms. We present an embedding of DeLP into an instance of ABF. Consequently, argumentation semantics defined for ABF are applicable to DeLP. Finally, DeLP with CRS is embedded into GLP. this transformation enables to commute argumentation semantics of a DeLP via semantics of the corresponding GLP.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A hybrid multi-agent approach to the solving supply chain problems 18th

A hybrid multi-agent approach to the solving supply chain pr...

引用

18th Annual international Conference on Knowledge-Based and Intelligent Information and Engineering Systems (KES)

作者： Sitek, Pawel Nielsen, Izabela Ewa Wikarek, Jaroslaw Kielce Univ Technol Inst Management & Control Syst PL-25314 Kielce Poland Univ Dept Mech & Mfg Engn Aalborg Denmark

the paper presents a concept and application of a hybrid multi-agent approach to modeling and optimization the supply chain problems. Two environments (mathematical programming (MP) and constraint logic programming (CLP)) and two types of agents were integrated. this integration and hybridization, complemented with an adequate transformation of the problem, facilitates a significant reduction of the combinatorial problem. the whole process takes place at the implementation layer, which makes it possible to use the structure of the problem being solved, implementation environments and the very data. the strengths of MP and CLP, in which constraints are treated in a different way and different methods are implemented, were combined to use the strengths of both. the proposed approach is particularly important for the decision models with an objective function and many discrete decision variables added up in multiple constraints. the presented multi-agent approach will be compared with classical mathematical programming on the same data sets and models. In addition, the proposed approach will be used for modelling and optimization of the hybrid model, which has not only linear constraints but also logical constraints. (C) 2014 the Authors. Published by Elsevier B.V.

关键词： multi-agent constraint logic programming mathematical programming optimization supply chain management hybridization

来源：评论

学校读者我要写书评

暂无评论

constraint logic programming for Hedges: A Semantic Reconstruction

Constraint Logic Programming for Hedges: A Semantic Reconstr...

引用

12th international Symposium on functional and logic programming (FLOPS)

作者： Dundua, Besik Florido, Mario Kutsia, Temur Marin, Mircea Univ Porto DCC FC Rua Campo Alegre 823 P-4100 Oporto Portugal Johannes Kepler Univ Linz RISC Linz Austria Ivane Javakhishvili Tbilisi State Univ VIAM Tbilisi Georgia W Univ Timisoara Timisoara Romania

ISBN: (纸本)9783319071510;9783319071503

We describe the semantics of CLP(H): constraint logic programming over hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. constraints involve equations between unranked terms and atoms for regular hedge language membership. We give algebraic semantics of CLP(H) programs, define a sound, terminating, and incomplete constraint solver, and describe some fragments of constraints for which the solver returns a complete set of solutions.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

PPI - A portable prolog interface for java 28

PPI - A portable prolog interface for java

引用

28th workshop on (constraint) logic programming, WLP 2014 and 23rd international workshop on functional and (constraint) logic programming, WFLP 2014

作者： Ostermayer, Ludwig Flederer, Frank Seipel, Dietmar University of Würzburg Department of Computer Science Am Hubland WürzburgD - 97074 Germany

As a first step to combine the two programming paradigms - objectoriented programming and logic programming - we have introduced a generic default mapping for JAVA objects and PROLOG terms. this mapping can be used without any modification to the JAVA classes that stand behind the objects. We also can generate automatically JAVA classes from predicates in PROLOG that map to each other. Apart from the default mapping it is further possible to customise the mapping by JAVA annotations. this allows for different Prolog-Views on a given class in JAVA. the data exchange format between JAVA and PROLOG is a simple textual representation of the JAVA objects and of the terms in PROLOG. Because this textual representation already conforms PROLOG's syntax, it can be directly used within PROLOG. In a second step we have to develop the link between JAVA and PROLOG that executes the mapping and communication. We already have presented a connector architecture for PROLOG and JAVA and an example interface that successfully uses our object term mapping with high performance. However, this interface depends heavily on a single PROLOG implementation: SWI-PROLOG. But as we have a generic mapping between JAVA objects and PROLOG terms, we also strive for an interface that also is generic and can be used independently of the PROLOG implementation. In this paper, we present the Portable Prolog Interface (PPI) for JAVA that uses the standard streams stdin, stdout and stderr to communicate with a PROLOG instance. Because these standard streams are available for all popular operating systems and are used by most of the PROLOG implementations for the user interaction, the PPI works for a broad range of PROLOG implementations. We evaluate our new generic interface PPI with different PROLOG engines and without changing the underlying JAVA or PROLOG source code of our tests.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Mapping OCL constraints into CTL-like logic and SML for UML validation 8

Mapping OCL constraints into CTL-like logic and SML for UML ...

引用

8th international workshop on Verification and Evaluation of Computer and Communication Systems, VECOS 2014

作者： Bennama, Miloud Bouabana-Tebibel, thouraya Alger Algeria

the UML (Unified Modeling Language) graphical models miss providing some pertinent elements of specification as constraints over objects and operations. To fill this lack, OCL (Object constraint Language) has been developed by IBM and integrated to UML as a modern and formal modeling language, which is easy to learn and efficient to use. On the other hand, many works emerged providing a formal semantics to UML dynamic diagrams by using CP-nets (High-level Petri Nets). the latter are verified based on system properties written in temporal logic. the purpose of this paper is to assist the UML modeler, not necessarily familiar with temporal logics, by letting him expressing the properties in OCL language and proposing an automatic mapping of OCL invariants and pre/post-conditions into CTL-like logic (Computational Tree logic) coupled with the functional programming language Standard ML. the obtained temporal logic formulas are verified over the state space of the CP-net models derived from UML diagrams by model-checking.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Constrained monotone function maximization and the supermodular degree 17

Constrained monotone function maximization and the supermodu...

引用

17th international workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2014 and the 18th international workshop on Randomization and Computation, RANDOM 2014

作者： Feldman, Moran Izsak, Rani School of Computer and Communications EPFL Route Cantonale Lausanne1015 Switzerland Faculty of Mathematics and Computer Science Weizmann Institute of Science 234 Herzl Street Rehovot7610001 Israel

ISBN: (纸本)9783939897743

the problem of maximizing a constrained monotone set function has many practical applications and generalizes many combinatorial problems such as κ-Coverage, Max-SAT, Set Packing, Maximum Independent Set and Welfare Maximization. Unfortunately, it is generally not possible to maximize a monotone set function up to an acceptable approximation ratio, even subject to simple constraints. One highly studied approach to cope with this hardness is to restrict the set function, for example, by requiring it to be submodular. An outstanding disadvantage of imposing such a restriction on the set function is that no result is implied for set functions deviating from the restriction, even slightly. A more flexible approach, studied by Feige and Izsak [ITCS 2013], is to design an approximation algorithm whose approximation ratio depends on the complexity of the instance, as measured by some complexity measure. Specifically, they introduced a complexity measure called supermodular degree, measuring deviation from submodularity, and designed an algorithm for the welfare maximization problem with an approximation ratio that depends on this measure. In this work, we give the first (to the best of our knowledge) algorithm for maximizing an arbitrary monotone set function, subject to a κ-extendible system. this class of constraints captures, for example, the intersection of κ-matroids (note that a single matroid constraint is sufficient to capture the welfare maximization problem). Our approximation ratio deteriorates gracefully with the complexity of the set function and k. Our work can be seen as generalizing both the classic result of Fisher, Nemhauser and Wolsey [Mathematical programming Study 1978], for maximizing a submodular set function subject to a κ-extendible system, and the result of Feige and Izsak for the welfare maximization problem. Moreover, when our algorithm is applied to each one of these simpler cases, it obtains the same approximation ratio as of the respective or

关键词： Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Component Based Design using constraint programming for Module Placement on FPGAs

Component Based Design using Constraint Programming for Modu...

引用

8th international workshop on Reconfigurable and Communication-Centric Systems-on-Chip (ReCoSoC)

作者： Wold, Alexander Koch, Dirk Torresen, Jim Univ Oslo Dept Informat N-0316 Oslo Norway

ISBN: (纸本)9781467361804

constraint satisfaction modeling is both an efficient, and an elegant approach to model and solve many real world problems. In this paper, we present a constraint solver targeting module placement in static and partial run-time reconfigurable systems. We use the constraint solver to compute feasible placement positions. Our placement model incorporates communication, implementation variants and device configuration granularity. In addition, we model heterogeneous resources such as embedded memory, multipliers and logic. Furthermore, we take into account that logic resources consist of different types including logic only LUTs, arithmetic LUTs with carry chains, and LUTs with distributed memory. Our work targets state of the art field-programmable gate arrays (FPGAs) in both design-time and run-time applications. In order to evaluate our placement model and module placer implementation, we have implemented a repository containing 200 fully functional, placed and routed relocatable modules. the modules are used to implement complete systems. this validates the feasibility of both the model and the module placer. Furthermore, we present simulated results for run-time applications, and compare this to other state of the art research. In run-time applications, the results point to improved resource utilization. this is a result of using a finer tile grid and complex module shapes.

关键词： constraint programming FPGA relocatable modules reconfigurable architectures partial run-time reconfiguration.

来源：评论

学校读者我要写书评

暂无评论

Proceedings of ASPOCP 2013 - Answer Set programming and Other Computing Paradigms, 6th international workshop

Proceedings of ASPOCP 2013 - Answer Set Programming and Othe...

引用

6th workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2013, co-located with the 29th international Conference on logic programming, ICLP 2013

the proceedings contain 12 papers. the topics discussed include: properties of answer set programming with convex generalized atoms;hybrid automated reasoning tools: from black-box to clear-box integration;aspartame: solving constraint satisfaction problems with answer set programming;a functional view of strong negation in answer set programming;an algebra of causal chains;query answering in object oriented knowledge bases in logic programming: description and challenge for ASP;the DIAMOND system for argumentation: preliminary report;a system for interactive query answering with answer set programming;and generating shortest synchronizing sequences using answer set programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

19th international Conference on Applications of Declarative programming and Knowledge Management, INAP 2011 and 25th workshop on logic programming, WLP 2011

19th International Conference on Applications of Declarative...

引用

19th international Conference on Applications of Declarative programming and Knowledge Management, INAP 2011 and 25th workshop on logic programming, WLP 2011

ISBN: (纸本)9783642415234

the proceedings contain 21 papers. the special focus in this conference is on Invited Talks, Languages, Answer-Set programming and Abductive Reasoning, Semantics, constraints and logic programming, Answer-Set programming and Model Expansion and WLP System Descriptions. the topics include: the IMPL policy language for managing inconsistency in multi-context systems;the parameterized complexity of constraint satisfaction and reasoning;translating nondeterministic functional language based on attribute grammars into java;sensitivity analysis for declarative relational query languages with ordinal ranks;a uniform fixpoint approach to the implementation of inference methods for deductive databases;translating answer-set programs into bit-vector logic;making use of advances in answer-set programming for abstract argumentation systems;confidentiality-preserving publishing of EDPs for credulous and skeptical users;every formula-based logic program has a least infinite-valued model;descriptive approach to preferred answer sets;solving modular model expansion: case studies;a constraint-based interactive product configurator;HEX-programs with nested program calls;a prototype of a knowledge-based programming environment;an IDE for answer-set programming-preliminary report;a system for visualising and visual editing of interpretations for answer-set programsa and unit testing in ASPIDE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A bisimulation between DPLL(τ) and a proof-search strategy for the focused sequent calculus

A bisimulation between DPLL(τ) and a proof-search strategy ...

引用

8th international workshop on logical Frameworks and Meta-Languages: theory and Practice, LFMTP 2013 - Co-located with the 18th ACM SIGPLAN international Conference on functional programming, ICFP 2013

作者： Farooque, Mahfuza Graham-Lengrand, St´ephane Mahboubi, Assia CNRS Ecole Polytechnique France INRIA France

ISBN: (纸本)9781450323826

We describe how the Davis-Putnam-Logemann-Loveland procedure DPLL is bisimilar to the goal-directed proof-search mechanism described by a standard but carefully chosen sequent calculus. We thus relate a procedure described as a transition system on states to the gradual completion of incomplete proof-trees. For this we use a focused sequent calculus for polarised classical logic, for which we allow analytic cuts. the focusing mechanisms, together with an appropriate management of polarities, then allows the bisimulation to hold: the class of sequent calculus proofs that are the images of the DPLL runs finishing on UNSAT, is identified with a simple criterion involving polarities. We actually provide those results for a version DPLL(τ ) of the procedure that is parameterised by a background theory τ for which we can decide whether conjunctions of literals are consistent. this procedure is used for Satisfiability Modulo theories (SMT) generalising propositional SAT. For this, we extend the standard focused sequent calculus for propositional logic in the same way DPLL(τ ) extends DPLL: with the ability to call the decision procedure for T . DPLL(τ) is implemented as a plugin for PSYCHE, a proofsearch engine for this sequent calculus, to provide a sequentcalculus based SMT-solver. © 2013 by the Association for Computing Machinery, Inc. (ACM).

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：