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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

147 篇 会议
13 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

131 篇 工学
- 130 篇 计算机科学与技术...
- 78 篇 软件工程
- 7 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 材料科学与工程（可...
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 生物医学工程（可授...
40 篇 理学
- 38 篇 数学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 生物学
6 篇 管理学
- 5 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

38 篇 logic programmin...
11 篇 semantics
10 篇 logics and meani...
9 篇 computer circuit...
9 篇 program transfor...
9 篇 artificial intel...
8 篇 mathematical log...
6 篇 program analysis
6 篇 software enginee...
6 篇 programming tech...
5 篇 programming lang...
4 篇 software enginee...
4 篇 constraint handl...
3 篇 program synthesi...
3 篇 static analysis
3 篇 source-to-source...
2 篇 program debuggin...
2 篇 floating-point n...
2 篇 concurrent const...
2 篇 types

机构

4 篇 univ politecn va...
3 篇 katholieke univ ...
3 篇 nagoya inst tech...
3 篇 imdea software i...
2 篇 univ politecn ma...
2 篇 dept. of compute...
2 篇 spanish council ...
2 篇 univ fed rio gra...
2 篇 univ politecn va...
2 篇 katholieke univ ...
2 篇 univ southern de...
2 篇 rhein westfal th...
2 篇 imdea software
2 篇 univ complutense...
2 篇 univ north texas...
2 篇 tech u madrid sc...
2 篇 iremia universit...
2 篇 univ new mexico ...
2 篇 univ new mexico ...
2 篇 ecole polytech l...

作者

6 篇 vidal german
6 篇 seki hirohisa
4 篇 schneider-kamp p...
4 篇 silva josep
4 篇 falaschi moreno
4 篇 abdennadher slim
4 篇 giesl juergen
3 篇 proietti maurizi...
3 篇 hermenegildo man...
3 篇 carro manuel
3 篇 morales jose f.
3 篇 de schreye danny
3 篇 leuschel michael
3 篇 lucas salvador
3 篇 meseguer jose
2 篇 puebla german
2 篇 bruynooghe mauri...
2 篇 senni valerio
2 篇 michael hanus
2 篇 gallagher john p...

语言

158 篇 英文
3 篇 中文

检索条件"任意字段=14th International Symposium on Logic Based Program Synthesis and Transformation"

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

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

详细简洁

排序：

Drill and Join: A Method for Exact Inductive program synthesis 24th

Drill and Join: A Method for Exact Inductive Program Synthes...

引用

24th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Balaniuk, Remis Univ Catolica Brasilia Brasilia DF Brazil

ISBN: (纸本)9783319178226;9783319178219

In this paper we propose a novel semi-supervised active machine-learning method, based on two recursive higher-order functions that can inductively synthesize a functional computer program. based on properties formulated using abstract algebra terms, the method uses two combined strategies: to reduce the dimensionality of the Boolean algebra where a target function lies and to combine known operations belonging to the algebra, using them as a basis to build a program that emulates the target function. the method queries for data on specific points of the problem input space and build a program that exactly fits the data. Applications of this method include all sorts of systems based on bitwise operations. Any functional computer program can be emulated using this approach. Combinatorial circuit design, model acquisition from sensor data, reverse engineering of existing computer programs are all fields where the proposed method can be useful.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

On Inductive and Coinductive Proofs via Unfold/Fold transformations

On Inductive and Coinductive Proofs via Unfold/Fold Transfor...

引用

19th international symposium on logic-based program synthesis and transformation

作者： Seki, Hirohisa Nagoya Inst Technol Dept Comp Sci Showa Ku Nagoya Aichi 4668555 Japan

ISBN: (纸本)9783642125911

We consider a new application condition of negative unfolding, which guarantees its safe use in unfold/fold transformation of stratified logic programs. the new condition of negative unfolding is a natural one, since it is considered as a special case of replacement rule. the correctness of our unfold/fold transformation system in the sense of the perfect model semantics is proved. We then consider the coinductive proof rules proposed by Jaffar et al. We show that our unfold/fold transformation system, when used together with Lloyd-Topor transformation, can prove a proof problem which is provable by the coinductive proof rules by Jaffar et al. To this end, we propose a new replacement rule, called sowed replacement, which is not necessarily equivalence-preserving, but is essential to perform a reasoning step corresponding to coinduction.

