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

Stepping through an answer-set Program

11th International Conference on Logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Oetsch, Johannes Puehrer, Joerg Tompits, Hans Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria

ISBN: (纸本)9783642208942

We introduce a framework for interactive stepping through an answer-set program as a means for debugging. In procedural languages, stepping is a widespread and effective debugging strategy. The idea is to gain insight into the behaviour of a program by executing statement by statement, following the program's control flow. Stepping has not been considered for answer-set programs so far, presumably because of their lack of a control flow. The framework we provide allows for stepwise constructing interpretations following the user's intuition on which rule instances to become active. That is, we do not impose any ordering on the rules but give the programmer the freedom to guide the stepping process. Due to simple syntactic restrictions, each step results in a state that guarantees stability of the intermediate interpretation. We present how stepping can be started from breakpoints as in conventional programming and discuss how the approach can be used for debugging using a running example.

关键词： answer-set programming program analysis debugging

来源：评论

学校读者我要写书评

暂无评论

Combining Equilibrium Logic and Dynamic Logic

Combining Equilibrium Logic and Dynamic Logic

引用

12th International Conference on Logic programming and Nonmonotonic Reasoning (LPNMR)

作者： del Cerro, Luis Farinas Herzig, Andreas Su, Ezgi Iraz Univ Toulouse CNRS IRIT Toulouse France

ISBN: (纸本)9783642405648

We extend the language of here-and-there logic by two kinds of atomic programs allowing to minimally update the truth value of a propositional variable here or there, if possible. These atomic programs are combined by the usual dynamic logic program connectives. We investigate the mathematical properties of the resulting extension of equilibrium logic: we prove that the problem of logical consequence in equilibrium models is EXPTIME complete by relating equilibrium logic to dynamic logic of propositional assignments.

关键词： answer-set programming here-and-there logic equilibrium logic propositional dynamic logic dynamic logic of propositional assignments

来源：评论

学校读者我要写书评

暂无评论

Preferential Reasoning Based On Abstract Argumentation Semantics 5

Preferential Reasoning Based On Abstract Argumentation Seman...

引用

5th Conference on Computational Models of Argument (COMMA)

作者： Arieli, Ofer Reinstra, Tjitze Acad Coll Tel Aviv Sch Comp Sci Tel Aviv Israel Univ Luxembourg Interdisciplinary Ctr Secur Reliabil & Trust Luxembourg Luxembourg

We introduce a preferential-based setting for reasoning with different types of argumentation-based semantics, including those that are not necessarily conflict-free or admissible. The induced entailments are defined ... 详细信息

ISBN: (纸本)9781614994367;9781614994350

关键词： semantics for abstract argumentation preferential reasoning n-valued labeling answer-set programming

来源：评论

学校读者我要写书评

暂无评论

The system Kato: Detecting cases of plagiarism for answer-set programs

The system Kato: Detecting cases of plagiarism for answer-se...

引用

26th International Conference on Logic programming

作者： Oetsch, Johannes Puehrer, Joerg Schwengerer, Martin Tompits, Hans Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria

Plagiarism detection is a growing need among educational institutions and solutions for different purposes exist. An important field in this direction is detecting cases of source-code plagiarism. In this paper, we present the tool Kato for supporting the detection of this kind of plagiarism in the area of answer-set programming (ASP). Currently, the tool is implemented for DLV programs but it is designed to handle other logic-programming dialects as well. We review the basic features of Kato, introduce its theoretical underpinnings, and discuss an application of Kato for plagiarism detection in the context of courses on logic programming at the Vienna University of Technology.

关键词： answer-set programming program analysis plagiarism detection

来源：评论

学校读者我要写书评

暂无评论

A Modular Neurosymbolic Approach for Visual Graph Question answering 17

A Modular Neurosymbolic Approach for Visual Graph Question A...

引用

17th International Workshop on Neural-Symbolic Learning and Reasoning (NeSy)

作者： Eiter, Thomas Ruiz, Nelson Higuera Oetsch, Johannes Vienna Univ Technol TU Wien Favoritenstr 9-11 A-1040 Vienna Austria

Images containing graph-based structures are a ubiquitous and popular form of data representation that, to the best of our knowledge, have not yet been considered in the domain of Visual Question answering (VQA). We use CLEGR, a graph question answering dataset with a generator that synthetically produces vertex-labelled graphs that are inspired by metro networks. Structured information about stations and lines is provided, and the task is to answer natural language questions concerning such graphs. While symbolic methods suffice to solve this dataset, we consider the more challenging problem of taking images of the graphs instead of their symbolic representations as input. Our solution takes the form of a modular neurosymbolic model that combines the use of optical graph recognition for graph parsing, a pretrained optical character recognition neural network for parsing node labels, and answer-set programming, a popular logic-based approach to declarative problem solving, for reasoning. The implementation of the model achieves an overall average accuracy of 73% on the dataset, providing further evidence of the potential of modular neurosymbolic systems in solving complex VQA tasks, in particular, the use and control of pretrained models in this architecture.

关键词： neurosymbolic computation answer-set programming visual question answering

来源：评论

学校读者我要写书评

暂无评论

Extended semantics and optimization algorithms for CP-networks

Extended semantics and optimization algorithms for CP-networ...

引用

18th National Conference on Artificial Intelligence (AAAI 2002)

