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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

28 篇 会议
3 册 图书

馆藏范围

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

日期分布

学科分类号

22 篇 工学
- 22 篇 计算机科学与技术...
- 11 篇 软件工程
- 5 篇 信息与通信工程
- 4 篇 电气工程
- 2 篇 控制科学与工程
4 篇 理学
- 3 篇 数学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

5 篇 logic programmin...
3 篇 artificial intel...
2 篇 computer circuit...
2 篇 probabilistic lo...
2 篇 programming tech...
2 篇 differentiation ...
1 篇 saturation based...
1 篇 computer science
1 篇 fuzzy logic
1 篇 inference engine...
1 篇 formal logic
1 篇 hidden markov mo...
1 篇 software enginee...
1 篇 reasoning
1 篇 markov processes
1 篇 ai explainabilit...
1 篇 vectors
1 篇 bottom-up reason...
1 篇 robots
1 篇 crime

机构

2 篇 univ udine udine
2 篇 kurt gödel socie...
1 篇 tu-wien austria
1 篇 vienna universit...
1 篇 department of co...
1 篇 university of ca...
1 篇 katholieke univ ...
1 篇 cardiff univ sch...
1 篇 institut für inf...
1 篇 university colle...
1 篇 microsoft resear...
1 篇 tu wien austria
1 篇 university of ox...
1 篇 fraunhofer first
1 篇 school of comput...
1 篇 national institu...
1 篇 julius-maximilia...
1 篇 guangdong univer...
1 篇 lipn cnrs umr 70...
1 篇 institute of log...

作者

3 篇 dreossi talissa
2 篇 freiman robert
2 篇 dovier agostino
2 篇 formisano andrea
1 篇 andrew craik
1 篇 shen yi-dong
1 篇 ranalter daniel
1 篇 masanobu umeda
1 篇 hommersom arjen
1 篇 wendt m
1 篇 michels steffen
1 篇 lolićanela@logic...
1 篇 sakama chiaki
1 篇 manzato agostino
1 篇 chowdhury rezaul...
1 篇 de raedt luc
1 篇 walęga przemysla...
1 篇 lang timo
1 篇 law mark
1 篇 wayne reid

语言

30 篇 英文
2 篇 中文

检索条件"任意字段=25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2024"

共 31 条记录，以下是1-10 订阅

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

详细简洁

排序：

25th conference on logic for programming, artificial intelligence and reasoning, lpar 2024

25th Conference on Logic for Programming, Artificial Intelli...

引用

25th conference on logic for programming, artificial intelligence and reasoning, lpar 2024

the proceedings contain 31 papers. the special focus in this conference is on logic for programming, artificial intelligence and reasoning. the topics include: Automated theorem Provers Help Improve Large Language Model reasoning;reasoning About Group Polarization: From Semantic Games to Sequent Systems;saturating Sorting without Sorts;waste Reduction: Experiments in Sharing Clauses between Runs of a Portfolio of Strategies (Experimental Paper);Automatic Detection of Vulnerable Variables for CTL Properties of Programs;a Tool for reasoning about Trust and Belief;efficient Simulation for Hardware Model Checking;VIRAS: Conflict-Driven Quantifier Elimination Integer-Real Arithmetic;tree-Verifiable Graph Grammar;Hybrid Intersection Types for PCF;Automatic Bit-and Memory-Precise Verification of eBPF Code;scaling CheckMate for Game-theoretic Security;On Translations of Epsilon Proofs to LK;a Generic Deskolemization Strategy;first Experiments with Neural cvc5;rewriting and Inductive reasoning;herbrand’s theorem in Inductive Proofs;experiments with Choice in Dependently-Typed Higher-Order logic;Certifying Incremental SAT Solving;a Simple Token Game and its logic;prover9 Unleashed: Automated Configuration for Enhanced Proof Discovery;deep Inference in Proof Search: the Need for Shallow Inference;symbolic Realisation of Epistemic Processes;Sometimes Hoarding is Harder than Cleaning: NP-hardness of Maximum Blocked-Clause Addition;fuzzy Datalog∃ over Arbitrary t-Norms;Verifying SQL Queries using theories of Tables and Relations;confluence for Proof Nets via Parallel Cut Elimination;automated Synthesis of Decision Lists for Polynomial Specifications over Integers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Waste Reduction: Experiments in Sharing Clauses between Runs of a Portfolio of Strategies (Experimental Paper) 25th

Waste Reduction: Experiments in Sharing Clauses between Runs...

引用

25th conference on logic for programming, artificial intelligence and reasoning, lpar 2024

作者： Tammet, Tanel Applied Artificial Intelligence Group Tallinn University of Technology Tallinn Estonia

Most high-end automated theorem provers for first order logic (FOL) split available time between short runs of a large portfolio of search strategies. these runs are typically independent and can be parallelized to exploit all the available processor cores. We explore several avenues of re-using clauses generated by earlier runs and present experimental results of their usefulness or lack thereof. © 2024, EasyChair. All rights reserved.

