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

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

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation with answer-set programming 09

Resource Allocation with Answer-Set Programming

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Joao Leite Jose Alferes Belopeta Mito Universidade Nova de Lisboa

ISBN: (纸本)9781615673346

Multi-agent resource allocation is a growing area of research at the frontier between Economics and Computer Science. Despite the extensive theoretical work and raising number of practical applications, many fundamental problems in multi-agent resource allocation still require adequate attention to its computational aspects. This paper addresses computational aspects of multi-agent resource allocation through the use of a fully declarative and highly expressive logic programming paradigm - answer set programming - to provide uniform, general and flexible solutions to many multi-agent resource allocation problems in a compact and declarative manner.

关键词： Algorithms Economics Resource Allocation answer-set programming Preference Representation Resource utilization management of resources economics algorithms programming computer science

来源：评论

学校读者我要写书评

暂无评论

Consistent query answering via ASP from different perspectives: Theory and practice

引用

THEORY AND PRACTICE OF LOGIC programming 2013年第02期13卷 227-252页

作者： Manna, Marco Ricca, Francesco Terracina, Giorgio Univ Calabria Dept Math I-87036 Cosenza Italy

A data integration system provides transparent access to different data sources by suitably combining their data, and providing the user with a unified view of them, called global schema. However, source data are generally not under the control of the data integration process;thus, integrated data may violate global integrity constraints even in the presence of locally consistent data sources. In this scenario, it may be anyway interesting to retrieve as much consistent information as possible. The process of answering user queries under global constraint violations is called consistent query answering (CQA). Several notions of CQA have been proposed, e.g., depending on whether integrated information is assumed to be sound, complete, exact, or a variant of them. This paper provides a contribution in this setting: it uniforms solutions coming from different perspectives under a common answer-set programming (ASP)-based core, and provides query-driven optimizations designed for isolating and eliminating inefficiencies of the general approach for computing consistent answers. Moreover, the paper introduces some new theoretical results enriching existing knowledge on the decidability and complexity of the considered problems. The effectiveness of the approach is evidenced by experimental results.

关键词： answer-set programming data integration consistent query answering

来源：评论

学校读者我要写书评

暂无评论

Parallel instantiation of ASP programs: techniques and experiments

引用

THEORY AND PRACTICE OF LOGIC programming 2013年第02期13卷 253-278页

作者： Perri, Simona Ricca, Francesco Sirianni, Marco Univ Calabria Dipartimento Matemat I-87030 Arcavacata Di Rende Italy

answer-set programming (ASP) is a powerful logic-based programming language, which is enjoying increasing interest within the scientific community and (very recently) in industry. The evaluation of answer-set Programs is traditionally carried out in two steps. At the first step, an input program P undergoes the so-called instantiation (or grounding) process, which produces a program P' semantically equivalent to P, but not containing any variable;in turn, P' is evaluated by using a backtracking search algorithm in the second step. It is well-known that instantiation is important for the efficiency of the whole evaluation, might become a bottleneck in common situations, is crucial in several real-world applications, and is particularly relevant when huge input data have to be dealt with. At the time of this writing, the available instantiator modules are not able to exploit satisfactorily the latest hardware, featuring multi-core/multi-processor Symmetric MultiProcessing technologies. This paper presents some parallel instantiation techniques, including load-balancing and granularity control heuristics, which allow for the effective exploitation of the processing power offered by modern Symmetric MultiProcessing machines. This is confirmed by an extensive experimental analysis reported herein.

关键词： answer-set programming Instantiation Parallelism Heuristics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A common view on strong, uniform, and other notions of equivalence in answer-set programming

引用

THEORY AND PRACTICE OF LOGIC programming 2008年第2期8卷 217-234页

作者： Woltran, Stefan Vienna Univ Technol Inst Informat Syst 184 2 A-1040 Vienna Austria

Logic programming under the answer-set semantics nowadays deals with numerous different notions of program equivalence. This is due to the fact that equivalence for substitution (known as strong equivalence) and ordinary equivalence are different concepts. The former holds, given programs P and Q, iff P can be faithfully replaced by Q within any context R, while the latter holds iff P and Q provide the same output, that is, they have the same answer sets. Notions in between strong and ordinary equivalence have been introduced as theoretical tools to compare incomplete programs and are defined by either restricting the syntactic structure of the considered context programs R or by bounding the set A of atoms allowed to occur in R (relativized equivalence). For the latter approach, different v yield properly different equivalence notions, in general. For the former approach, however, it turned out that any "reasonable" syntactic restriction to R coincides with either ordinary, strong, or uniform equivalence (for uniform equivalence, the context ranges over arbitrary sets of facts, rather than program rules). In this paper, we propose a parameterization for equivalence notions which takes care of both such kinds of restrictions simultaneously by bounding, on the one hand, the atoms which are allowed to occur in the rule heads of the context and, on the other hand, the atoms which are allowed to occur in the rule bodies of the context. We introduce a general semantical characterization which includes known ones as SE-models (for strong equivalence) or UE-models (for uniform equivalence) as special cases. Moreover, we provide complexity bounds for the problem in question and sketch a possible implementation method making use of dedicated systems for checking ordinary equivalence.

关键词： answer-set programming strong equivalence relativized equivalence

来源：评论

学校读者我要写书评

暂无评论

Equivalences in answer-set programming by Countermodels in the Logic of Here-and-There

Equivalences in Answer-Set Programming by Countermodels in t...

引用

24th International Conference on Logic programming (ICLP)

作者： Fink, Michael Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783540899815

In answer-set programming different notions of equivalence, Such as the prominent notions of strong and uniform equivalence, have been studied and characterized by various selections of models in the logic of Here-and-There (HT). For uniform equivalence however, Correct characterizations in terms of HT-models can only be obtained for finite theories, respectively programs. In this paper, we show that a selection of countermodels in HT captures uniform equivalence also for infinite theories. This result is turned into coherent characterizations of the different notions of equivalence by countermodels, as well as by a mixture of HT-models and countermodels (so-called equivalence interpretations), which are lifted to first-order theories Under a very general semantics given in terms of a quantified version of HT. We show that countermodels exhibit expedient properties like I simplified treatment of extended signatures, and provide further results for non-ground logic programs. In particular, uniform equivalence coincides under open and ordinary answer-set semantics, and for finite non-ground programs Under these semantics, also the usual characterization of uniform equivalence in terms of maximal and total HT-models of the grounding is correct, even for infinite domains, when corresponding ground programs are infinite.

关键词： answer-set programming uniform equivalence knowledge representation program optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：