作者： Brafman, RI Dimopoulos, Y Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Univ Cyprus Dept Comp Sci Nicosia Cyprus

Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)-nets were designed to make the process of preference elicitation simpler and more intuitive for lay users by graphically structuring a set of CP preference statements-preference statements that most people find natural and intuitive. Beside their usefulness in the process of preference elicitation, CP-nets support efficient optimization algorithms that are crucial in most applications (e. g., the selection of the best action to execute or the best product configuration). In various contexts, CP-nets with an underlying cyclic structure emerge naturally. Often, they are inconsistent according to the current semantics, and the user is required to revise them. In this paper, we show how optimization queries can be meaningfully answered in many "inconsistent" networks without troubling the user with requests for revisions. In addition, we describe a method for focusing the user's revision process when revisions are truly needed. In the process, we provide a formal semantics that justifies our approach and new techniques for computing optimal outcomes. Some of the methods we use are based on a reduction to the problem of computing stable models for nonmonotonic logic programs, and we explore this relationship closely.

关键词： preference elicitation knowledge representation CP-nets answer-set programming nonmonotonic logic programs graphical models

来源：评论

学校读者我要写书评

暂无评论

The refined extension principle for semantics of dynamic logic programming

引用

Studia Logica 2005年第1期79卷 7-32页

作者： Alferes, José Júlio Banti, Federico Brogi, Antonio Leite, João Alexandre CENTRIA Universidade Nova de Lisboa 2829-516 Caparica Portugal Dipartimento di Informatica Universitá di Pisa Pisa Italy

Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the question of which are most adequate to model updates. A systematic approach to face this question is to identify general principles against which such semantics could be evaluated. In this paper we motivate and introduce a new such principle the refined extension principle. Such principle is complied with by the stable model semantics for (single) logic programs. It turns out that none of the existing semantics for logic program updates, even though generalisations of the stable model semantics, comply with this principle. For this reason, we define a refinement of the dynamic stable model semantics for Dynamic Logic Programs that complies with the principle. © Springer 2005.

关键词： answer-set programming Belief Change Dynamic Logic programming Logic programming Non-monotonic Reasoning Stable Model Semantics Updates

来源：评论

学校读者我要写书评

暂无评论

VIDEAS: A Development Tool for answer-set Programs Based on Model-Driven Engineering Technology

引用

11th International Conference on Logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Oetsch, Johannes Puehrer, Joerg Seidl, Martina Tompits, Hans Zwickl, Patrick Vienna Univ Technol Inst Informat Syst 184 3 Favoritenstr 9-11 A-1040 Vienna Austria Johannes Kepler Univ Linz Inst Formale Modelle & Verifikat A-4040 Linz Austria Tech Univ Inst Softwaretech Vienna Austria FTW Forschungszentrum Telekommunikat Wien GmbH A-1220 Vienna Austria

ISBN: (纸本)9783642208942;9783642208959

In the object-oriented world, much effort is spent into the development of dedicated tools to ease programming and to prevent programming errors. Recently, the techniques of model-driven engineering (MDE) have been proven especially valuable to manage the complexity of modern software systems during the software development process. In the world of answer-set programming (ASP), the situation is different. Much effort is invested into the development of efficient solvers, but the pragmatics of programming itself has not received much attention and more tool support to ease the actual programming phase would be desirable. To address this issue, we introduce the tool VIDEAS which graphically supports the partial specification of answer-set programs, applying technologies provided by MDE.

关键词： answer-set programming model-driven engineering ER diagrams

来源：评论

学校读者我要写书评

暂无评论

ArgueApply: A Mobile App for Argumentation 14th

ArgueApply: A Mobile App for Argumentation

引用

14th International Conference on Logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Puehrer, Joerg Univ Leipzig Inst Comp Sci Leipzig Germany

ISBN: (纸本)9783319616605;9783319616599

Formal models developed in the field of argumentation allow for analysing and evaluating problems that have previously been studied by philosophers on an informal level only. Importantly, they also give rise to the development of computational tools for argumentation. In this paper we report on ArgueApply, a mobile app for argumentation that is based on the Grappa framework, an extension of, e.g., abstract argumentation in the sense of Dung. With ArgueApply users can engage in online discussions and evaluate their semantics. Each of the resulting interpretations can be seen as a coherent view on a discussion in which some of the discussions statements are accepted and others rejected. Being a mobile tool, ArgueApply is intended to be more accessible than existing systems for computing argumentation semantics allowing, e.g., for spontaneous analysis of an ongoing discussion or collective preparation for an important debate. While having a practical system for these applications is the final goal of our work, an immediate objective is using the system for exploring which type of Grappa frameworks under which semantics are best suited for such applications.

关键词： Argumentation Grappa Mobile application Android answer-set programming

来源：评论

学校读者我要写书评

暂无评论

Automatic Synthesis of Boolean Networks from Biological Knowledge and Data 4th

Automatic Synthesis of Boolean Networks from Biological Know...

引用

4th International Conference on Optimization and Learning (OLA)

作者： Vaginay, Athenais Boukhobza, Taha Smail-Tabbone, Malika Univ Lorraine CNRS CRAN F-54000 Nancy France Univ Lorraine CNRS Inria LORIA F-54000 Nancy France

ISBN: (纸本)9783030856717;9783030856724

Boolean Networks (BNs) are a simple formalism used to study complex biological systems when the prediction of exact reaction times is not of interest. They play a key role to understand the dynamics of the studied systems and to predict their disruption in case of complex human diseases. BNs are generally built from experimental data and knowledge from the literature, either manually or with the aid of programs. The automatic synthesis of BNs is still a challenge for which several approaches have been proposed. In this paper, we propose ASKeD-BN, a new approach based on answer-set programming to synthesise BNs constrained in their structure and dynamics. By applying our method on several well-known biological systems, we provide empirical evidence that our approach can construct BNs in line with the provided constraints. We compare our approach with three existing methods (REVEAL, Best-Fit and caspo-TS) and show that our approach synthesises a small number of BNs which are covering a good proportion of the dynamical constraints, and that the variance of this coverage is low.

关键词： Boolean network synthesis answer-set programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：