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

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

作者： Balduccini, Marcello Lierler, Yuliya Schuller, Peter Eastman Kodak Co Rochester NY 14650 USA Univ Nebraska Omaha NE USA Sabancuy Univ Istanbul Turkey

ISBN: (纸本)9783642405648

answer set programming (ASP) is a declarative programming paradigm stemming from logic programming that has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications still pose a challenge that is commonly referred to as grounding bottleneck. Devising, implementing, and evaluating a method that alleviates this problem for certain application domains is the focus of this paper. The proposed method is based on combining backtracking-based search algorithms employed in answer set solvers with SLDNF resolution from PROLOG. Using PROLOG inference on non-ground portions of a given program, both grounding time and the size of the ground program can be substantially reduced.

关键词： answer set programming Prolog Grounding Bottleneck.

来源：评论

学校读者我要写书评

暂无评论

The jobs puzzle: Taking on the challenge via controlled natural language processing

The jobs puzzle: Taking on the challenge via controlled natu...

引用

29th International Conference on Logic programming ICLP

作者： Schwitter, Rolf Macquarie Univ Dept Comp Sydney NSW 2109 Australia

In this paper we take on Stuart C. Shapiro's challenge of solving the Jobs Puzzle automatically and do this via controlled natural language processing. Instead of encoding the puzzle in a formal language that might be difficult to use and understand, we employ a controlled natural language as a high-level specification language that adheres closely to the original notation of the puzzle and allows us to reconstruct the puzzle in a machine-processable way and add missing and implicit information to the problem description. We show how the resulting specification can be translated into an answer set program and be processed by a state-of-the-art answer set solver to find the solutions to the puzzle.

关键词： Controlled natural language knowledge representation answer set programming

来源：评论

学校读者我要写书评

暂无评论

Stable model semantics for founded bounds

Stable model semantics for founded bounds

引用

29th International Conference on Logic programming ICLP

作者： Aziz, Rehan Abdul Chu, Geoffrey Stuckey, Peter J. Univ Melbourne Dept Comp & Informat Syst Victoria Lab Natl ICT Australia Melbourne Vic 3010 Australia

answer set programming (ASP) is a powerful form of declarative programming used in areas such as planning or reasoning. ASP solvers enforce stable model semantics, which rule out solutions representing certain kinds of circular reasoning. Unfortunately, current ASP solvers are incapable of solving problems involving cyclic dependencies between multiple integer or continuous quantities effectively. In this paper, we generalize the notion of stable models to bound founded variables with arbitrary domains, where bounds on such variables need to be justified by some rule in the program in order for the model to be stable. We show how to handle significantly more general rule forms where bound founded variables can act as head or body variables, and where head and body variables can be related via complex constraints subject to certain monotonicity requirements. We describe a new unfounded set detection algorithm which allows us to enforce this generalization of the stable model semantics. We also show how these unfounded sets can be explained in order to allow effective conflict-directed clause learning. The new solver merges the best features of CP, SAT and ASP solvers and allows new types of problems to be solved very efficiently.

关键词： answer set programming stable model semantics finite domain solving

来源：评论

学校读者我要写书评

暂无评论

On the stable model semantics for intensional functions

On the stable model semantics for intensional functions

引用

29th International Conference on Logic programming ICLP

作者： Bartholomew, Michael Lee, Joohyung Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85069 USA

Several extensions of the stable model semantics are available to describe "intensional" functions-functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were defined in different ways under different intuitions. In this paper we provide several reformulations of the extensions, and note that they are in fact closely related to each other and coincide on large syntactic classes of logic programs.

关键词： answer set programming stable models intensional functions

来源：评论

学校读者我要写书评

暂无评论

ARVis: Visualizing Relations between answer sets

ARVis: Visualizing Relations between Answer Sets

引用

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

作者： Ambroz, Thomas Charwat, Guenther Jusits, Andreas Wallner, Johannes Peter Woltran, Stefan Vienna Univ Technol Inst Informat Syst Vienna Austria

ISBN: (纸本)9783642405648

answer set programming (ASP) is nowadays one of the most popular modeling languages in the areas of Knowledge Representation and Artificial Intelligence. Hereby one represents the problem at hand in such a way that each model of the ASP program corresponds to one solution of the original problem. In recent years, several tools which support the user in developing ASP applications have been introduced. However, explicit treatment of one of the main aspects of ASP, multiple solutions, has received less attention within these tools. In this work, we present a novel system to visualize relations between answer sets of a given program. The core idea of the system is that the user specifies the concept of a relation by an ASP program itself. This yields a highly flexible system that suggests potential applications beyond development environments, e.g., applications in the field of abduction, which we will discuss in a case study.

关键词： answer set programming Systems Abduction

来源：评论

学校读者我要写书评

暂无评论

ASP with non-herbrand partial functions: a language and system for practical use

ASP with non-herbrand partial functions: a language and syst...

引用

29th International Conference on Logic programming ICLP

作者： Balduccini, Marcello Eastman Kodak Co Rochester NY 14650 USA

Dealing with domains involving substantial quantitative information in answer set programming (ASP) often results in cumbersome and inefficient encodings. Hybrid "CASP" languages combining ASP and Constraint programming aim to overcome this limitation, but also impose inconvenient constraints - first and foremost that quantitative information must be encoded by means of total functions. This goes against central knowledge representation principles that contribute to the power of ASP, and makes the formalization of certain domains difficult. ASP{f} is being developed with the ultimate goal of providing scientists and practitioners with an alternative to CASP languages that allows for the efficient representation of qualitative and quantitative information in ASP without restricting one's ability to deal with incompleteness or uncertainty. In this paper we present the latest outcome of such research: versions of the language and of the supporting system that allow for practical, industrial-size use and scalability. The applicability of ASP{f} is demonstrated by a case study on an actual industrial application.

