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

5th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th international conference on logic programming, iclp 2012

作者： Lee, Joohyung Meng, Yunsong School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe United States

We present alternative definitions of the first-order stable model semantics and its extension to incorporate generalized quantifiers by referring to the familiar notion of a reduct instead of referring to the SM operator in the original definitions. Also, we extend the FLP stable model semantics to allow generalized quantifiers by referring to an operator that is similar to the SM operator. For a reasonable syntactic class of logic programs, we show that the two stable model semantics of generalized quantifiers are interchangeable. © 2012 ***. All rights reserved.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Static type inference for the Q language using constraint logic programming

Static type inference for the Q language using constraint lo...

引用

28th international conference on logic programming, iclp 2012

作者： Zombori, Zsolt Csorba, János Szeredi, Péter Department of Computer Science and Information Theory Budapest University of Technology and Economics Magyar tudósok körútja 2 Budapest H-1117 Hungary

ISBN: (纸本)9783939897439

We describe an application of Prolog: a type inference tool for the Q functional language. Q is a terse vector processing language, a descendant of APL, which is getting more and more popular, especially in financial applications. Q is a dynamically typed language, much like Prolog. Extending Q with static typing improves both the readability of programs and programmer productivity, as type errors are discovered by the tool at compile time, rather than through debugging the program execution. We map the task of type inference onto a constraint satisfaction problem and use constraint logic programming, in particular the Constraint Handling Rules extension of Prolog. We determine the possible type values for each program expression and detect inconsistencies. As most built-in function names of Q are overloaded, i.e. their meaning depends on the argument types, a quite complex system of constraints had to be implemented. © Zsolt Zombori, János Csorba, and Péter Szeredi.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Planning and scheduling in hybrid domains using answer set programming 5

Planning and scheduling in hybrid domains using answer set p...

引用

5th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th international conference on logic programming, iclp 2012

作者： Chintabathina, Sandeep University of Arkansas at Pine Bluff Pine Bluff AR71601 United States

In this paper we present an Action Language-Answer Set programming based approach to solving planning and scheduling problems in hybrid domains - domains that exhibit both discrete and continuous behavior. We use action language H to represent the domain and then translate the resulting theory into an A-Prolog program. In this way, we reduce the problem of finding solutions to planning and scheduling problems to computing answer sets of A-Prolog programs. We cite a planning and scheduling example from the literature and show how to model it in H. We show how to translate the resulting H theory into an equivalent A-Prolog program. We compute the answer sets of the resulting program using a hybrid solver called EZCSP which loosely integrates a constraint solver with an answer set solver. the solver allows us reason about constraints over reals and compute solutions to complex planning and scheduling problems. Results have shown that our approach can be applied to any planning and scheduling problem in hybrid domains. © 2012 ***. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Surviving solver sensitivity: An ASP practitioner's guide

Surviving solver sensitivity: An ASP practitioner's guide

引用

28th international conference on logic programming, iclp 2012

作者： Silverthorn, Bryan Lierler, Yuliya Schneider, Marius Department of Computer Science University of Texas Austin TX United States Department of Computer Science University of Kentucky Lexington KY United States Institute of Computer Science University of Potsdam Potsdam Germany

ISBN: (纸本)9783939897439

Answer set programming (ASP) is a declarative programming formalism that allows a practitioner to specify a problem without describing an algorithm for solving it. In ASP, the tools for processing problem specifications are called answer set solvers. Because specified problems are often NP complete, these systems often require significant computational effort to succeed. Furthermore, they offer different heuristics, expose numerous parameters, and their running time is sensitive to the configuration used. Portfolio solvers and automatic algorithm configuration systems are recent attempts to automate the problem of manual parameter tuning, and to mitigate the burden of identifying the right solver configuration. the approaches taken in portfolio solvers and automatic algorithm configuration systems are orthogonal. this paper evaluates these approaches, separately and jointly, in the context of real-world ASP application development. It outlines strategies for their use in such settings, identifies their respective strengths and weaknesses, and advocates for a methodology that would make them an integral part of developing ASP applications. © Bryan Silverthorn, Yuliya Lierler, and Marius Schneider.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Shared aggregate sets in answer set programming

引用

thEORY AND PRACTICE OF logic programming 2018年第3-4期18卷 301-318页

作者： Alviano, Mario Dodaro, Carmine Maratea, Marco Univ Calabria DEMACS Commenda Di Rende Italy Univ Genoa DIBRIS Genoa Italy

Aggregates are among the most frequently used linguistic extensions of answer set programming. the result of an aggregation may introduce new constants during the instantiation of the input program, a feature known as value invention. When the aggregation involves literals whose truth value is undefined at instantiation time, modern grounders introduce several instances of the aggregate, one for each possible interpretation of the undefined literals. this paper introduces new data structures and techniques to handle such cases, and more in general aggregations on the same aggregate set identified in the ground program in input. the proposed solution reduces the memory footprint of the solver without sacrificing efficiency. On the contrary, the performance of the solver may improve thanks to the addition of some simple entailed clauses which are not easily discovered otherwise, and since redundant computation is avoided during propagation. Empirical evidence of the potential impact of the proposed solution is given.

关键词： answer set programming aggregations in logic programming efficient computation

来源：评论

学校读者我要写书评

暂无评论

A logic programming approach for access control over RDF

A logic programming approach for access control over RDF

引用

28th international conference on logic programming, iclp 2012

作者： Lopes, Nuno Kirrane, Sabrina Zimmermann, Antoine Polleres, Axel Mileo, Alessandra Digital Enterprise Research Institute Ireland Digital Enterprise Research Institute and Storm Technology Ireland FAYOL-ENSMSE LSTI École Nationale Supérieure des Mines F-42023 Saint-Étienne France Siemens AG Österreich Siemensstrasse 90 1210 Vienna Austria

