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

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

THEORY AND PRACTICE OF LOGIC programming 2010年第4-6期10卷 759-775页

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Catching the Ouroboros: On debugging non-ground answer-set programs

引用

THEORY AND PRACTICE OF LOGIC programming 2010年第4-6期10卷 513-529页

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

An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, methods for debugging an answer-set program are recognised as a crucial step in this regard. Initial work on debugging in ASP mainly focused on propositional programs, yet practical debuggers need to handle programs with variables as well. In this paper, we discuss a debugging technique that is directly geared towards non-ground programs. Following previous work, we address the central debugging question why some interpretation is not an answer set. The explanations provided by our method are computed by means of a meta-programming technique, using a uniform encoding of a debugging request in terms of ASP itself. Our method also permits programs containing comparison predicates and integer arithmetics, thus covering a relevant language class commonly supported by all state-of-the-art ASP solvers.

关键词： answer-set programming program analysis debugging

来源：评论

学校读者我要写书评

暂无评论

Annotating answer-set programs in LANA

引用

THEORY AND PRACTICE OF LOGIC programming 2012年第4-5期12卷 619-637页

作者： De Vos, Marina Kisa, Doga Gizem Oetsch, Johannes Puehrer, Joerg Tompits, Hans Univ Bath Dept Comp Bath BA2 7AY Avon England Sabanci Univ Fac Engn & Nat Sci TR-34956 Istanbul Turkey Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria

While past research in answer-set programming (ASP) mainly focused on theory, ASP solver technology, and applications, the present work situates itself in the context of a quite recent research trend: development support for ASP. In particular, we propose to augment answer-set programs with additional meta-information formulated in a dedicated annotation language, called LANA. This language allows the grouping of rules into coherent blocks and to specify language signatures, types, pre- and postconditions, as well as unit tests for such blocks. While these annotations are invisible to an ASP solver, as they take the form of program comments, they can be interpreted by tools for documentation, testing, and verification purposes, as well as to eliminate sources of common programming errors by realising syntax checking or code completion features. To demonstrate its versatility, we introduce two such tools, viz. (i) ASPDOC, for generating an HTML documentation for a program based on the annotated information, and (ii) ASPUNIT, for running and monitoring unit tests on program blocks. LANA is also exploited in the SeaLion system, an integrated development environment for ASP based on Eclipse.

关键词： answer-set programming program annotations documentation unit testing

来源：评论

学校读者我要写书评

暂无评论

D-FLAT2: Subset Minimization in Dynamic programming on Tree Decompositions Made Easy

引用

FUNDAMENTA INFORMATICAE 2016年第1期147卷 27-61页

作者： Bliem, Bernhard Charwat, Gunther Hecher, Markus Woltran, Stefan TU Wien Inst Informat Syst Vienna Austria

Many problems from the area of AI have been shown tractable for bounded treewidth. In order to put such results into practice, quite involved dynamic programming (DP) algorithms on tree decompositions have to be designed and implemented. These algorithms typically show recurring patterns that call for tasks like subset minimization. In this paper we present a novel approach to obtain such DP algorithms from simpler principles, where the DP formalization of subset minimization is performed automatically. We first give a theoretical account of our novel method, and then present D-FLAT<^>2, a system that allows one to specify the core DP algorithm via answer set programming (ASP). We illustrate the approach at work by providing several DP algorithms that are more space-efficient than existing solutions, while featuring improved readability, reuse and therefore maintainability of ASP code. Experiments show that our approach also yields a significant improvement in runtime performance.

关键词： subset minimization dynamic programming tree decomposition answer-set programming artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Advancing Lazy-Grounding ASP Solving Techniques - Restarts, Phase Saving, Heuristics, and More

引用

THEORY AND PRACTICE OF LOGIC programming 2020年第5期20卷 609-624页

作者： Weinzierl, Antonius Taupe, Richard Friedrich, Gerhard TU Wien Vienna Univ Technol Vienna Austria Alpen Adria Univ Klagenfurt Austria Siemens AG Osterreich Vienna Austria

answer-set programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI. The traditional ground-and-solve approach, however, requires ASP programs to be grounded upfront and thus suffers from the so-called grounding bottleneck (i.e., ASP programs easily exhaust all available memory and thus become unsolvable). As a remedy, lazy-grounding ASP solvers have been developed, but many state-of-the-art techniques for grounded ASP solving have not been available to them yet. In this work we present, for the first time, adaptions to the lazy-grounding setting for many important techniques, like restarts, phase saving, domain-independent heuristics, and learned-clause deletion. Furthermore, we investigate their effects and in general observe a large improvement in solving capabilities and also uncover negative effects in certain cases, indicating the need for portfolio solving as known from other solvers.