关键词： Preservation of equivalence negative unfolding coinduction unfold/fold transformation

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Approach to Conjunctive Partial Evaluation of logic programs

引用

20th international symposium on logic-based program synthesis and transformation, LOPSTR 2010

作者： Vidal, German Univ Politecn Valencia MiST DSIC Valencia Spain

ISBN: (纸本)9783642205507

Conjunctive partial deduction is a well-known technique for the partial evaluation of logic programs. the original formulation follows the so called online approach where all termination decisions are taken on-the-fly. In contrast, offline partial evaluators first analyze the source program and produce an annotated version so that the partial evaluation phase should only follow these annotations to ensure the termination of the process. In this work, we introduce a lightweight approach to conjunctive partial deduction that combines some of the advantages of both online and offline styles of partial evaluation.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Coinductive logic programming with Negation

Coinductive Logic Programming with Negation

引用

19th international symposium on logic-based program synthesis and transformation

作者： Min, Richard Gupta, Gopal Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA

ISBN: (纸本)9783642125911

We introduce negation into coinductive logic programming (co-LP) via what we term Coinductive SLDNF (co-SLDNF) resolution. We present declarative and operational semantics of co-SLDNF resolution and present their equivalence under the restriction of rationality. Co-LP with co-SLDNF resolution provides a powerful, practical and efficient operational semantics for Fitting's Kripke-Kleene three-valued logic with restriction of rationality. Further, applications of co-SLDNF resolution are also discussed and illustrated where Co-SLDNF resolution allows one to develop elegant implementations of modal logics. Moreover it provides the capability of non-monotonic inference (e.g., predicate Answer Set programming) that can be used to develop novel and effective first-order modal non-monotonic inference engines.

关键词： Coinductive logic programming Negation as Failure program Completion Kripke-Kleene three-valued logic

来源：评论

学校读者我要写书评

暂无评论

Intuitionistic logic programming for SQL 26th

Intuitionistic Logic Programming for SQL

引用

26th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Saenz-Perez, Fernando Univ Complutense Madrid Declarat Programming Grp Dept Ingn Software & Inteligencia Artificial Madrid Spain

ISBN: (纸本)9783319631394;9783319631387

Intuitionistic logic programming provides the notion of embedded implication in rule bodies, which can be used to reason about a current database modified by the antecedent. this can be applied to a system that translates SQL to Datalog to solve SQL WIth queries, for which relations are locally defined and can therefore be understood as locally added to the current database. In addition, assumptions in SQL queries as either adding or removing data can be modelled in this way as well, which is an interesting feature for decision-support scenarios. this work suggests a way to apply intuitionistic logic programming to SQL, and provides a pointer to a working system implementing this idea.

关键词： Intuitionistic logic programming SQL Datalog Extended relational algebra

来源：评论

学校读者我要写书评

暂无评论

A New Functional-logic Compiler for Curry: SPRITE 26th

A New Functional-Logic Compiler for Curry: SPRITE

引用

26th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Antoy, Sergio Jost, Andy Portland State Univ Dept Comp Sci Portland OR 97207 USA

ISBN: (纸本)9783319631394;9783319631387

We introduce a new native code compiler for Curry code-named Sprite. Sprite is based on the Fair Scheme, a compilation strategy that provides instructions for transforming declarative, non-deterministic programs of a certain class into imperative, deterministic code. We outline salient features of Sprite, discuss its implementation of Curry programs, and present benchmarking results. Sprite is the first-to-date operationally complete implementation of Curry. Preliminary results show that ensuring this property does not incur a significant penalty.

关键词： Functional logic programming Compiler implementation Operational completeness

来源：评论

学校读者我要写书评

暂无评论

Combining logic programs and monadic second order logics by program transformation

引用

12th international Workshop on logic based program synthesis and transformation

作者： Fioravanti, F Pettorossi, A Proietti, M IASI CNR I-00185 Rome Italy Univ Roma Tor Vergata DISP I-00133 Rome Italy