ISBN: (纸本)9783939897439

the Resource Description Framework (RDF) is an interoperable data representation format suitable for interchange and integration of data, especially in Open Data contexts. However, RDF is also becoming increasingly attractive in scenarios involving sensitive data, where data protection is a major concern. At its core, RDF does not support any form of access control and current proposals for extending RDF with access control do not fit well with the RDF representation model. Considering an enterprise scenario, we present a modelling that caters for access control over the stored RDF data in an intuitive and transparent manner. For this paper we rely on Annotated RDF, which introduces concepts from Annotated logic programming into RDF. Based on this model of the access control annotation domain, we propose a mechanism to manage permissions via application-specific logic rules. Furthermore, we illustrate how our Annotated Query Language (AnQL) provides a secure way to query this access control annotated RDF data. © Nuno Lopes, Sabrina Kirrane, Antoine Zimmerman, Axel Polleres, and Alessandra Mileo.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Answer set programming for stream reasoning 5

Answer set programming for stream reasoning

引用

5th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th international conference on logic programming, iclp 2012

作者： Gebser, M. Grote, T. Kaminski, R. Obermeier, P. Sabuncu, O. Schaub, T. Universität Potsdam Germany DERI Galway Ireland

the advance of Internet and Sensor technology has brought about new challenges evoked by the emergence of continuous data streams. Beyond rapid data processing, application areas like ambient assisted living, robotics, or dynamic scheduling involve complex reasoning tasks. We address such scenarios and elaborate upon approaches to knowledge-intense stream reasoning, based on Answer Set programming (ASP). While traditional ASP methods are devised for singular problem solving, we develop new techniques to formulate and process problems dealing with emerging as well as expiring data in a seamless way. © 2012 ***. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Improving quality and efficiency in home health care: An application of constraint logic programming for the ferrara NHS unit

Improving quality and efficiency in home health care: An app...

引用

28th international conference on logic programming, iclp 2012

作者： Cattafi, Massimiliano Herrero, Rosa Gavanelli, Marco Nonato, Maddalena Malucelli, Federico Ramos, Juan José ENDIF Università di Ferrara Italy Dept. de Telecomunicació I Enginyeria de Sistemes UAB Spain Dipartimento di Elettronica E Informazione Politecnico di Milano Italy

ISBN: (纸本)9783939897439

Although sometimes it is necessary, no one likes to stay in a hospital, and patients who need to stay in bed but do not require constant medical surveillance prefer their own bed at home. At the same time, a patient in a hospital has a high cost for the community, that is not acceptable if the patient needs service only a few minutes a day. For these reasons, the current trend in Europe and North-America is to send nurses to visit patients in their home: this choice reduces costs for the community and gives better quality of life to patients. On the other hand, it introduces the combinatorial problem of assigning patients to the available nurses in order to maximize the quality of service, without having nurses travel for overly long distances. In this paper, we describe the problem as a practical application of Constraint logic programming. We first introduce the problem, as it is currently addressed by the nurses in the National Health Service (NHS) in Ferrara, a mid-sized city in the North of Italy. Currently, the nurses solve the problem by hand, and this introduces several inefficiencies in the schedules. We formalize the problem, obtained by interacting with the nurses in the NHS, into a Constraint logic programming model. In order to solve the problem efficiently, we implemented a new constraint that tackles with the routing part of the problem. We propose a declarative semantics for the new constraint, and an implementation based on an external solver. © M. Cattafi, R. Herrero, M. Gavanelli, M. Nonato, F. Malucelli, and J.J. Ramos.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Incremental Answer Set programming with Overgrounding

引用

thEORY AND PRACTICE OF logic programming 2019年第5-6期19卷 957-973页

作者： Calimeri, Francesco Ianni, Giovambattista Pacenza, Francesco Perri, Simona Zangari, Jessica Univ Calabria Dept Math & Comp Sci Commenda Di Rende Italy

Repeated executions of reasoning tasks for varying inputs are necessary in many applicative settings, such as stream reasoning. In this context, we propose an incremental grounding approach for the answer set semantics. We focus on the possibility of generating incrementally larger ground logic programs equivalent to a given non-ground one;so called overgrounded programs can be reused in combination with deliberately many different sets of inputs. Updating overgrounded programs requires a small effort, thus making the instantiation of logic programs considerably faster when grounding is repeated on a series of inputs similar to each other. Notably, the proposed approach works "under the hood", relieving designers of logic programs from controlling technical aspects of grounding engines and answer set systems. In this work we present the theoretical basis of the proposed incremental grounding technique, we illustrate the consequent repeated evaluation strategy and report about our experiments.

关键词： Knowledge Representation Answer Set programming Stream Reasoning Grounding Instantiation of logic Programs Overgrounding

来源：评论

学校读者我要写书评

暂无评论

Ontology-mediated Queries over Probabilistic Data via Probabilistic logic programming 19

Ontology-mediated Queries over Probabilistic Data via Probab...

引用

28th ACM international conference on Information and Knowledge Management (CIKM)

作者： van Bremen, Timothy Dries, Anton Jung, Jean Christoph Katholieke Univ Leuven Leuven Belgium Univ Bremen Bremen Germany

ISBN: (纸本)9781450369763

We study ontology-mediated querying over probabilistic data for the case when the ontology is formulated in epsilon LHdr, an expressive member of the epsilon L family of description logics. We leverage techniques that have been developed (i) for classical ontology-mediated querying and (ii) for probabilistic logic programming and provide an implementation based on our findings. We include both theoretical considerations and an experimental evaluation of our approach.

关键词： probabilistic logic programming ontology-mediated querying uncertainty

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：