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

3rd Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010 - Collocated with the International Conference on logic programming, ICLP 2010

作者： Moinard, Yves INRIA Bretagne Atlantique IRISA Campus de Beaulieu Rennes Cedex35042 France

We examine the practicality for a user of using Answer Set programming (ASP) for representing logical formalisms. We choose as an example a formalism aiming at capturing causal explanations from causal information. We provide an implementation, showing the naturalness and relative efficiency of this translation job. We are interested in the ease for writing an ASP program, in accordance with the claimed "declarative" aspect of ASP. Limitations of the earlier systems (poor data structure and difficulty in reusing pieces of programs) made that in practice, the "declarative aspect" was more theoretical than practical. We show how recent improvements in working ASP systems facilitate a lot the translation, even if a few improvements could still be useful. © 2020 Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Dealing with biology systems in the framework of answer set programming 24

Dealing with biology systems in the framework of answer set ...

引用

24th KES International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2020

作者： Khaled, Tarek Benhamou, Belaid Aix Marseille University University of Toulon CNRS LIS Marseille France

Reasoning about gene networks is essential from various perspectives, such as predicting side effects of drugs or explaining unusual cellular behavior. Because of the massive size of these gene networks, a biologist can only work on a small part of the network. Thus, there is an essential requirement for logical representations and automated reasoning on such networks to help biologists to understand genetic interactions. However, the knowledge about gene networks is always incomplete and sometimes not accurate. Hence, knowledge has to be continuously revised and extended. In this work, we propose an approach based on non-monotonic logic programming, and the framework of Answer Set programming(ASP), to represent and handle gene networks. We show how to model reasoning, predict events, and explain observations in gene networks. Finally, we show how our approach is applied to represent and resolve the DNA double-strand breaks, which is one of the most severe genomic lesions. © 2020 The Authors. Published by Elsevier B.V.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

MyUBot: Towards an artificial intelligence agent system chat-bot for well-being and mental health 1

MyUBot: Towards an artificial intelligence agent system chat...

引用

1st International AAI4H - Advances in Artificial Intelligence for Healthcare Workshop, AAI4H 2020

作者： Osorio, Mauricio J. Zepeda, Claudia Carballido, Jose Luis UDLAP Mexico FCC-BUAP Mexico

We propose the design of an architectural framework for a reasoning logic-based intelligent agent system chatbot for dialogue composition named MyUBot. This framework is applied in the well-being mental health domain for the well-being development of first-year university students. A particular aspect of our framework's capabilities is the handling of poetry and silence mild therapies. A machine language code defined in this work is used to describe and interpret micro-scripts that are used as atomic pieces for dialogue composition for the intelligent agent system chatbot. The use of logic programming to provide reasoning skills to MyUBot is proposed within the architectural framework. logic programming theories, as a tool of knowledge representation are used to reason, plan and optimally solve the Dialogue-Session Composition Problem. Copyright © 2020 for this paper by its authors.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

An Introduction to Answer Set programming and Some of Its Extensions 4th

An Introduction to Answer Set Programming and Some of Its Ex...

引用

4th International Joint Conference on Rules and Reasoning, RuleML+RR 2020, DecisionCAMP 2020, and the 16th Reasoning Web Summer School, RW 2020, was part of the Declarative AI 2020

作者： Faber, Wolfgang University of Klagenfurt 9020 Klagenfurt am Wörthersee Austria

ISBN: (纸本)9783030600662

Answer Set programming (ASP) is a rule-based language rooted in traditional logic programming, Databases, Knowledge Representation, and Nonmonotonic Reasoning. It offers a flexible language for declarative problem solving, with support of efficient general-purpose solvers and reasoners. The larger part of this article provides an introduction to ASP, with a historical perspective, a definition of the core language, a guideline to knowledge representation, and an overview of existing ASP solvers. One part focuses on one commonly used feature: aggregates and generalized atoms. The inclusion of aggregates in ASP (and logic programming at large) has long been motivated, however there are some issues with semantics to be addressed, in particular when aggregates occur in recursive definitions. Very similar considerations are needed when coupling ASP with other formalisms, which we collectively refer to as "generalized atoms". An overview of these semantic challenges and proposals for addressing them is provided, along with an overview of complexity results and system support. © 2020, Springer Nature Switzerland AG.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Modern Interpreter of Predicate Linear logic Formulas 15

A Modern Interpreter of Predicate Linear Logic Formulas

引用

15th IEEE International Scientific and Technical Conference on Computer Sciences and Information Technologies, CSIT 2020

作者： Bilanová, Zuzana Perháč, Ján Hulič, Michal Technical University of Košice Department of Computers and Informatics Košice Slovakia

ISBN: (纸本)9781728174433

This paper describes the design, implementation and possibilities of using a new interpreter of resource-oriented logical formulas. Predicate linear logic is an apparatus that captures the dynamics of a changing world uniquely -resources are consumed after their use. Although this logic system is quite well researched in the world due to its unique features, its most widespread computer implementations are woefully outdated and unsuitable for current research needs. The interpreter described in this article was created after a detailed study of the principles of predicate linear logic as well as existing interpreters of this logic. The new interpreter will be used not only in teaching the subject logic for Informatics at the Technical University in Košice, but we also plan to expand its possibilities and build on the ongoing (so far only) theoretical research at our university. © 2020 IEEE.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Improving DPLL solver performance with domain-specific heuristics: The ASP case 3

