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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

语言

26 篇 英文
4 篇 其他
2 篇 中文

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

共 31 条记录，以下是11-20 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

XAI-LAW Towards a logic programming tool for taking and explaining legal decisions 39

XAI-LAW Towards a logic programming tool for taking and expl...

引用

39th Italian conference on Computational logic, CILC 2024

作者： Dovier, Agostino Dreossi, Talissa Formisano, Andrea Dip. di Scienze Matematiche Informatiche e Fisiche Università degli Studi di Udine Udine33100 Italy GNCS-INdAM Gruppo Nazionale per il Calcolo Scientifico Italy

In this paper we present an overview of a research project aiming at producing a semi-automated tool for legal reasoning in the Italian criminal system during the criminal trial stage. Parts of the Italian Criminal Law are modeled in ASP;the model obtained is tested on a set of previous statements on the crimes, and, if needed, refined. Decisions on a new case can be suggested by the system and explained using a tool that exploits "supportedness" of stable models. In the same way, the decision of a judge can be input in the system and automatically explained. Using a system of inductive logic programming for ASP, the tool can evolve by analyzing new statements and performing model revision, by learning exceptions, and by applying rule generalization. To study feasibility of the approach we analyzed the crimes of theft, robbery, and personal injuries. Further crimes will be considered in the future development of the project. © 2024 Copyright for this paper by its authors.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

25th International conference on Principles and Practice of Multi-Agent Systems, PRIMA 2024

25th International Conference on Principles and Practice of ...

引用

25th International conference on Principles and Practice of Multi-Agent Systems, PRIMA 2024

ISBN: (纸本)9783031773662

the proceedings contain 33 papers. the special focus in this conference is on Principles and Practice of Multi-Agent Systems. the topics include: Bargaining through Amalgamation;cascading Power Reduction in Wi-Fi Networks: A Cooperative Approach to Enhance Performance and Efficiency;modelling the Dynamics of Identity and Fairness in Allocation Games;path Finding with Flexible Provisional Booking in Multi-agent Pickup and Delivery Problems;h-Efp: Bridging Efficiency in Multi-agent Epistemic Planning with Heuristics;SPPP: Stochastic Penalty Path Planning for MAPF Under Conditions of Uncertain Travel Time;A Multi-agent Market Model Can Explain the Impact of AI Traders in Financial Markets–A New Microfoundations of GARCH Model;Modelling Congestion and Price Competition in EV Charging Markets;what is the Price for Lending in Financial Networks?;equilibria of Carbon Allowance Auctions: Emissions and Productivity;an Action Language-Based Formalisation of an Abstract Argumentation Framework;belief Reconfiguration Without Oracle;a Proof Calculus for Ethical reasoning;Resource Action-Based Bounded ATL: A New logic for MAS to Express a Cost Over the Actions;judgment Aggregation with Unknown Variable Reliability;theory and Practice of Quantitative ATL;Added Value of Probabilistic Model Checking of vGOAL for Autonomous Systems;improving Reinforcement Learning-Based Autonomous Agents with Causal Models;incentive-Driven Multi-agent Reinforcement Learning Approach for Commons Dilemmas in Land-Use;robust Individualistic Learning in Many-Agent Systems;discarding Erroneous Knowledge Online in Transfer Reinforcement Learning;efficient Preference Elicitation in Iterative Combinatorial Auctions with Many Participants;safe Multi-agent Reinforcement Learning for Drone Routing Problems;explainability and Interpretability of an Ensemble Multi-agent System for Supervised Learning;vickreyFeedback: Cost-Efficient Data Construction for Reinforcement Learning from Human Feedback;an Agent-Based Mo

关键词：

来源：评论

学校读者我要写书评

暂无评论

22nd International conference on Scientific Computing and Bioinformatics, CSC 2024, and 25th International conference on Computational Biology, BIOCOMP 2024, held as part of the World Congress in Computer Science, Computer Engineering and Applied Computing, CSCE 2024