关键词： automated theorem proving portfolio of strategies reuse saturation based proving

来源：评论

学校读者我要写书评

暂无评论

On Translations of Epsilon Proofs to LK 25th

On Translations of Epsilon Proofs to LK

引用

25th conference on logic for programming, artificial intelligence and reasoning, lpar 2024

作者： Baaz, Matthias Lolićanela@logic.at, Anela Institute of Discrete Mathematics and Geometry TU Wien Vienna Austria Kurt Gödel Society Institute of Logic and Computation TU Wien Vienna Austria

In this paper we present the proof that there is no elementary translation from cut-free derivations in the sequent calculus variant of the epsilon calculus to LK-proofs with bounded cut-complexity. this is a partial answer to a question by Toshiyasu Arai. Furthermore, we show that the intuitionistic format of the sequent calculus variant of the epsilon calculus is not sound for intuitionistic logic, due to the presence of all classical quantifier-shift rules. © 2024, EasyChair. All rights reserved.

关键词： Differentiation (calculus)

来源：评论

学校读者我要写书评

暂无评论

A Simple Token Game and its logic 25th

A Simple Token Game and its Logic

引用

25th conference on logic for programming, artificial intelligence and reasoning, lpar 2024

作者： Fermüller, Chris Freiman, Robert Lang, Timo TU Wien Wien Austria University College London London United Kingdom

We introduce a simple game of resource-conscious reasoning. In this two-player game, players P and O place tokens of positive and negative polarity onto a game board according to certain rules. P wins if she manages to match every negative token with a corresponding positive token. We study this token game using methods from computational complexity and proof theory. Specifically, we show complexity results for various fragments of the game, including PSPACE-completeness of a finite restriction and undecidability of the full game featuring non-terminating plays. Moreover, we show that the finitary version of the game is axiomatisable and can be embedded into exponential-free linear logic. the full game is shown to satisfy the exponential rules of linear logic, but is not fully captured by it. Finally, we show determinacy of the game, that is the existence of a winning strategy for one of the players. © 2024, EasyChair. All rights reserved.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Herbrand’s theorem in Inductive Proofs 25th

Herbrand’s Theorem in Inductive Proofs

引用

25th conference on logic for programming, artificial intelligence and reasoning, lpar 2024

作者： Leitsch, Alexander Lolić, Anela Institute of Logic and Computation TU Wien Vienna Austria Kurt Gödel Society Institute of Logic and Computation TU Wien Vienna Austria

An inductive proof can be represented as a proof schema, i.e. as a parameterized sequence of proofs defined in a primitive recursive way. A corresponding cut-elimination method, called schematic CERES, can be used to analyze these proofs, and to extract their (schematic) Herbrand sequents, even though Herbrand’s theorem in general does not hold for proofs with induction inferences. this work focuses on the most crucial part of the schematic cut-elimination method, which is to construct a refutation of a schematic formula that represents the cut-structure of the original proof schema. Moreover, we show that this new formalism allows the extraction of a structure from the refutation schema, called a Herbrand schema, which represents its Herbrand sequent. © 2024, EasyChair. All rights reserved.

关键词： Differentiation (calculus)

来源：评论

学校读者我要写书评

暂无评论

Predicting Successful programming Submissions Based on Critical logic Blocks 25th

Predicting Successful Programming Submissions Based on Criti...

引用

25th International conference on artificial intelligence in Education (AIED)

作者： Pan, Ka Weng Jeffries, Bryn Koprinska, Irena Univ Sydney Sch Comp Sci Sydney NSW 2006 Australia Grok Acad POB 144 Sydney NSW 2007 Australia

ISBN: (纸本)9783031642982;9783031642999

We propose an approach to infer the critical logic blocks contained within student submissions that can influence the passing or failing of individual exercises in introductory programming courses. Given a programming exercise, we extract critical logic blocks from the abstract syntax trees (ASTs) of its submissions and use a bag-of-words approach to train a decision tree classifier to predict the pass/failure of a submission given the logic blocks present in its AST. We apply this technique to two streams of an introductory Python programming course for high-school students, constructing decision trees for 66 programming exercises based on several thousand submissions for each exercise. We obtain classifiers with F1 scores of 92.4% for the beginners and 88.2% for the intermediate stream. these trained models are highly interpretable and can provide a visualisation of the key logic blocks that are critical in the pass/failure of a problem. We explain how the models can assist educators in understanding the common valid approaches or failed attempts carried out by students when tackling a specific problem, and they may also serve as a guide for suggesting hints to struggling students.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Towards Explainable Weather Forecasting through FastLAS 17th

Towards Explainable Weather Forecasting Through FastLAS

引用

17th International conference on logic programming and Non-monotonic reasoning

