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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

146 篇 会议
14 册 图书

馆藏范围

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

日期分布

学科分类号

122 篇 工学
- 121 篇 计算机科学与技术...
- 70 篇 软件工程
- 4 篇 电气工程
- 4 篇 信息与通信工程
- 2 篇 电子科学与技术（可...
- 2 篇 控制科学与工程
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 生物医学工程（可授...
- 1 篇 网络空间安全
38 篇 理学
- 36 篇 数学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 生物学
5 篇 管理学
- 3 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

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

机构

4 篇 univ politecn va...
3 篇 katholieke univ ...
3 篇 nagoya inst tech...
3 篇 univ north texas...
2 篇 univ politecn ma...
2 篇 microsoft resear...
2 篇 univ fed rio gra...
2 篇 univ politecn va...
2 篇 katholieke univ ...
2 篇 univ southern de...
2 篇 rhein westfal th...
2 篇 cnr iasi rome
2 篇 univ complutense...
2 篇 tech u madrid sc...
2 篇 imdea software i...
2 篇 univ new mexico ...
2 篇 univ new mexico ...
2 篇 ecole polytech l...
2 篇 univ ulm d-89069...
2 篇 ecole polytech i...

作者

6 篇 vidal german
4 篇 tarau paul
4 篇 schneider-kamp p...
4 篇 silva josep
4 篇 falaschi moreno
4 篇 seki hirohisa
4 篇 abdennadher slim
4 篇 giesl juergen
3 篇 proietti maurizi...
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...
2 篇 komendantskaya e...
2 篇 sharaf nada

语言

157 篇 英文
3 篇 中文

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

共 160 条记录，以下是121-130 订阅

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

详细简洁

排序：

Analysis of Rewriting-based Systems as First-Order theories 27th

Analysis of Rewriting-Based Systems as First-Order Theories

引用

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

作者： Lucas, Salvador Univ Politecn Valencia DSIC Valencia Spain

ISBN: (纸本)9783319944609;9783319944593

Computational systems based on a first-order language that can be given a canonical model which captures provability in the corresponding calculus can often be seen as first-order theories S, and computational properties of such systems can be formulated as first-order sentences. that hold in such a canonical model of S. In this setting, standard results regarding the preservation of satisfiability of different classes of first-order sentences yield a number of interesting applications in program analysis. In particular, properties expressed as existentially quantified boolean combinations of atoms (for instance, a set of unification problems) can then be disproved by just finding an arbitrary model of the considered theory plus the negation of such a sentence. We show that rewriting-based systems fit into this approach. Many computational properties (e.g., infeasibility and non-joinability of critical pairs in (conditional) rewriting, non-loopingness, or the secure access to protected pages of a web site) can be investigated in this way. Interestingly, this semantic approach succeeds when specific techniques developed to deal with the aforementioned problems fail.

关键词： logical models program analysis Rewriting-based systems

来源：评论

学校读者我要写书评

暂无评论

Symbolic Execution and thresholding for Efficiently Tuning Fuzzy logic programs 26th

Symbolic Execution and Thresholding for Efficiently Tuning F...

引用

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

作者： Moreno, Gines Penabad, Jaime Riaza, Jose A. Vidal, German UCLM Dept Comp Syst Albacete 02071 Spain UCLM Dept Math Albacete 02071 Spain Univ Politecn Valencia MiST DSIC Valencia Spain

ISBN: (纸本)9783319631394;9783319631387

Fuzzy logic programming is a growing declarative paradigm aiming to integrate fuzzy logic into logic programming. One of the most difficult tasks when specifying a fuzzy logic program is determining the right weights for each rule, as well as the most appropriate fuzzy connectives and operators. In this paper, we introduce a symbolic extension of fuzzy logic programs in which some of these parameters can be left unknown, so that the user can easily see the impact of their possible values. Furthermore, given a number of test cases, the most appropriate values for these parameters can be automatically computed. Finally, we show some benchmarks that illustrate the usefulness of our approach.

关键词： Fuzzy logic programming Symbolic execution Tuning

来源：评论

学校读者我要写书评

暂无评论

lpopt: A Rule Optimization Tool for Answer Set programming 26th

lpopt: A Rule Optimization Tool for Answer Set Programming

引用

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

作者： Bichler, Manuel Morak, Michael Woltran, Stefan TU Wien Vienna Austria

ISBN: (纸本)9783319631394;9783319631387