关键词： answer-set programming Lazy-Grounding Solving Techniques Knowledge Representation

来源：评论

学校读者我要写书评

暂无评论

Reasoning about conditional constraint specification problems and feature models

引用

AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING 2011年第2期25卷 163-174页

作者： Finkel, Raphael O'Sullivan, Barry Univ Kentucky Dept Comp Sci Lexington KY 40506 USA Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland Univ Coll Cork Dept Comp Sci Cork Ireland

Product configuration is a major industrial application domain for constraint satisfaction techniques. Conditional constraint satisfaction problems (CCSPs) and feature models (FMs) have been developed to represent configuration problems in a natural way. CCSPs are like constraint satisfaction problems (CSPs), but they also include potential variables, which might or might not exist in any given solution, as well as classical variables, which are required to take a value in every solution. CCSPs model, for example, options on a car, for which the style of sunroof (a variable) only makes sense if the car has a sunroof at all. FMs are directed acyclic graphs of features with constraints on edges. FMs model, for example, cell phone features, where utility functions are required, but the particular utility function "games" is optional, but requires Java support. We show that existing techniques from formal methods and answer set programming can be used to naturally model CCSPs and FMs. We demonstrate configurators in both approaches. An advantage of these approaches is that the model builder does not have to reformulate the CCSP or FM into a classic CSP, converting potential variables into classical variables by adding a "does not exist" value and modifying the problem constraints. Our configurators automatically reason about the model itself, enumerating all solutions and discovering several kinds of model flaws.

关键词： Alloy answer-set programming Configuration Constraint Satisfaction Flaw Detection

来源：评论

学校读者我要写书评

暂无评论

WizArg: Visual Argumentation Framework Solving Wizard

WizArg: Visual Argumentation Framework Solving Wizard

引用

13th International Conference of the Catalan-Association-for-Artificial-Intelligence (CCIA)

作者： Gomez-Sebastia, Ignasi Carlos Nieves, Juan Univ Politecn Cataluna Dept Llenguatges & Sistemes Informat C Jordi Girona 1-3 E-08034 Barcelona Spain

ISBN: (纸本)9781607506430;9781607506423

Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. An important concern in extension-based-argumentation semantics is the computational complexity of the decision problems that has been shown to range from NP-complete to Pi((p))(2)-complete. In this paper, we introduce a generic extension-based argumentation semantics solver, that is called WizArg. The WizArg project consists in two main components: The WizArg Argumentation library (that can be used by any generic software to solve argumentation frameworks and answer questions about extension-based-argumentation semantics) and the WizArg front-end (a generic software component that allows users to create, save, and load their own argumentation frameworks).

关键词： Argumentation Theory Argumentation-reasoning tool answer-set programming

来源：评论

学校读者我要写书评

暂无评论

Random vs. Structure-Based Testing of answer-set Programs: An Experimental Comparison

引用

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

作者： Janhunen, Tomi Niemela, Ilkka Oetsch, Johannes Puehrer, Joerg Tompits, Hans Aalto Univ Dept Informat & Comp Sci POB 15400 FI-00076 Aalto Finland Techn Univ Wien Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783642208942;9783642208959

answer-set programming (ASP) is an established paradigm for declarative problem solving, yet comparably little work on testing of answer-set programs has been done so far. In a recent paper, foundations for structure-based testing of answer-set programs building on a number of coverage notions have been proposed. In this paper, we develop a framework for testing answer-set programs based on this work and study how good the structure-based approach to test input generation is compared to random test input generation. The results indicate that random testing is quite ineffective for some benchmarks, while structure-based techniques catch faults with a high rate more consistently also in these cases.

关键词： answer-set programming structure-based testing random testing

来源：评论

学校读者我要写书评

暂无评论

Early Recovery in Logic Program Updates

Early Recovery in Logic Program Updates

引用

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

作者： Slota, Martin Balaz, Martin Leite, Joao Univ Nova Lisboa CENTRIA P-1200 Lisbon Portugal Univ Nova Lisboa Dept Informat P-1200 Lisbon Portugal

We pinpoint the limitations of existing approaches to the treatment of strong and default negation in answer-set program updates and formulate the early recovery principle that plausibly constrains their interaction.

ISBN: (纸本)9783642405648

关键词： answer-set programming updates strong negation default negation

来源：评论

学校读者我要写书评

暂无评论

Catching the Ouroboros: On debugging non-ground answer-set programs

Catching the Ouroboros: On debugging non-ground answer-set p...

引用

26th International Conference on Logic programming (ICLP)

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

关键词： answer-set programming program analysis debugging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：