关键词： answer set programming non-herbrand functions constraint answer set programming practical applications

来源：评论

学校读者我要写书评

暂无评论

SocACL: An ASP-Based Access Control Language for Online Social Networks

SocACL: An ASP-Based Access Control Language for Online Soci...

引用

14th IFIP-TC 6 and TC-11 International Conference on Communications and Multimedia Security (CMS)

作者： Caprin, Edward Zhang, Yan Univ Western Sydney Sch Comp Engn & Math Artificial Intelligence Res Grp Kingswood NSW Australia

ISBN: (纸本)9783642407796;9783642407789

Online Social Networks (OSNs), such as Facebook, encourage their users to disclose significant amounts of personal information to facilitate connecting and sharing content with other users. This has resulted in some OSNs holding vast amounts of information about their users;all of which is readily available via their profile page. As such, OSNs are particularly vulnerable to privacy breach attacks. With the impact these breaches varying from simply embarrassing the user, to negatively influencing the decision of a potential employer, identity theft and even physical harm it is important that these breaches are addressed. In this research we approach privacy management in OSNs as an access control problem, proposing a fine-grained, formal Attribute-Based Access Control (ABAC) language;SocACL (Social Access Control Language). SocACL is based on answer set programming (ASP) and allows for policy specification using the most abundant sources of information available in OSNs;user attributes and relationships.

关键词： answer set programming Online Social Networks privacy access control Attribute-Based Access Control

来源：评论

学校读者我要写书评

暂无评论

A declarative approach to distributed computing: Specification, execution and analysis

A declarative approach to distributed computing: Specificati...

引用

29th International Conference on Logic programming ICLP

作者： Ma, Jiefei Le, Franck Wood, David Russo, Alessandra Lobo, Jorge Imperial Coll London London England IBM Corp Waston Lab Armonk NY 10504 USA ICREA Univ Pompeu Fabra Barcelona Spain

There is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (i) specified as action theories of fluents and actions;(ii) executed as collections of distributed state machines, where devices are abstracted as (input/output) automata that can exchange messages;and (iii) analysed using existing results on connecting causal theories and answer set programming. Results on the application of our approach to different classes of network protocols are also presented.

关键词： action theory answer set programming network protocols distributed computing

来源：评论

学校读者我要写书评

暂无评论

Inductive definitions in constraint programming 13

Inductive definitions in constraint programming

引用

Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135

作者： Rehan Abdul Aziz Peter J. Stuckey Zoltan Somogyi The University of Melbourne and National ICT Australia (NICTA)

ISBN: (纸本)9781921770203

Constraint programming (CP) and answer set programming (ASP) are two declarative paradigms used to solve combinatorial problems. Many modern solvers for both these paradigms rely on partial or complete Boolean representations of the problem to exploit the extremely efficient techniques that have been developed for solving propositional satisfiability problems. This convergence on a common representation makes it possible to incorporate useful features of CP into ASP and vice versa. There has been significant effort in recent years to integrate CP into ASP, primarily to overcome the grounding bottleneck in traditional ASP solvers that exists due to their inability to handle integer variables efficiently. On the other hand, ASP solvers are more efficient than CP systems on problems that involve inductive definitions, such as reachability in a graph. Besides efficiency, ASP syntax is more natural and closer to the mathematical definitions of such concepts. In this paper, we describe an approach that adds support for answer set rules to a CP system, namely the lazy clause generation solver chuffed. This integration also naturally avoids the grounding bottleneck of ASP since constraint solvers natively support finite domain variables. We demonstrate the usefulness of our approach by comparing our new system against two competitors: the state-of-the-art ASP solver clasp, and clingcon, a system that extends clasp with CP capabilities.

关键词： answer set programming stable model semantics inductive definitions constraint programming

来源：评论

学校读者我要写书评

暂无评论

Semantic forgetting in answer set programming

引用

ARTIFICIAL INTELLIGENCE 2008年第14期172卷 1644-1672页

作者： Eiter, Thomas Wang, Kewen Griffith Univ Sch Informat & Commun Technol Brisbane Qld 4111 Australia Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

The notion of forgetting, also known as variable elimination, has been investigated extensively in the context of classical logic, but less so in (nonmonotonic) logic programming and nonmonotonic reasoning. The few approaches that exist are based on syntactic modifications of a program at hand. In this paper, we establish a declarative theory of forgetting for disjunctive logic programs under answer set semantics that is fully based on semantic grounds. The suitability of this theory is justified by a number of desirable properties. In particular, one of our results shows that our notion of forgetting can be entirely captured by classical forgetting. We present several algorithms for computing a representation of the result of forgetting, and provide a characterization of the computational complexity of reasoning from a logic program under forgetting. As applications of our approach, we present a fairly general framework for resolving conflicts in inconsistent knowledge bases that are represented by disjunctive logic programs, and we show how the semantics of inheritance logic programs and update logic programs from the literature can be characterized through forgetting. The basic idea of the conflict resolution framework is to weaken the preferences of each agent by forgetting certain knowledge that causes inconsistency. In particular, we show how to use the notion of forgetting to provide an elegant solution for preference elicitation in disjunctive logic programming. (c) 2008 Published by Elsevier B.V.

关键词： answer set programming nonmonotonic logic programs knowledge representation forgetting computational complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：