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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,425 篇 会议
69 册 图书
55 篇 期刊文献

馆藏范围

1,548 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

1,260 篇 工学
- 1,245 篇 计算机科学与技术...
- 663 篇 软件工程
- 83 篇 控制科学与工程
- 62 篇 电气工程
- 48 篇 信息与通信工程
- 10 篇 生物工程
- 9 篇 生物医学工程（可授...
- 6 篇 交通运输工程
- 5 篇 化学工程与技术
- 4 篇 材料科学与工程（可...
- 4 篇 电子科学与技术（可...
- 4 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 建筑学
360 篇 理学
- 337 篇 数学
- 23 篇 统计学（可授理学、...
- 17 篇 系统科学
- 14 篇 生物学
- 10 篇 物理学
- 5 篇 化学
86 篇 管理学
- 53 篇 图书情报与档案管...
- 37 篇 管理科学与工程(可...
- 17 篇 工商管理
10 篇 法学
- 7 篇 法学
- 3 篇 社会学
9 篇 医学
- 9 篇 临床医学
- 7 篇 基础医学(可授医学...
- 6 篇 药学(可授医学、理...
7 篇 教育学
- 7 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学

主题

387 篇 logic programmin...
141 篇 artificial intel...
63 篇 semantics
52 篇 answer set progr...
48 篇 mathematical log...
43 篇 computer circuit...
42 篇 formal logic
40 篇 knowledge repres...
34 篇 logics and meani...
28 篇 programming tech...
25 篇 knowledge repres...
25 篇 calculations
21 篇 programming lang...
18 篇 software enginee...
16 篇 fuzzy logic
15 篇 inductive logic ...
13 篇 constraint progr...
12 篇 programming
12 篇 data description
12 篇 temporal logic

机构

15 篇 vienna univ tech...
13 篇 univ minho ctr a...
11 篇 univ potsdam pot...
10 篇 tu wien austria
8 篇 univ evora escol...
8 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 university of po...
6 篇 imperial coll lo...
6 篇 univ kentucky de...
6 篇 univ minho dept ...
5 篇 univ potsdam ins...
5 篇 katholieke univ ...
5 篇 univ genoa dibri...
5 篇 natl inst inform...
5 篇 natl univ irelan...
5 篇 suny stony brook...
5 篇 mediclin arabian...
5 篇 carnegie mellon ...

作者

31 篇 schaub torsten
30 篇 ricca francesco
24 篇 eiter thomas
20 篇 vicente henrique
19 篇 gebser martin
18 篇 neves jose
17 篇 alviano mario
17 篇 tompits hans
16 篇 leone nicola
16 篇 woltran stefan
13 篇 faber wolfgang
13 篇 cabalar pedro
13 篇 dodaro carmine
12 篇 son tran cao
12 篇 baral chitta
11 篇 voronkov andrei
11 篇 maratea marco
11 篇 inoue katsumi
10 篇 fink michael
10 篇 neves joao

语言

1,537 篇 英文
8 篇 中文
4 篇 其他

检索条件"任意字段=15th International Conference on Logic for Programming Artificial Intelligence and Reasoning"

共 1549 条记录，以下是71-80 订阅

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

详细简洁

排序：

QMaxSATpb: A Certified MaxSAT Solver 16th

QMaxSATpb: A Certified MaxSAT Solver

引用

16th international conference on logic programming and Non-Monotonic reasoning (LPNMR)

作者： Vandesande, Dieter De Wulf, Wolf Bogaerts, Bart Vrije Univ Brussel Artificial Intelligence Lab Pl Laan 9 B-1050 Brussels Belgium

ISBN: (纸本)9783031157073;9783031157066

While certification has been successful in the context of satisfiablity solving, with most state-of-the-art solvers now able to provide proofs of unsatisfiability, in maximum satisfiability, such techniques are not yet widespread. In this paper, we present QMaxSATpb, an extension of QMaxSAT that can produce proofs of optimality in the VeriPB proof format, which itself builds on the well-known cutting planes proof system. Our experiments demonstrate that proof logging is possible without much overhead.

关键词： Boolean satisfiability maximum satisfiability optimization certification proofs

来源：评论

学校读者我要写书评

暂无评论

VizAR: Visualization of Automated reasoning Proofs (System Description) 16th

VizAR: Visualization of Automated Reasoning Proofs (System D...

引用

16th international conference on Intelligent Computer Mathematics (CICM)

作者： Jakubuv, Jan Kaliszyk, Cezary Czech Tech Univ Prague Czech Republic Univ Innsbruck Innsbruck Austria INDRC Prague Czech Republic

ISBN: (纸本)9783031427527;9783031427534

We present a system for the visualization of proofs originating from Automated theorem Provers for first-order logic. the system can hide uninteresting proof parts of proofs, such as type annotations, translate first-order terms to standard math syntax, and compactly display complex formulas. We demonstrate the system on several non-trivial automated proofs of statements from Mizar Mathematical Library translated to first-order logic, and we provide a web interface where curious users can browse and investigate the proofs.

关键词： Proof Visualization First-Order logic Automated theorem Provers

来源：评论

学校读者我要写书评

暂无评论

SHACL: A Description logic in Disguise 16th

SHACL: A Description Logic in Disguise

引用

16th international conference on logic programming and Non-Monotonic reasoning (LPNMR)

作者： Bogaerts, Bart Jakubowski, Maxime Van den Bussche, Jan Vrije Univ Brussel Brussels Belgium Univ Hasselt Hasselt Belgium

ISBN: (纸本)9783031157073;9783031157066

SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs. In recent years, SHACL's popularity has risen quickly. this rise in popularity comes with questions related to its place in the semantic web, particularly about its relation to OWL (the de facto standard for expressing ontological information on the web) and description logics (which form the formal foundations of OWL). We answer these questions by arguing that SHACL is in fact a description logic. On the one hand, our answer is surprisingly simple, some might even say obvious. But, on the other hand, our answer is also controversial. By resolving this issue once and for all, we establish the field of description logics as the solid formal foundations of SHACL.

关键词： Shapes SHACL Description logics Ontologies

来源：评论

学校读者我要写书评

暂无评论

A Qualitative Temporal Extension of Here-and-there logic 16th

A Qualitative Temporal Extension of Here-and-There Logic

引用

16th international conference on logic programming and Non-Monotonic reasoning (LPNMR)

作者： Eiter, thomas Schneider, Patrik TU Wien Inst Log & Computat Vienna Austria Siemens AG Munich Germany

ISBN: (纸本)9783031157073;9783031157066

Model-based Diagnosis (MBD) is an approach to diagnosis, where an (objective) model of a system is diagnosed to find a set of explanations revealing root causes for issues. Temporal behavioral models are prominent approach for temporal MBD, where their associated temporal formulas (TBFs) by Brusoni et al. (artificial intelligence, 102:39-79, 1998) can be used to relate explanations to observations under temporal constraints based on Allen's Interval Algebra (IA). Due to expressive limitations of the constructs, we envision an extended language of TBFs that allows for complex formulas and nesting of formulas in temporal constraints. To this end, we present a language that extends propositional resp. FO logic with IA relations and provide semantics for it based on here-and-there (HT) logic as well as on Equilibrium logic. Furthermore, we lift a well-known tableau calculus for propositional HT logic to the temporal setting and report about an experimental prototype implementation. Based on these results, rich notions of diagnostic explanations from temporal behavior models may be developed.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

On the Independencies Hidden in the Structure of a Probabilistic logic Program 39

On the Independencies Hidden in the Structure of a Probabili...

引用

39th international conference on logic programming (ICLP)

作者： Rueckschloss, Kilian Weitkaemper, Felix Ludwig Maximilians Univ Munchen Oettingenstr 67 D-80538 Munich Germany

Pearl and Verma developed d-separation as a widely used graphical criterion to reason about the conditional independencies that are implied by the causal structure of a Bayesian network. As acyclic ground probabilistic logic programs correspond to Bayesian networks on their dependency graph, we can compute conditional independencies from d-separation in the latter. In the present paper, we generalize the reasoning above to the non-ground case. First, we abstract the notion of a probabilistic logic program away from external databases and probabilities to obtain so-called program structures. We then present a correct meta-interpreter that decides whether a certain conditional independence statement is implied by a program structure on a given external database. Finally, we give a fragment of program structures for which we obtain a completeness statement of our conditional independence oracle. We close with an experimental evaluation of our approach revealing that our meta-interpreter performs significantly faster than checking the definition of independence using exact inference in ProbLog 2.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

15th international Symposium on NASA Formal Methods, NFM 2023

15th International Symposium on NASA Formal Methods, NFM 202...

引用

15th international Symposium on NASA Formal Methods, NFM 2023

ISBN: (纸本)9783031331695

the proceedings contain 29 papers. the special focus in this conference is on NASA Formal Methods. the topics include: reasoning with Metric Temporal logic and Resettable Skewed Clocks;centralized Multi-agent Synthesis with Spatial Constraints via Mixed-Integer Quadratic programming;a Framework for Policy Based Negotiation;rewrite-Based Decomposition of Signal Temporal logic Specifications;Quantitative Verification and Strategy Synthesis for BDI Agents;Multi-objective Task Assignment and Multiagent Planning with Hybrid GPU-CPU Acceleration;reasoning over Test Specifications Using Assume-Guarantee Contracts;from the Standards to Silicon: Formally Proved Memory Controllers;Formalising Liveness Properties in Event-B with the Reflexive EB4EB Framework;open- and Closed-Loop Neural Network Verification Using Polynomial Zonotopes;formalized High Level Synthesis with Applications to Cryptographic Hardware;From Natural Language Requirements to the Verification of Programmable logic Controllers: Integrating FRET into PLCverif;automata-Based Software Model Checking of Hyperproperties;condition Synthesis Realizability via Constrained Horn Clauses;a Toolkit for Automated Testing of Dafny;Verified ALL(*) Parsing with Semantic Actions and Dynamic Input Validation;Subtropical Satisfiability for SMT Solving;a Linear Weight Transfer Rule for Local Search;adiar 1.1: Zero-Suppressed Decision Diagrams in External Memory;satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem;verifying Attention Robustness of Deep Neural Networks Against Semantic Perturbations;formalizing Piecewise Affine Activation Functions of Neural Networks in Coq;verifying an Aircraft Collision Avoidance Neural Network with Marabou;strategy Synthesis in Markov Decision Processes Under Limited Sampling Access;learning Symbolic Timed Models from Concrete Timed Data;reward Shaping from Hybrid Systems Models in Reinforcement Learning;conservative Safety Monitors of Stochastic Dynamical Sys

关键词：

来源：评论

学校读者我要写书评

暂无评论

Metric Temporal Answer Set programming over Timed Traces 16th

Metric Temporal Answer Set Programming over Timed Traces

引用

16th international conference on logic programming and Non-Monotonic reasoning (LPNMR)

作者： Cabalar, Pedro Dieguez, Martin Schaub, Torsten Schuhmann, Anna Univ A Coruna Coruna Spain Univ Angers LERIA Angers France Univ Potsdam Potsdam Germany

ISBN: (纸本)9783031157073;9783031157066

In temporal extensions of Answer Set programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. In many applications, however, timing constraints are important like, for instance, when planning and scheduling go hand in hand. We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers. the resulting Metric Equilibrium logic provides the foundation of an ASP-based approach for specifying qualitative and quantitative dynamic constraints. To this end, we define a translation of metric formulas into monadic first-order formulas and give a correspondence between their models in Metric Equilibrium logic and Monadic Quantified Equilibrium logic, respectively. Interestingly, our translation provides a blue print for implementation in terms of ASP modulo difference constraints.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Epistemic logic Programs: A Study of Some Properties 16th

Epistemic Logic Programs: A Study of Some Properties

引用

16th international conference on logic programming and Non-Monotonic reasoning (LPNMR)

作者： Costantini, Stefania Formisano, Andrea Univ Aquila DISIM Laquila Italy Univ Udine DMIF Udine Italy

ISBN: (纸本)9783031157073;9783031157066

Epistemic logic Programs (ELPs), extend Answer Set programming (ASP) with epistemic operators. the semantics of such programs is provided in terms of world views, which are sets of belief sets. Different semantic approaches propose different characterizations of world views. Recent work has introduced semantic properties that should be met by any semantics for ELPs, like the Epistemic Splitting Property, that, if satisfied, allows to modularly compute world views in a bottom-up fashion, analogously to 'traditional' ASP. We analyze the possibility to change the perspective, shifting from a bottom-up to a top-down approach to splitting. Our new definition: (i) copes with concerns regarding unfoundedness of world views and subjective constraint monotonicity;(ii) is provably applicable to many of the existing semantics;(iii) operates similarly to "traditional" ASP;(iv) provably coincides with the bottom-up notion of splitting at least on the class of Epistemically Stratified Programs (which are, intuitively, those where the use of epistemic operators is stratified).

关键词： Answer Set programming Epistemic logic Programs Epistemic Splitting

来源：评论

学校读者我要写书评

暂无评论

Inference to the Stable Explanations 16th

Inference to the Stable Explanations

引用

16th international conference on logic programming and Non-Monotonic reasoning (LPNMR)

作者： Governatori, Guido Olivieri, Francesco Rotolo, Antonino Cristani, Matteo Griffith Univ Inst Integrated & Intelligent Syst Sch ICT Nathan Qld 4111 Australia Univ Bologna ALMA AI Bologna Italy Univ Verona I-37134 Verona Italy

ISBN: (纸本)9783031157073;9783031157066

the process of explaining a piece of evidence by constructing a set of assumptions that are a good explanation for that evidence is ubiquitous in real-life (e.g. in legal systems). In this paper, we introduce, discuss, and formalise the notion of stable explanations in a non-monotonic setting. We show how, while applying it to the process of (1) computing a set of literals able to (2) derive a conclusion (3) from a set of defeasible rules, we obtain a restricted version of the notion of abduction. this is both interesting and useful: when an explanation for a given conclusion is stable, it can, in fact, be used to infer the same conclusion independently of other pieces of evidence that are found afterwards.

关键词： artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Statistical Statements in Probabilistic logic programming 16th

Statistical Statements in Probabilistic Logic Programming

引用

16th international conference on logic programming and Non-Monotonic reasoning (LPNMR)

作者： Azzolini, Damiano Bellodi, Elena Riguzzi, Fabrizio Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy

ISBN: (纸本)9783031157073;9783031157066

Probabilistic logic Programs under the distribution semantics (PLPDS) do not allow statistical probabilistic statements of the form "90% of birds fly", which were defined "Type 1" statements by Halpern. In this paper, we add this kind of statements to PLPDS and introduce the PASTA ("Probabilistic Answer set programming for STAtistical probabilities") language. We translate programs in our new formalism into probabilistic answer set programs under the credal semantics. this approach differs from previous proposals, such as the one based on "probabilistic conditionals" as, instead of choosing a single model by making the maximum entropy assumption, we take into consideration all models and we assign probability intervals to queries. In this way we refrain from making assumptions and we obtain a more neutral framework. We also propose an inference algorithm and compare it with an existing solver for probabilistic answer set programs on a number of programs of increasing size, showing that our solution is faster and can deal with larger instances.

关键词： Probabilistic logic programming Statistical statements Statistical Relational artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共155页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：