State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-ground programs containing variables into variable-free, propositional programs. the size of this grounding depends heavily on the size of the non-ground rules, and thus, reducing the size of such rules is a promising approach to improve solving performance. To this end, in this paper we announce lpopt, a tool that decomposes large logic programming rules into smaller rules that are easier to handle for current solvers. the tool is specifically tailored to handle the standard syntax of the ASP language (ASP-Core) and makes it easier for users to write efficient and intuitive ASP programs, which would otherwise often require significant hand-tuning by expert ASP engineers. It is based on an idea proposed by Morak and Woltran (2012) that we extend significantly in order to handle the full ASP syntax, including complex constructs like aggregates, weak constraints, and arithmetic expressions. We present the algorithm, the theoretical foundations on how to treat these constructs, as well as an experimental evaluation showing the viability of our approach.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Completeness of unfolding for rewriting logic theories

Completeness of unfolding for rewriting logic theories

引用

作者： Alpuente, María Baggi, Michele Falaschi, Moreno Ballis, Demis DSIC Universidad Politécnica de Valencia Camino de Vera s/n 46071 Valencia Spain Dip. di Scienze Matematiche e Informatiche Pian dei Mantellini 44 53100 Siena Italy Dip. Matematica e Informatica Via delle Scienze 206 33100 Udine Italy

ISBN: (纸本)9780769543246

Many transformation systems for program optimization, program synthesis, and program specialization are based on fold/unfold transformations. In this paper, we investigate the semantic properties of a narrowing-based unfolding transformation that is useful to transform rewriting logic theories. We also present a transformation methodology that is able to determine whether an unfolding transformation step would cause incompleteness and avoid this problem by completing the transformed rewrite theory with suitable extra rules. More precisely, our methodology identifies the sources of incompleteness and derives a set of rules that are added to the transformed rewrite theory in order to preserve the semantics of the original theory. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Efficient local unfolding with ancestor stacks for full Prolog

引用

14th international symposium on logic based program synthesis and transformation

作者： Puebla, G Albert, E Hermenegildo, M Tech U Madrid Sch Comp Sci Madrid Spain Univ Complutense Madrid Sch Comp Sci Madrid Spain Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA Univ New Mexico Dept Elect & Comp Engn Albuquerque NM 87131 USA

ISBN: (纸本)3540266550

the integration of powerful partial evaluation methods into practical compilers for logic programs is still far from reality. this is related both to 1) efficiency issues and to 2) the complications of dealing with practical programs. Regarding efficiency, the most successful unfolding rules used nowadays are based on structural orders applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with any structural order and allows a stack-based implementation without losing any opportunities for specialization. Regarding the second issue, we propose assertion-based techniques which allow our approach to deal with real programs that include (Prolog) built-ins and external predicates in a very extensible manner. Finally, we report on our implementation of these techniques in a practical partial evaluator, embedded in a state of the art compiler which uses global analysis extensively (the Ciao compiler and, specifically, its preprocessor CiaoPP). the performance analysis of the resulting system shows that our techniques, in addition to dealing with practical programs, are also significantly more efficient in time and somewhat more efficient in memory than traditional tree-based implementations.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms 27th

On Uniquely Closable and Uniquely Typable Skeletons of Lambd...

引用

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

作者： Bodini, Olivier Tarau, Paul UMR CNRS 7030 Lab Informat Paris Nord Paris France Univ North Texas Dept Comp Sci & Engn Denton TX 76203 USA

ISBN: (纸本)9783319944609;9783319944593

Uniquely closable skeletons of lambda terms are Motzkintrees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices. Likewise, uniquely typable skeletons of closed lambda terms predetermine the unique simply-typed lambda term that can be obtained by labeling their leaves with de Bruijn indices. We derive, through a sequence of logic program transformations, efficient code for their combinatorial generation and study their statistical properties. As a result, we obtain context-free grammars describing closable and uniquely closable skeletons of lambda terms, opening the door for their in-depth study with tools from analytic combinatorics. Our empirical study of the more difficult case of (uniquely) typable terms reveals some interesting open problems about their density and asymptotic behavior. As a connection between the two classes of terms, we also show that uniquely typable closed lambda term skeletons of size 3n + 1 are in a bijection with binary trees of size n.

关键词： Deriving efficient logic programs logic programming and computational mathematics Combinatorics of lambda terms Inferring simple types Uniquely closable lambda term skeletons Uniquely typable lambda term skeletons

来源：评论

学校读者我要写书评

暂无评论

Multivariant Assertion-based Guidance in Abstract Interpretation 28th

Multivariant Assertion-Based Guidance in Abstract Interpreta...

引用

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

作者： Garcia-Contreras, Isabel Morales, Jose F. Hermenegildo, Manuel, V IMDEA Software Inst Madrid Spain Univ Politecn Madrid UPM Madrid Spain

ISBN: (纸本)9783030138387;9783030138370

