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

30th International Conference on logic programming

作者： Bellodi, Elena Lamma, Evelina Riguzzi, Fabrizio Costa, Vitor Santos Zese, Riccardo Univ Ferrara Dipartimento Ingn I-44122 Ferrara Italy Univ Ferrara Dipartimento Matemat & Informat I-44122 Ferrara Italy Univ Porto CRACS INESC TEC P-4169007 Oporto Portugal Univ Porto DCC FCUP P-4169007 Oporto Portugal

Lifted inference has been proposed for various probabilistic logical frameworks in order to compute the probability of queries in a time that depends on the size of the domains of the random variables rather than the number of instances. Even if various authors have underlined its importance for probabilistic logic programming (PLP), lifted inference has been applied up to now only to relational languages outside of logic programming. In this paper we adapt Generalized Counting First Order Variable Elimination (GC-FOVE) to the problem of computing the probability of queries to probabilistic logic programs under the distribution semantics. In particular, we extend the Prolog Factor Language (PFL) to include two new types of factors that are needed for representing ProbLog programs. These factors take into account the existing causal independence relationships among random variables and are managed by the extension to variable elimination proposed by Zhang and Poole for dealing with convergent variables and heterogeneous factors. Two new operators are added to GC-FOVE for treating heterogeneous factors. The resulting algorithm, called LP2 for Lifted Probabilistic logic programming, has been implemented by modifying the PFL implementation of GC-FOVE and tested on three benchmarks for lifted inference. A comparison with PITA and ProbLog2 shows the potential of the approach.

关键词： Probabilistic logic programming Lifted Inference Variable Elimination Distribution Semantics ProbLog Statistical Relational Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

Complexity of super-coherence problems in ASP

引用

theory and practice of logic programming 2014年第3期14卷 339-361页

作者： Alviano, Mario Faber, Wolfgang Woltran, Stefan Univ Calabria I-87036 Arcavacata Di Rende CS Italy Vienna Univ Technol A-1040 Vienna Austria

Adapting techniques from database theory in order to optimize Answer Set programming (ASP) systems, and in particular the grounding components of ASP systems, is an important topic in ASP. In recent years, the Magic Set method has received some interest in this setting, and a variant of it, called Dynamic Magic Set, has been proposed for ASP. However, this technique has a caveat, because it is not correct (in the sense of being query-equivalent) for all ASP programs. In a recent work, a large fragment of ASP programs, referred to as super-coherent programs, has been identified, for which Dynamic Magic Set is correct. The fragment contains all programs which possess at least one answer set, no matter which set of facts is added to them. Two open question remained: How complex is it to determine whether a given program is super-coherent? Does the restriction to super-coherent programs limit the problems that can be solved? Especially the first question turned out to be quite difficult to answer precisely. In this paper, we formally prove that deciding whether a propositional program is super-coherent is Pi(P)(3) -complete in the disjunctive case, while it is Pi(P)(2) -complete for normal programs. The hardness proofs are the difficult part in this endeavor: We proceed by characterizing the reductions by the models and reduct models which the ASP programs should have, and then provide instantiations that meet the given specifications. Concerning the second question, we show that all relevant ASP reasoning tasks can be transformed into tasks over super-coherent programs, although this transformation is more of theoretical than practical interest.

关键词： Answer Set programming (ASP) complexity analysis coherence uniform equivalence foundations

来源：评论

学校读者我要写书评

暂无评论

Contextual Abductive Reasoning with Side-Effects

引用

theory and practice of logic programming 2014年第4-5期14卷 633-648页

作者： Pereira, Luis Moniz Dietz, Emmanuelle-Anna Hoelldobler, Steffen Univ Nova Lisboa Fac Ciencias & Tecnol Dept Informat Ctr Inteligencia Artificial CENTRIA P-2829516 Caparica Portugal Tech Univ Dresden Int Ctr Computat Logi D-01062 Dresden Germany

