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

15th IADIS international conference Information Systems 2022, IS 2022

作者： Burnashev, Rustam Enikeev, Arslan Enikeeva, Adelya Fakhrtdinova, Ilyuza Institute of Computational Mathematics and Information Technologies Kazan Federal University Russia Kremlyovskaya 35 Kazan Russia

ISBN: (纸本)9789898704375

During the COVID-19 pandemic, humanity faced various health problems. One of the most common diseases is pneumonia. the life of every person depends on the correct and effective diagnosis of the disease. Currently, a large number of software applications with elements of artificial intelligence are being developed, which can reduce the time of patient care, improve the methodology and efficiency of disease diagnosis. With our research, we strive to contribute to the development of such software applications, namely, to develop software tools with elements of fuzzy logic. To develop a decision-making system, scales and algorithms in order to assess we considered the prognosis of the severity of community-acquired pneumonia PORT(PSI), CURB/CRB-65 and SMART-COP/SMART-CO. To improve the quality of processing fuzzy production rules of knowledge base, the logic programming language Prolog was used. the created application is planned to be integrated into medical information systems. © 2022 CURRAN-conference. All rights reserved.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

26th international Symposium on Practical Aspects of Declarative Languages, PADL 2024

26th International Symposium on Practical Aspects of Declara...

引用

26th international Symposium on Practical Aspects of Declarative Languages, PADL 2024

ISBN: (纸本)9783031520372

the proceedings contain 13 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Ontological reasoning over Shy and Warded Datalog+/– for Streaming-Based Architectures;explanation and Knowledge Acquisition in Ad Hoc Teamwork;automated Interactive Domain-Specific Conversational Agents that Understand Human Dialogs;asynchronous Reactive programming with Modal Types in Haskell;FOLD-SE: An Efficient Rule-Based Machine Learning Algorithm with Scalable Explainability;marketplace Logistics via Answer Set programming;rhyme: A Data-Centric Expressive Query Language for Nested Data Structures;rethinking Answer Set programming Templates;cutting the Cake into Crumbs: Verifying Envy-Free Cake-Cutting Protocols Using Bounded Integer Arithmetic;A Direct ASP Encoding for Declare;using logic programming and Kernel-Grouping for Improving Interpretability of Convolutional Neural Networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Signal Embeddings for Complex logical reasoning in Knowledge Graphs 1

引用

15th international conference on Knowledge Science, Engineering, and Management (KSEM)

作者： Wang, Kai Zhang, Chunhong Yu, Jibin Sun, Qi Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Minist Educ Key Lab Univ Wireless Commun Beijing 100876 Peoples R China

ISBN: (数字)9783031109836

ISBN: (纸本)9783031109836;9783031109829

Complex logical reasoning over Knowledge Graph is one of the fundamental tasks of artificial intelligence. Traditional approaches suffer from the incompleteness and noise of knowledge graph, making complex logical reasoning a challenging task. Recent methods propose to embed entities and first-order logic (FOL) queries in low-dimensional vector spaces. However, most of the current models cannot deal with logical negation. In addition, manymethods utilize neural networks tomodel relation projections, which require a large number of parameters and computational expense. In this work, we proposes SignalE that simplifies relation projection operations while being able to handle logical negation. We represent entities and queries by signal embeddings, which can be represented in both time domain and frequency domain interchangeably. the logical negation operation is handled by inverting the amplitude in each dimension of the frequency-domain form of the signal embedding. Furthermore, relational projection operations are simplified into translation between entities. Experiments demonstrate that SignalE significantly outperforms existing state-of-the-art methods on benchmark datasets.

关键词： Complex logical reasoning Query embedding Knowledge graph embedding

来源：评论

学校读者我要写书评

暂无评论

On Syntactic Forgetting with Strong Persistence 19

On Syntactic Forgetting with Strong Persistence

引用

19th international conference on Principles of Knowledge Representation and reasoning, KR 2022

作者： Berthold, Matti Universität Leipzig Germany

ISBN: (纸本)9781956792010

It is generally agreed upon that so-called strong persistence (SP) captures best the essence of forgetting in logic programming. While classes of operators, such as FR and FSP, that satisfy immediate relaxations of (SP), and in the case of FSP, even (SP) whenever possible, have been characterized semantically, many practical questions have yet to be addressed. this technical paper aims to answer one of them: How can atoms be forgotten from a program without having to calculate its exponential number of models? To this end, we introduce two concrete representatives of FR and FSP that forget sets of atoms by syntactical manipulation of a program's rules. this may in many cases prevent exponential blowups and produce a forgetting result that is close to the original program. © 19th international conference on Principles of Knowledge Representation and reasoning, KR 2022. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Algorithms for reasoning in a Default logic Instantiation of Assumption-Based Argumentation 9