Approximations during program analysis are a necessary evil, as they ensure essential properties, such as soundness and termination of the analysis, but they also imply not always producing useful results. Automatic techniques have been studied to prevent precision loss, typically at the expense of larger resource consumption. In both cases (i.e., when analysis produces inaccurate results and when resource consumption is too high), it is necessary to have some means for users to provide information to guide analysis and thus improve precision and/or performance. We present techniques for supporting within an abstract interpretation framework a rich set of assertions that can deal with multivariance/context-sensitivity, and can handle different run-time semantics for those assertions that cannot be discharged at compile time. We show how the proposed approach can be applied to both improving precision and accelerating analysis. We also provide some formal results on the effects of such assertions on the analysis results.

关键词： program analysis Multivariance Context sensitivity Abstract interpretation Assertions Static analysis User guidance

来源：评论

学校读者我要写书评

暂无评论

System Description: DeepLLM, Casting Dialog threads into logic programs 17th

System Description: DeepLLM, Casting Dialog Threads into Log...

引用

17th international symposium on Functional and logic programming (FLOPS)

作者： Tarau, Paul Univ North Texas Denton TX 76203 USA

ISBN: (纸本)9789819722990;9789819723003

We automate deep step-by step reasoning in an LLM dialog thread by recursively exploring alternatives (OR-nodes) and expanding details (AND-nodes) up to a given depth. Starting from a single succinct task-specific initiator we steer the automated dialog thread to stay focussed on the task by synthesizing a prompt that summarizes the depth-first steps taken so far. Our algorithm is derived from a simple recursive descent implementation of a Horn Clause interpreter, except that we accommodate our logic engine to fit the natural language reasoning patterns LLMs have been trained on. Semantic similarity to ground-truth facts or oracle advice from another LLM instance is used to restrict the search space and validate the traces of justification steps returned as focussed and trustable answers. At the end, the unique minimal model of a generated Horn Clause program collects the results of the reasoning process. As applications, we sketch implementations of consequence predictions, causal explanations, recommendation systems and topic-focussed exploration of scientific literature.

关键词： automation of LLM dialog threads recursive task-focused steering of LLM interactions logic-programming driven LLM reasoning LLM-based algorithmic information retrieval context-driven LLM prompt synthesis

来源：评论

学校读者我要写书评

暂无评论

A Hiking Trip through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms 26th

A Hiking Trip Through the Orders of Magnitude: Deriving Effi...

引用

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

作者： Tarau, Paul Univ North Texas Dept Comp Sci & Engn Denton TX 76203 USA

ISBN: (纸本)9783319631394;9783319631387

Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of simply-typed closed lambda terms of a given size. Moreover, their asymptotic scarcity among the set of closed lambda terms makes counting them via brute force generation and type inference quickly intractable, with previous published work showing counts for them only up to size 10. By taking advantage of the synergy between logic variables, unification with occurs check and efficient backtracking in today's Prolog systems, we climb 4 orders of magnitude above previously known counts by deriving progressively faster Horn Clause programs that generate and/or count the set of closed simply-typed lambda terms of sizes up to 14. A similar count for closed simply-typed normal forms is also derived up to size 14.

关键词： logic programming transformations Type inference Combinatorics of lambda terms Simply-typed lambda calculus Simply-typed normal forms

来源：评论

学校读者我要写书评

暂无评论

A Productivity Checker for logic programming 26th

A Productivity Checker for Logic Programming

引用

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

作者： Komendantskaya, Ekaterina Johann, Patricia Schmidt, Martin Heriot Watt Univ Edinburgh Midlothian Scotland Appalachian State Univ Boone NC 28608 USA Univ Osnabruck Osnabruck Germany

ISBN: (纸本)9783319631394;9783319631387

Automated analysis of recursive derivations in logic programming is known to be a hard problem. Both termination and non-termination are undecidable problems in Turing-complete languages. However, some declarative languages offer a practical work-around for this problem, by making a clear distinction between whether a program is meant to be understood inductively or coinductively. For programs meant to be understood inductively, termination must be guaranteed, whereas for programs meant to be understood coinductively, productive non-termination (or "productivity") must be ensured. In practice, such classification helps to better understand and implement some non-terminating computations. logic programming was one of the first declarative languages to make this distinction: in the 1980's, Lloyd and van Emden's "computations at infinity" captured the big-step operational semantics of derivations that produce infinite terms as answers. In modern terms, computations at infinity describe "global productivity" of computations in logic programming. Most programming languages featuring coinduction also provide an observational, or small-step, notion of productivity as a computational counterpart to global productivity. this kind of productivity is ensured by checking that finite initial fragments of infinite computations can always be observed to produce finite portions of their infinite answer terms. In this paper we introduce a notion of observational productivity for logic programming as an algorithmic approximation of global productivity, give an effective procedure for semi-deciding observational productivity, and offer an implemented automated observational productivity checker for logic programs.

关键词： logic programming Corecursion Coinduction Termination Productivity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共16页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：