The belief bias effect is a phenomenon which occurs when we think that we judge an argument based on our reasoning, but are actually influenced by our beliefs and prior knowledge. Evans, Barston and Pollard carried out a psychological syllogistic reasoning task to prove this effect. Participants were asked whether they would accept or reject a given syllogism. We discuss one specific case which is commonly assumed to be believable but which is actually not logically valid. By introducing abnormalities, abduction and background knowledge, we adequately model this case under the weak completion semantics. Our formalization reveals new questions about possible extensions in abductive reasoning. For instance, observations and their explanations might include some relevant prior abductive contextual information concerning some side-effect or leading to a contestable or refutable side-effect. A weaker notion indicates the support of some relevant consequences by a prior abductive context. Yet another definition describes jointly supported relevant consequences, which captures the idea of two observations containing mutually supportive side-effects. Though motivated with and exemplified by the running psychology application, the various new general abductive context definitions are introduced here and given a declarative semantics for the first time, and have a much wider scope of application. Inspection points, a concept introduced by Pereira and Pinto, allows us to express these definitions syntactically and intertwine them into an operational semantics.

关键词： Abductive Reasoning Contextual Reasoning Side-effects Human Reasoning Belief-Bias Inspection Points Three-valued Lukasiewicz logic Weak Completion Semantics logic programming

来源：评论

学校读者我要写书评

暂无评论

claspfolio 2: Advances in Algorithm Selection for Answer Set programming

引用

theory and practice of logic programming 2014年第4-5期14卷 569-585页

作者： Hoos, Holger Lindauer, Marius Schaub, Torsten Univ British Columbia Vancouver BC V5Z 1M9 Canada Univ Freiburg Freiburg Germany Univ Potsdam Potsdam Germany

Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection approaches and techniques. The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques. The default configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features. The flexible open design of claspfolio 2 is a distinguishing factor even beyond ASP. As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework. Taking advantage of this, we conducted an extensive experimental study to assess the impact of different feature sets, selection approaches and base solver portfolios. In addition to gaining substantial insights into the utility of the various approaches and techniques, we identified a default configuration of claspfolio 2 that achieves substantial performance gains not only over clasp's default configuration and the earlier version of claspfolio, but also over manually tuned configurations of clasp.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Resource Usage Analysis of logic Programs via Abstract Interpretation Using Sized Types

Resource Usage Analysis of Logic Programs via Abstract Inter...

引用

30th International Conference on logic programming

作者： Serrano, A. Lopez-Garcia, P. Hermenegildo, M. V. Univ Utrecht Dept Informat & Comp Sci NL-3508 TC Utrecht Netherlands IMDEA Software Inst Madrid Spain CSIC Spanish Council Sci Res Madrid Spain Tech Univ Madrid UPM Madrid Spain

We present a novel general resource analysis for logic programs based on sized types. Sized types are representations that incorporate structural (shape) information and allow expressing both lower and upper bounds on the size of a set of terms and their subterms at any position and depth. They also allow relating the sizes of terms and subterms occurring at different argument positions in logic predicates. Using these sized types, the resource analysis can infer both lower and upper bounds on the resources used by all the procedures in a program as functions on input term (and subterm) sizes, overcoming limitations of existing resource analyses and enhancing their precision. Our new resource analysis has been developed within the abstract interpretation framework, as an extension of the sized types abstract domain, and has been integrated into the Ciao preprocessor, CiaoPP. The abstract domain operations are integrated with the setting up and solving of recurrence equations for inferring both size and resource usage functions. We show that the analysis is an improvement over the previous resource analysis present in CiaoPP and compares well in power to state of the art systems.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Contextual Abductive Reasoning with Side-Effects

Contextual Abductive Reasoning with Side-Effects

引用

30th International Conference on logic programming

关键词： Abductive Reasoning Contextual Reasoning Side-effects Human Reasoning Belief-Bias Inspection Points Three-valued Lukasiewicz logic Weak Completion Semantics logic programming

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study of Long Method and God Method in Industrial Projects

An Empirical Study of Long Method and God Method in Industri...

引用

IEEE/ACM International Conference on Automated Software Engineering - Workshops (ASE Workshops)

作者： Xiaoqiong Zhao Xiao Xuan Shanping Li College of Computer Science and Technology Zhejiang University Hangzhou China