Algorithms for Reasoning in a Default Logic Instantiation of...

引用

9th international conference on Computational Models of Argument (COMMA)

作者： Lehtonen, Tuomo Wallner, Johannes P. Jaervisalo, Matti Univ Helsinki Helsinki Finland Graz Univ Technol Graz Austria

ISBN: (纸本)9781643683065;9781643683072

Assumption-based argumentation (ABA) is one of the most-studied formalisms for structured argumentation. While ABA is a general formalism that can be instantiated with various different logics, most attention from the computational perspective has been focused on the logic programming (LP) instantiation of ABA. Going beyond the LP-instantiation, we develop an algorithmic approach to reasoning in the propositional default logic (DL) instantiation of ABA. Our approach is based on iterative applications of Boolean satisfiability (SAT) solvers as a natural choice for implementing derivations as entailment checks in DL. We instantiate the approach for deciding acceptance and for assumption-set enumeration in the DL-instantiation of ABA under several central argumentation semantics, and empirically evaluate an implementation of the approach.

关键词： structured argumentation assumption-based argumentation default logic decision procedures SAT counterexample-guided abstraction refinement

来源：评论

学校读者我要写书评

暂无评论

25th IFIP WG 6.1 international conference on Coordination Models and Language, COORDINATION 2023, held as part of the 18th international Federated conference on Distributed Computing Techniques, DisCoTec 2023

25th IFIP WG 6.1 International Conference on Coordination Mo...

引用

25th IFIP WG 6.1 international conference on Coordination Models and Language, COORDINATION 2023, held as part of the 18th international Federated conference on Distributed Computing Techniques, DisCoTec 2023

ISBN: (纸本)9783031353604

the proceedings contain 15 papers. the special focus in this conference is on Coordination Models and Language. the topics include: JoT: A Jolie Framework for Testing Microservices;rollback Recovery in Session-Based programming;safe Asynchronous Mixed-Choice for Timed Interactions;A Formal MDE Framework for Inter-DSL Collaboration;legal Contracts Amending with;toward Run-time Coordination of Reconfiguration Requests in Cloud Computing Systems;macroSwarm: A Field-Based Compositional Framework for Swarm programming;ScaRLib: A Framework for Cooperative Many Agent Deep Reinforcement Learning in Scala;programming Distributed Collective Processes for Dynamic Ensembles and Collective Tasks;shelley: A Framework for Model Checking Call Ordering on Hierarchical Systems;stark: A Software Tool for the Analysis of Robustness in the unKnown Environment;RSC to the ReSCu: Automated Verification of Systems of Communicating Automata;reasoning About Choreographic Programs;caos: A Reusable Scala Web Animator of Operational Semantics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

15th international conference on logic programming and Nonmonotonic reasoning, LPNMR 2019

15th International Conference on Logic Programming and Nonmo...

引用

15th international conference on logic programming and Nonmonotonic reasoning, LPNMR 2019

ISBN: (纸本)9783030205270

the proceedings contain 25 papers. the special focus in this conference is on logic programming and Nonmonotonic reasoning. the topics include: Founded World Views with Autoepistemic Equilibrium logic;towards Dynamic Answer Set programming over Finite Traces;a Sequent-Type Calculus for three-Valued Default logic, Or: Tweety Meets Quartum Non Datur;diagnosing Data Pipeline Failures Using Action Languages;repair-Based Degrees of Database Inconsistency;elect: An Inconsistency Handling Approach for Partially Preordered Lightweight Ontologies;Elaboration Tolerant Representation of Markov Decision Process via Decision-theoretic Extension of Probabilistic Action Language pBC+;Evaluation of Disjunctive Programs in WASP;telingoÂ =Â ASPÂ +Â Time;Telco Network Inventory Validation with NoHR;verifying Strong Equivalence of Programs in the Input Language of gringo;the Return of xorro;Degrees of Laziness in Grounding: Effects of Lazy-Grounding Strategies on ASP Solving;Enhancing DLV for Large-Scale reasoning;Pruning External Minimality Checking for ASP Using Semantic Dependencies;declarative Local Search for Predicate logic;An ASP-Based Framework for the Manipulation of Articulated Objects Using Dual-Arm Robots;C-ASP: Continuous ASP-Based reasoning over RDF Streams;internet Routing and Non-monotonic reasoning;assessing Arguments with Schemes and Fallacies;simple Contrapositive Assumption-Based Frameworks;Argumentation-Based Explanations for Answer Sets Using ADF;treewidth and Counting Projected Answer Sets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Interactive SMT Tactic in Coq using Abductive reasoning 24th

An Interactive SMT Tactic in Coq using Abductive Reasoning

引用