Improving DPLL solver performance with domain-specific heuri...

引用

3rd Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010 - Collocated with the International Conference on logic programming, ICLP 2010

作者： Balduccini, Marcello Intelligent Systems KRL Eastman Kodak Company RochesterNY14650-2102 United States

In spite of the recent improvements in the performance of the solvers based on the DPLL procedure, it is still possible for the search algorithm to focus on the wrong areas of the search space, preventing the solver from returning a solution in an acceptable amount of time. This prospect is a real concern e.g. in an industrial setting, where users typically expect consistent performance. To overcome this problem, we propose a framework that allows learning and using domain-specific heuristics in solvers based on the DPLL procedure. The learning is done off-line, on representative instances from the target domain, and the learned heuristics are then used for choice-point selection. In this paper we focus on Answer Set programming (ASP) solvers. In our experiments, the introduction of domain-specific heuristics improved performance on hard instances by up to 3 orders of magnitude (and 2 on average), nearly completely eliminating the cases in which the solver had to be terminated because the wait for an answer had become unacceptable. © 2020 Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Synthesis and Simulation of Ensembles of Boolean Networks for Cell Fate Decision 18th

Synthesis and Simulation of Ensembles of Boolean Networks fo...

引用

18th International Conference on Computational Methods in Systems Biology, CMSB 2020

作者： Chevalier, Stéphanie Noël, Vincent Calzone, Laurence Zinovyev, Andrei Paulevé, Loïc LRI CNRS UMR8623 Univ. Paris-Saclay Orsay France Institut Curie INSERM U. PSL Mines ParisTech Paris France Lobachevsky University Nizhny Novgorod603000 Russia Univ. Bordeaux Bordeaux INP CNRS LaBRI UMR5800 Talence33400 France

ISBN: (纸本)9783030603267

The construction of models of biological networks from prior knowledge and experimental data often leads to a multitude of candidate models. Devising a single model from them can require arbitrary choices, which may lead to strong biases in subsequent predictions. We introduce here a methodology for a) synthesizing Boolean model ensembles satisfying a set of biologically relevant constraints and b) reasoning on the dynamics of the ensembles of models. The synthesis is performed using Answer-Set programming, extending prior work to account for solution diversity and universal constraints on reachable fixed points, enabling an accurate specification of desired dynamics. The sampled models are then simulated and the results are aggregated through averaging or can be analyzed as a multi-dimensional distribution. We illustrate our approach on a previously published Boolean model of a molecular network regulating the cell fate decisions in cancer progression. It appears that the ensemble-based approach to Boolean modelling brings new insights on the variability of synergistic interacting mutations effect concerning propensity of a cancer cell to metastasize. © 2020, Springer Nature Switzerland AG.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Data validation for answer set programming (extended abstract) 36

Data validation for answer set programming (extended abstrac...

引用

36th International Conference on logic programming, ICLP 2020

作者： Alviano, Mario Dodaro, Carmine University of Calabria Italy

Data validation may save the day of computer programmers, whatever programming language they use. Answer Set programming is not an exception, but the quest for better and better performance resulted in systems that eßentially do not validate data in any way. VALASP is a tool to inject data validation in ordinary programs, so to promote fail-fast techniques at coding time without imposing any lag on the deployed system if data are pretended to be valid. © 2020 Open Publishing Association. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Solving constrained horn clauses over ADTs by finite model finding

arXiv

引用

arXiv 2021年

作者： Kostyukov, Yurii Mordvinov, Dmitry Fedyukovich, Grigory Saint Petersburg State University Russia Florida State University Tallahassee United States

First-order logic is a natural way of expressing the properties of computation, traditionally used in various program logics for expressing the correctness properties and certificates. Subsequently, modern methods in the automated inference of program invariants progress towards the construction of first-order definable invariants. Although the first-order representations are very expressive for some theories, they fail to express many interesting properties of algebraic data types (ADTs). Thus we propose to represent program invariants regularly with tree automata. We show how to automatically infer such regular invariants of ADT-manipulating programs using finite model finders. We have implemented our approach and evaluated it against the state-of-art engines for the invariant inference in first-order logic for ADT-manipulating programs. Our evaluation shows that automata-based representation of invariants is more practical than the one based on first-order logic since invariants are capable of expressing more complex properties of the computation and their automatic construction is less expensive. Copyright © 2021, The Authors. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Leveraging Metaphors in a VR Serious Game for Computational Thinking

arXiv

引用

arXiv 2025年

作者： Rodríguez, I. Puig, A. Departament de Matemàtiques i Informàtica UBICS Research Institute Universitat de Barcelona Barcelona Spain Departament de Matemàtiques i Informàtica IMUB Research Institute Universitat de Barcelona Barcelona Spain

This paper presents Cooking Code, a VR-based serious game designed to introduce programming concepts to students (ages 12-16) through an immersive, scenario-driven experience. Set in a futuristic world where humans and machines coexist, players take on the role of a fast-food chef who must assemble food orders based on pseudocode instructions. By interpreting and executing these instructions correctly, players develop problem-solving skills, computational thinking, and a foundational understanding of programming logic. The game leverages the kitchen metaphor to teach computational thinking, using affordances for an immersive VR experience. © 2025, CC BY-SA.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：