ISBN: (纸本)3540404384

We present a program synthesis method based on unfold/fold transformation rules which can be used for deriving terminating definite logic programs from formulas of the Weak Monadic Second Order theory of one successor (WS1S). this synthesis method can also be used as a proof method which is a decision procedure for closed formulas of WS1S. We apply our synthesis method for translating CLP(WS1S) programs into logic programs and we use it also as a proof method for verifying safety properties of infinite state systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Temporal logic constraints in the biochemical abstract machine BIOCHAM

引用

15th international symposium on logic based program synthesis and transformation

作者： Fages, Frangois INRIA Rocquencourt France

ISBN: (纸本)3540326545

Recent progress in Biology and data-production technologies push research toward a new interdisciplinary field, named Systems Biology, where the challenge is to break the complexity walls for reasoning about large biomolecular interaction systems. Pioneered by Regev, Silverman and Shapiro, the application of process calculi to the description of biological processes has been a source of inspiration for many researchers coming from the programming language community. In this presentation, we give an overview of the Biochemical Abstract Machine (BIOCHAM), in which biochemical systems are modeled using a simple language of reaction rules, and the biological properties of the system, known from experiments, are formalized in temporal logic. In this setting, the biological validation of a model can be done by model-checking, both qualitatively and quantitatively. Moreover, the temporal properties can be turned into specifications for learning modifications or refinements of the model, when incorporating new biological knowledge.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A transformational semantics of static embedded implications of normal logic programs

引用

15th international symposium on logic based program synthesis and transformation

作者： Pasarella, Edelmira Orejas, Fernando Pino, Elvira Navarro, Marisa Univ Politecn Cataluna Dpto LSI ES-08034 Barcelona Spain Univ Basque Country Dpto LSI E-20080 San Sebastian Spain

ISBN: (纸本)3540326545

there are mainly two approaches for structuring logic programs. the first one is based on defining some notion of program unit or module and on providing a number of composition operators. the second approach consists in enriching logic programming with a mechanism of abstraction and scoping rules that are frequently found, for instance, in procedural programming. More precisely, this approach has been advocated by Miller and others using implications embedded in the goals of the given program as a structuring mechanism. However, as Giordano, Martelli and Rossi pointed out, we can associate two different visibility rules (static and dynamic) to this kind of structuring mechanism where, obviously, the semantics of the given program depends on the chosen rule. In this paper we consider normal constraint logic programs (with constructive negation a la Drabent as operational semantics) extended with embedded implications with a static visibility rule. this class of programs combines the expressive power of normal programs with the capability to organize and to enhance dinamically their sets of clauses. In particular, first, we introduce an operational semantics based on constructive negation for this class of programs, taking into account the static visibility rule. then, we present an alternative semantics in terms of a transformation of the given structured program into a flat one. Finally, we prove the adequacy of this transformation by showing that it preserves the computed answers of the given program. Obviously, this transformation semantics can be used as the basis for an implementation of this structuring mechanism.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Exhaustive Execution of CHR through Source-to-Source transformation 24th

Exhaustive Execution of CHR Through Source-to-Source Transfo...

引用

24th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Elsawy, Ahmed Zaki, Amira Abdennadher, Slim German Univ Cairo Cairo Egypt Univ Ulm D-89069 Ulm Germany

ISBN: (纸本)9783319178226;9783319178219

Constraint Handling Rules (CHR) is a committed-choice rule-based programming language. Rules rewrite a global multi-set of constraints to another. Overlapping sets of constraints within the rules and the order of constraints within rules and queries entail different derivation paths. In this work, a novel operational strategy is proposed which enables a high-level form of execution control that empowers a comprehensive and customizable execution strategy. It allows full space exploration for any CHR program, thus finding all possible results to a query which is interesting for many non-confluent programs. the proposed transformation is performed as a source-to-source transformation from any CHR program to one utilizing disjunction to force an exhaustive explorative execution strategy. the work is complemented by formal arguments to prove the correctness and completeness of the transformation.

关键词： Constraint Handling Rules Execution flow control Exhaustive execution Search space exploration Source-to-source transformation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：