24th international conference on logic for programming, artificial intelligence and reasoning, LPAR 2023

作者： Barbosa, Haniel Keller, Chantal Reynolds, Andrew Viswanathan, Arjun Tinelli, Cesare Barrett, Clark Universidade Federal de Minas Gerais Brazil Laboratory of Formal Methods Universite Paris-Saclay France University of Iowa United States Stanford University United States

A well-known challenge in leveraging automatic theorem provers, such as satisfiability modulo theories (SMT) solvers, to discharge proof obligations from interactive theorem provers (ITPs) is determining which axioms to send to the solver together with the conjecture to be proven. Too many axioms may confuse or clog the solver, while too few may make a theorem unprovable. When a solver fails to prove a conjecture, it is unclear to the user which case transpired. In this paper we enhance SMTCoq - an integration between the Coq ITP and the cvc5 SMT solver - with a tactic called abduce aimed at mitigating the uncertainty above. When the solver fails to prove the goal, the user may invoke abduce which will use abductive reasoning to provide facts that will allow the solver to prove the goal, if any. © 2023, EasyChair. All rights reserved.

关键词： theorem proving

来源：评论

学校读者我要写书评

暂无评论

Proof Complexity of Modal Resolution

引用

JOURNAL OF AUTOMATED reasoning 2022年第1期66卷 1-41页

作者： Sigley, Sarah Beyersdorff, Olaf Univ Leeds Sch Comp Leeds W Yorkshire England Friedrich Schiller Univ Jena Inst Comp Sci Jena Germany

We investigate the proof complexity of modal resolution systems developed by Nalon and Dixon (J Algorithms 62(3-4):117-134, 2007) and Nalon et al. (in: Automated reasoning with analytic Tableaux and related methods-24th international conference, (TABLEAUX'15), pp 185-200, 2015), which form the basis of modal theorem proving (Nalon et al., in: Proceedings of the twenty-sixth international joint conference on artificial intelligence (IJCAI'17), pp 4919-4923, 2017). We complement these calculi by a new tighter variant and show that proofs can be efficiently translated between all these variants, meaning that the calculi are equivalent from a proof complexity perspective. We then develop the first lower bound technique for modal resolution using Prover-Delayer games, which can be used to establish "genuine" modal lower bounds for size of dag-like modal resolution proofs. We illustrate the technique by devising a new modal pigeonhole principle, which we demonstrate to require exponential-size proofs in modal resolution. Finally, we compare modal resolution to the modal Frege systems of Hrubes (Ann Pure Appl Log 157(2-3):194-205, 2009) and obtain a "genuinely" modal separation.

关键词： Modal logic Resolution Proof complexity Lower bounds Prover-Delayer games Pigeonhole principle

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 15th international conference on Flexible Query Answering Systems, FQAS 2023

Proceedings of the 15th International Conference on Flexible...

引用

Proceedings of the 15th international conference on Flexible Query Answering Systems, FQAS 2023

ISBN: (纸本)9783031429347

the proceedings contain 24 papers. the special focus in this conference is on Flexible Query Answering Systems. the topics include: Data as Wealth, Data Markets and Its Regulation;some Properties of the Left Recursive Form of the Convex Combination Linguistic Aggregator;automatic Generation of Coherent Natural Language Texts;methodology for Analyzing the Risk of Algorithmic Discrimination from a Legal and Technical Point of View;an Unsupervised Approach to Extracting Knowledge from the Relationships Between Blame Attribution on Twitter;a Fuzzy Approach to Detecting Suspected Disinformation in Videos;"Let It BEE": Natural Language Classification of Arthropod Specimens Based on their Spanish Description;interlingual Semantic Validation;diversifying Top-k Answers in a Query by Example Setting;all Trolls Have One Mission: An Entropy Analysis of Political Misinformation Spreaders;on Reducing reasoning and Querying in Natural logic to Database Querying;bot Detection in Twitter: An Overview;a First Evolutionary Fuzzy Approach for Change Mining with Smart Bands;Exploring Hidden Anomalies in UGR’16 Network Dataset with Kitsune;are Textual Recommendations Enough? Guiding Physicians Toward the Design of Machine Learning Pipelines through a Visual Platform;Who Is to Blame? Responsibility Attribution in AI Systems vs Human Agents in the Field of Air Crashes;the Promise of Query Answering Systems in Sexuality Studies: Current State, Challenges and Limitations;knowledge Graph Enabled Open-Domain Conversational Question Answering;how Tasty Is this Dish? Studying User-Recipe Interactions with a Rating Prediction Algorithm and Graph Neural Networks;federated Learning in Healthcare with Unsupervised and Semi-Supervised Methods;an Orthographic Similarity Measure for Graph-Based Text Representations;preface.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：