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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On simple but hard random instances of propositional theories and logic programs

On simple but hard random instances of propositional theorie...

引用

作者： Namasivayam, Gayathri University of Kentucky

学位级别：Ph.D.

In the last decade, answer set programming (ASP) and Satisfiability (SAT) have been used to solve combinatorial search problems and practical applications in which they arise. In each of these formalisms, a tool called a solver is used to solve problems. A solver takes as input a specification of the problem – a logic program in the case of ASP, and a CNF theory for SAT – and produces as output a solution to the problem. Designing fast solvers is important for the success of this general-purpose approach to solving search problems. Classes of instances that pose challenges to solvers can help in this task. In this dissertation we create challenging yet simple benchmarks for existing solvers in ASP and SAT. We do so by providing models of simple logic programs as well as models of simple CNF theories. We then randomly generate logic programs as well as CNF theories from these models. Our experimental results show that computing answer sets of random logic programs as well as models of random CNF theories with carefully chosen parameters is hard for existing solvers. We generate random logic programs with 2-literals, and our experiments show that it is hard for ASP solvers to obtain answer sets of purely negative and constraint-free programs, indicating the importance of these programs in the development of ASP solvers. An easy-hard-easy pattern emerges as we compute the average number of choice points generated by ASP solvers on randomly generated 2-literal programs with an increasing number of rules. We provide an explanation for the emergence of this pattern in these programs. We also theoretically study the probability of existence of an answer set for sparse and dense 2-literal programs. We consider simple classes of mixed Horn formulas with purely positive 2- literal clauses and purely negated Horn clauses. First we consider a class of mixed Horn formulas wherein each formula has m 2-literal clauses and k-literal negated Horn clauses. We show that formulas that

关键词： Knowledge representation answer-set programming Propositional satisfiability Mixed Horn formulas Random SAT

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

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

来源：评论

学校读者我要写书评

暂无评论

Relativized hyperequivalence of logic programs for modular programming

引用

THEORY AND PRACTICE OF LOGIC programming 2009年第6期9卷 781-819页

作者： Truszczynski, Miroslaw Woltran, Stefan Univ Kentucky Dept Comp Sci Lexington KY 40506 USA Vienna Univ Technol Inst Informat Syst 184 2 A-1040 Vienna Austria

A recent framework of relativized hyperequivalence of programs offers a unifying generalization of strong and uniform equivalence. It seems to be especially well suited for applications in program optimization and modular programming due to its flexibility that allows us to restrict, independently of each other, the head and body alphabets in context programs. We study relativized hyperequivalence for the three semantics of logic programs given by stable, supported, and supported minimal models. For each semantics, we identify four types of contexts, depending on whether the head and body alphabets are given directly or as the complement of a given set. Hyperequivalence relative to contexts where the head and body alphabets are specified directly has been studied before. In this paper, we establish the complexity of deciding relativized hyperequivalence with respect to the three other types of context programs.

关键词： answer-set programming strong equivalence uniform equivalence relativized equivalence stable models supported models minimal models complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：