22nd International Conference on Scientific Computing and Bi...

引用

22nd International conference on Scientific Computing and Bioinformatics, CSC 2024, and 25th International conference on Computational Biology, BIOCOMP 2024, held as part of the World Congress in Computer Science, Computer Engineering and Applied Computing, CSCE 2024

ISBN: (纸本)9783031859014

the proceedings contain 31 papers. the special focus in this conference is on Scientific Computing and Bioinformatics,. the topics include: Austere Runway Simulated Identification;using Rhai to Create and Benchmark Bevy Entities;pyO3: Building Python Extension Modules in Native Rust with Performance and Safety in Mind;Leveraging Python Interpreters for Concurrency in SeQUeNCe;benchmark Performance of a Rust-Based Python Extension;quantum Error Correction in Repetition Codes;investigating Selective Reliability with the Laminar Networking Package;an Entanglement Swapping throughput Analysis for Quantum Networks Using Linear Quantum Optics;notes on Symmetric Generalized Tent Map: Route to Chaos;scalable Service Model and Scheduler for Delay-Sensitive Services;regret-Minimization Heuristics for Identifying Monotone Boolean Functions;multi-class Classification of Satellite Orbits for Database Quality Control;real-Time Motion Planning for Autonomous Vehicles in Dynamic Environments;A Novel Deep Learning Method for Solving PDE’s Applied to a Shallow Water Problem;exploring the Impact of Social Media on Mental Health and Well-Being: A Multi-dimensional Analysis;the Strategic Optimization of a Tabletop Role-Playing Game;Problem-Solving Using logic and reasoning, Mathematics, Algorithms, Python, and Generative AI: Part Two;acquisition and Analysis of Mobile Data Using Digital Forensics Tools and Techniques;structural Health Monitoring for Risk Assessment and Reliability of a Structure After Extreme Loads;scientific Constructing Adequate Statistical Decision Rules Under Parametric Uncertainty of Applied Mathematical Models via the Smart Use of Pivotal Quantities and Ancillary Statistics;a Smart Air Quality Analysis and Pollutant Diffusion Detection and Prediction System Based on Tree Canopy Shape Research Using Machine Learning and artificial intelligence;a High Order Scheme for Modelling Viscous Incompressible Fluid Flow in a Channel with a Step;Feasibility Study of Neutron M

关键词：

来源：评论

学校读者我要写书评

暂无评论

Constructing Markov logic Networks from First-Order Default Rules 1

引用

25th International conference on Inductive logic programming (ILP)

作者： Kuzelka, Ondrej Davis, Jesse Schockaert, Steven Cardiff Univ Sch Comp Sci & Informat Cardiff S Glam Wales Katholieke Univ Leuven Dept Comp Sci Leuven Belgium

ISBN: (数字)9783319405667

ISBN: (纸本)9783319405667;9783319405650

Expert knowledge can often be represented using default rules of the form "if A then typically B". In a probabilistic framework, such default rules can be seen as constraints on what should be derivable by MAP-inference. We exploit this idea for constructing a Markov logic network M from a set of first-order default rules D, such that MAP inference from M exactly corresponds to default reasoning from D, where we view first-order default rules as templates for the construction of propositional default rules. In particular, to construct appropriate Markov logic networks, we lift three standard methods for default reasoning. the resulting Markov logic networks could then be refined based on available training data. Our method thus offers a convenient way of using expert knowledge for constraining or guiding the process of learning Markov logic networks.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Approximate probabilistic inference with bounded error for hybrid probabilistic logic programming 25

Approximate probabilistic inference with bounded error for h...

引用

25th International Joint conference on artificial intelligence, IJCAI 2016

作者： Michels, Steffen Hommersom, Arjen Lucas, Peter J. F. Institute for Computing and Information Sciences Radboud University Netherlands Faculty of Management Science and Technology Open University of the Netherlands Netherlands LIACS Leiden University Netherlands