作者： Dreossi, Talissa Dovier, Agostino Formisano, Andrea Law, Mark Manzato, Agostino Russo, Alessandra Tait, Matthew Univ Udine Udine Italy ILASP Ltd London England ARPA FVG OSMER Udine Italy Imperial Coll London London England

ISBN: (纸本)9783031742088;9783031742095

Weather forecasting is important for saving lives, protecting property, and supporting economic activities. It provides timely warnings for severe weather, improves agricultural planning, and aids in disaster management. Neural networks and deep learning methods can achieve impressive accuracy in weather prediction, but their black-box nature lacks in explainability. To address this limitation, we investigated the potential of FastLAS, an Inductive logic programming (ILP) framework, to produce reliable and, more important, explainable weather predictions. FastLAS learns ASP programs whose syntax and structural semantics resemble natural human language, making them easily understandable and interpretable by humans. the supportedness of stable models allows a clear explanation of the predictions. Our empirical evaluation on data from an Italian weather forecasting center shows that our approach is capable of learning predictive models from small dataset (a few samples instead of the thousands needed by neural networks) achieving an accuracy higher than statistical machine learning base lines.

关键词： ILP logic programming AI Explainability

来源：评论

学校读者我要写书评

暂无评论

Experiments with Choice in Dependently-Typed Higher-Order logic 25th

Experiments with Choice in Dependently-Typed Higher-Order Lo...

引用

25th conference on logic for programming, artificial intelligence and reasoning, lpar 2024

作者： Ranalter, Daniel Brown, Chad E. Kaliszyk, Cezary University of Innsbruck Innsbruck Austria Czech Technical University in Prague Prague Czech Republic

Recently an extension to higher-order logic — called DHOL — was introduced, enriching the language with dependent types, and creating a powerful extensional type theory. In this paper we propose two ways how choice can be added to DHOL. We extend the DHOL term structure by Hilbert’s indefinite choice operator ϵ, define a translation of the choice terms to HOL choice that extends the existing translation from DHOL to HOL and show that the extension of the translation is complete and give an argument for soundness. We finally evaluate the extended translation on a set of dependent HOL problems that require choice. © 2024, EasyChair. All rights reserved.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

reasoning About Group Polarization: From Semantic Games to Sequent Systems 25th

Reasoning About Group Polarization: From Semantic Games to S...

引用

25th conference on logic for programming, artificial intelligence and reasoning, lpar 2024

作者： Freiman, Robert Olarte, Carlos Pimentel, Elaine Fermüller, Christian G. TU-Wien Austria LIPN CNRS UMR 7030 Université Sorbonne Paris Nord France Computer Science Department UCL United Kingdom

Group polarization, the phenomenon where individuals become more extreme after interacting, has been gaining attention, especially with the rise of social media shaping peo-ple’s opinions. Recent interest has emerged in formal reasoning about group polarization using logical systems. In this work we consider the modal logic PNL that captures the notion of agents agreeing or disagreeing on a given topic. Our contribution involves enhancing PNL with advanced formal reasoning techniques, instead of relying on axiomatic systems for analyzing group polarization. To achieve this, we introduce a semantic game tailored for (hybrid) extensions of PNL. this game fosters dynamic reasoning about concrete network models, aligning with our goal of strengthening PNL’s effectiveness in studying group polarization. We show how this semantic game leads to a provability game by systemically exploring the truth in all models. this leads to the first cut-free sequent systems for some variants of PNL. Using polarization of formulas, the proposed calculi can be modularly adapted to consider different frame properties of the underlying model. © 2024, EasyChair. All rights reserved.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Datalog∃ over Arbitrary t-Norms 25th

Fuzzy Datalog∃ over Arbitrary t-Norms

引用

25th conference on logic for programming, artificial intelligence and reasoning, lpar 2024

作者： Lanzinger, Matthias Sferrazza, Stefano Walęga, Przemyslaw A. Gottlob, Georg University of Oxford United Kingdom University of Calabria Italy TU Wien Austria

One of the main challenges in the area of Neuro-Symbolic AI is to perform logical reasoning in the presence of both neural and symbolic data. this requires combining heterogeneous data sources such as knowledge graphs, neural model predictions, structured databases, crowd-sourced data, and many more. To allow for such reasoning, we generalise the standard rule-based language Datalog with existential rules (commonly referred to as tuple-generating dependencies) to the fuzzy setting, by allowing for arbitrary t-norms in the place of classical conjunctions in rule bodies. the resulting formalism allows us to perform reasoning about data associated with degrees of uncertainty while preserving computational complexity results and the applicability of reasoning techniques established for the standard Datalog setting. In particular, we provide fuzzy extensions of Datalog chases which produce fuzzy universal models and we exploit them to show that in important fragments of the language, reasoning has the same complexity as in the classical setting. © 2024, EasyChair. All rights reserved.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：