Code smell is any symptom in the source code of a program that possibly indicates a deeper problem. Though code smells are usually not proper bugs which are defined as technically incorrect and functionality block, they indicate poor programming practices in code level which increases risk of bugs in the future. Long method smell is identified as a kind of methods which are have large number of executable statements, at the same time God method smell is identified as a kind of methods which is doing too much. On the previous research and practice, people treat these 2 concepts equivalently. However, the definition of "large number of executable statements" shows us the size of the method, and at the same time definition of "doing too much" shows us the complexity of the logic which is implemented and nested in this method. Though intuitively the two definitions are equivalent -- methods with large number of statement means it nests much business logic so that the complexity of these methods is high, a dearth of studies suggest the research of difference between these two definitions. In this paper, present 2 research questions to study these 2 definitions. We choose one release of 11 java based web application projects which is in maintenance period respectively. In these releases, we ask the developers to analysis the bug reports and related code, then collect all 125 bugs which is caused by code smell and the related code for fixing these bugs. We get 45 bugs caused by the Long method smell and the related 31 methods, and we analyzed the data compared with the longest methods in these projects. The study highlights the need for a clearer definition of this kind of code smell, and there are many factors not only length which is affecting the code quality. So the real thing which is affecting the code quality is beyond the definition of "large number of executable statement", and at the same time the definition of "doing too much" should be modeling to illuminate th

关键词： Complexity theory Computer bugs Java Maintenance engineering Size measurement Business Time measurement

来源：评论

学校读者我要写书评

暂无评论

claspfolio 2: Advances in Algorithm Selection for Answer Set programming

claspfolio 2: Advances in Algorithm Selection for Answer Set...

引用

30th International Conference on logic programming

作者： Hoos, Holger Lindauer, Marius Schaub, Torsten Univ British Columbia Vancouver BC V5Z 1M9 Canada Univ Freiburg Freiburg Germany Univ Potsdam Potsdam Germany

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

基于KM教学论的面向对象程序设计教学研究

引用

教育研究前沿（中英文版） 2015年第2期5卷 17-22页

作者：周法国张帆杨炳儒中国矿业大学(北京)机电与信息工程学院北京100083 北京科技大学北京100083

针对面向对象程序设计是大学理工科专业的必修课程之一,也是计算机科学与技术相关专业的专业基础课,本文在对基于KM 教学论的教学方法进行了叙述的基础上,对KM 教学论在面向对象程序设计这门课程的教学上进行了深入探讨,阐述了基于KM ... 详细信息

针对面向对象程序设计是大学理工科专业的必修课程之一,也是计算机科学与技术相关专业的专业基础课,本文在对基于KM 教学论的教学方法进行了叙述的基础上,对KM 教学论在面向对象程序设计这门课程的教学上进行了深入探讨,阐述了基于KM 教学论在面向对象程序设计课程中的教学模式、教学内容与教学方法,并给出了该课程的部分知识逻辑结构图和思维形式注记图,确立以讲授知识的逻辑结构、理论框架和内在联系为主,对思维活动加以诱导,坚持“先搭架,后填充,再诱导”和少而精的原则对课程知识进行组织和教学,是一种非常值得大力推广的教学方法.

关键词：知识逻辑结构思维形式注记 KM教学论面向对象程序设计

来源：评论

学校读者我要写书评

暂无评论

Monitoring modulo theories

Monitoring modulo theories

引用

20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2014 - Held as Part of the European Joint Conferences on theory and practice of Software, ETAPS 2014

作者： Decker, Normann Leucker, Martin Thoma, Daniel Institute for Software Engineering and Programming Languages Universität Zu Lübeck Germany

ISBN: (纸本)9783642548611

This paper considers a generic approach to enhance traditional runtime verification techniques towards first-order theories in order to reason about data. This allows especially for the verification of multi-threaded, object-oriented systems. It presents a general framework lifting the monitor synthesis for propositional temporal logics to a temporal logic over structures within some first-order theory. To evaluate such temporal properties, SMT solving and classical monitoring of propositional temporal properties is combined. The monitoring procedure was implemented for linear-time temporal logic (LTL) based on the Z3 SMT solver and evaluated regarding runtime performance. © 2014 Springer-Verlag.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：