Probabilistic logics, especially those based on logic programming (LP), are gaining popularity as modelling and reasoning tools, since they combine the power of logic to represent knowledge with the ability of probability theory to deal with uncertainty. In this paper, we propose a hybrid extension for probabilistic logic programming, which allows for exact inference for a much wider class of continuous distributions than existing extensions. At the same time, our extension allows one to compute approximations with bounded and arbitrarily small error. We propose a novel anytime algorithm exploiting the logical and continuous structure of distributions and experimentally show that our algorithm is, for typical relational problems, competitive with state-of-the-art sampling algorithms and outperforms them by far if rare events with deterministic structure are provided as evidence, despite the fact that it provides much stronger guarantees.

关键词： Probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

25th International conference on Automated Deduction CADE 2015

25th International Conference on Automated Deduction CADE 20...

引用

25th International conference on Automated Deduction CADE 2015

the proceedings contain 42 papers. the special focus in this conference is on Automated Deduction. the topics include: History and prospects for first-order automated deduction;stumbling around in the dark: lessons from everyday mathematics;automated reasoning in the wild;confluence competition 2015;term rewriting with prefix context constraints and bottom-up strategies;encoding dependency pair techniques and control strategies for maximal completion;reducing relative termination to dependency pair problems;decidability of univariate real algebra with predicates for rational and integer powers;a formalisation of finite automata using hereditarily finite sets;inductive beluga: programming proofs;quantifier-free equational logic and prime implicate generation;quantomatic: a proof assistant for diagrammatic reasoning;cooperating proof attempts;towards the compression of first-order resolution proofs by lowering unit clauses;a polite non-disjoint combination method: theories with bridging functions revisited;exploring theories with a model-finding assistant;abstract interpretation as automated deduction;a uniform substitution calculus for differential dynamic logic;program synthesis using dual interpretation;automated theorem proving for assertions in separation logic with all connectives;tableaux methods for propositional dynamic logics with separating parallel composition;regular patterns in second-order unification;theorem proving with bounded rigid e-unification and linear integer arithmetic revisited.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Parallel Bottom-Up Resolution Algorithm Using Cilk

A Parallel Bottom-Up Resolution Algorithm Using Cilk

引用

25th IEEE International conference on Tools with artificial intelligence (ICTAI)

作者： Basseda, Reza Chowdhury, Rezaul Alam SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

ISBN: (纸本)9781479929719

Rapid developments of multicore processors in the last ten years have accelerated the advancements in concurrency platforms. Performance of bottom-up resolution algorithms used in logic programming and artificial intelligent systems, can potentially be improved using the parallel programming constructs offered by these platforms (e.g., OpenMP, Cilk++, etc.). In this work we use cilk++ to implement a parallel bottom-up resolution algorithm, and study how different parallel programming constructs affect its performance. Our experimental results show that a careful cilk++ implementation of the algorithm can lead to significant speedup w.r.t. its traditional serial implementation.

关键词： Parallel logic programming Parallel Resolution Algorithm Bottom-up reasoning

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Confidentiality-preserving publishing of EDPs for credulous and skeptical users 1

引用

19th International conference on Applications of Declarative programming and Knowledge Management, INAP 2011 and 25th Workshop on logic programming, WLP 2011

作者： Inoue, Katsumi Sakama, Chiaki Wiese, Lena National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-kuTokyo101-8430 Japan Department of Computer and Communication Sciences Wakayama University 930 Sakaedani Wakayama640-8510 Japan Institute of Computer Science Georg-August-Universität Göttingen Goldschmidtstr. 7 Göttingen37077 Germany

ISBN: (数字)9783642415241

ISBN: (纸本)9783642415234

Publishing private data on external servers incurs the problem of how to avoid unwanted disclosure of confidential data. We study the problem of confidentiality-preservation when publishing extended disjunctive logic programs and show how it can be solved by extended abduction. In particular, we analyze how the differences between users who employ either credulous or skeptical non-monotonic reasoning affect confidentiality. © Springer-Verlag Berlin Heidelberg 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：