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

A General Framework for Stable Roommates Problems using answer set programming

THEORY AND PRACTICE OF LOGIC programming 2020年第6期20卷 911-925页

作者： ERDEM, E. S. R. A. FIDAN, M. U. G. E. MANLOVE, D. A. V. I. D. PROSSER, P. A. T. R. I. C. K. Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey Univ Glasgow Sch Comp Sci Glasgow Lanark Scotland

The Stable Roommates problem (SR) is characterized by the preferences of agents over other agents as roommates: each agent ranks all others in strict order of preference. A solution to SR is then a partition of the agents into pairs so that each pair shares a room, and there is no pair of agents that would block this matching (i.e., who prefers the other to their roommate in the matching). There are interesting variations of SR that are motivated by applications (e.g., the preference lists may be incomplete (SRI) and involve ties (SRTI)), and that try to find a more fair solution (e.g., Egalitarian SR). Unlike the Stable Marriage problem, every SR instance is not guaranteed to have a solution. For that reason, there are also variations of SR that try to find a good-enough solution (e.g., Almost SR). Most of these variations are NP-hard. We introduce a formal framework, called SRTI-ASP, utilizing the logic programming paradigm answer set programming, that is provable and general enough to solve many of such variations of SR. Our empirical analysis shows that SRTI-ASP is also promising for applications.

关键词： stable roommates problem answer set programming declarative problem solving

来源：评论

学校读者我要写书评

暂无评论

answer set programming encoding users opinions merging in social networks 20

Answer set programming encoding users opinions merging in so...

引用

Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services

作者： Raïda Ktari Salma Jamoussi OLID Lab-ISGIS Technopole of Sfax Higher Institute of Computer Science and Multimedia University of Sfax Tunisia MIRACL Lab Technopole of Sfax Higher Institute of Computer Science and Multimedia University of Sfax Tunisia

ISBN: (纸本)9781450389228

The present paper describes briefly a project idea in progress about the evolvement of individuals' opinions, beliefs and perceptions on social networks (such as Facebook, Twitter, Instagram, youtube...) which is a thorny subject that has whetted nowadays the curiosity of a hulk of researchers from various disciplines. For this purpose, differently from a lot of works in the literature, we rely on logical knowledge representation tools in order to investigate the belief merging operation of Artificial Intelligence (AI). The major objective of this project is to provide efficient operator for merging heterogeneous, inconsistent and uncertain multiple sources information in the context of social networks taking into account the fact that opinion can be formed and developed through the concept of social influence with its two forms (informational social influence and normative social influence) and the concept of social trust. We intend thus through this research work presenting an adaptative version to our context of an approach [7] expressed thanks to answer set programming (ASP) paradigm with stable model semantics. It is worth to say that our approach profits from the impressive volume data produced by users in social networks about a particular topic by learning from opinions, beliefs and perceptions that their freinds/neighbors share and therefore allows to use this kind of data to extract initial opinions, and to validate the proposed opinions merging process allowing even the prediction of users' behaviors.

关键词： answer set programming social networks beliefs merging social influence opinions

来源：评论

学校读者我要写书评

暂无评论

The joy of Probabilistic answer set programming: Semantics, complexity, expressivity, inference

引用

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING 2020年 125卷 218-239页

作者： Cozman, Fabio Gagliardi Maua, Denis Deratani Univ Sao Paulo Ctr Artificial Intelligence C4AI Sao Paulo Brazil Univ Sao Paulo Escola Politecn Sao Paulo Brazil Univ Sao Paulo Inst Matemat & Estat Sao Paulo Brazil

Probabilistic answer set programming (PASP) combines rules, facts, and independent probabilistic facts. We argue that a very useful modeling paradigm is obtained by adopting a particular semantics for PASP, where one associates a credal set with each consistent program. We examine the basic properties of PASP under this credal semantics, in particular presenting novel results on its complexity and its expressivity, and we introduce an inference algorithm to compute (upper) probabilities given a program. (C) 2020 Elsevier Inc. All rights reserved.

关键词： Logic programming answer set programming Probabilistic programming Credal sets Computational complexity Descriptive complexity

来源：评论

学校读者我要写书评

暂无评论

Complexity results for probabilistic answer set programming

引用

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING 2020年 118卷 133-154页

作者： Maua, Denis Deratani Cozman, Fabio Gagliardi Univ Sao Paulo Inst Math & Stat Sao Paulo Brazil Univ Sao Paulo Escola Politecn Sao Paulo Brazil

We analyze the computational complexity of probabilistic logic programming with constraints, disjunctive heads, and aggregates such as sum and max. We consider propositional programs and relational programs with bounded-arity predicates, and look at cautious reasoning (i.e., computing the smallest probability of an atom over all probability models), cautious explanation (i.e., finding an interpretation that maximizes the lower probability of evidence) and cautious maximum-a-posteriori (i.e., finding a partial interpretation for a set of atoms that maximizes their lower probability conditional on evidence) under Lukasiewicz's credal semantics. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Probabilistic logic programming answer set programming Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Human Robot Collaborative Assembly Planning: An answer set programming Approach

引用

THEORY AND PRACTICE OF LOGIC programming 2020年第6期20卷 1006-1020页

作者： Rizwan, Momina Patoglu, Volkan Erdem, Esra Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey

For planning an assembly of a product from a given set of parts, robots necessitate certain cognitive skills: high-level planning is needed to decide the order of actuation actions, while geometric reasoning is needed to check the feasibility of these actions. For collaborative assembly tasks with humans, robots require further cognitive capabilities, such as commonsense reasoning, sensing, and communication skills, not only to cope with the uncertainty caused by incomplete knowledge about the humans' behaviors but also to ensure safer collaborations. We propose a novel method for collaborative assembly planning under uncertainty, that utilizes hybrid conditional planning extended with commonsense reasoning and a rich set of communication actions for collaborative tasks. Our method is based on answer set programming. We show the applicability of our approach in a real-world assembly domain, where a bi-manual Baxter robot collaborates with a human teammate to assemble furniture.

关键词： answer set programming cognitive robotics conditional planning assembly planning human-robot interaction hybrid reasoning robotic planning planning under uncertainty

来源：评论

学校读者我要写书评

暂无评论

A Generalised Approach for Encoding and Reasoning with Qualitative Theories in answer set programming

引用

THEORY AND PRACTICE OF LOGIC programming 2020年第5期20卷 687-702页

作者： Baryannis, George Tachmazidis, Ilias Batsakis, Sotiris Antoniou, Grigoris Alviano, Mario Univ Huddersfield Huddersfield W Yorkshire England Univ Calabria Commenda Di Rende Italy

Qualitative reasoning involves expressing and deriving knowledge based on qualitative terms such as natural language expressions, rather than strict mathematical quantities. Well over 40 qualitative calculi have been proposed so far, mostly in the spatial and temporal domains, with several practical applications such as naval traffic monitoring, warehouse process optimisation and robot manipulation. Even if a number of specialised qualitative reasoning tools have been developed so far, an important barrier to the wider adoption of these tools is that only qualitative reasoning is supported natively, when real-world problems most often require a combination of qualitative and other forms of reasoning. In this work, we propose to overcome this barrier by using ASP as a unifying formalism to tackle problems that require qualitative reasoning in addition to non-qualitative reasoning. A family of ASP encodings is proposed which can handle any qualitative calculus with binary relations. These encodings are experimentally evaluated using a real-world dataset based on a case study of determining optimal coverage of telecommunication antennas, and compared with the performance of two well-known dedicated reasoners. Experimental results show that the proposed encodings outperform one of the two reasoners, but fall behind the other, an acceptable trade-off given the added benefits of handling any type of reasoning as well as the interpretability of logic programs.

关键词： answer set programming Qualitative Calculus Qualitative Reasoning Spatial Reasoning

来源：评论

学校读者我要写书评

暂无评论

Using answer set programming for HPC dependency solving 22

Using answer set programming for HPC dependency solving

引用

Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

作者： Todd Gamblin Massimiliano Culpo Gregory Becker Sergei Shudler Lawrence Livermore National Laboratory np-complete S.r.l. Italy

Modern scientific software stacks have become extremely complex, using many programming models and libraries to exploit a growing variety of GPUs and accelerators. Package managers can mitigate this complexity using dependency solvers, but they are reaching their limits. Finding compatible dependency versions is NP-complete, and modeling the semantics of package compatibility modulo build-time options, GPU runtimes, flags, and other parameters is extremely difficult. Within this enormous configuration space, defining a "good" configuration is *** tackle this problem using answer set programming (ASP), a declarative model for combinatorial search problems. We show, using the Spack package manager, that ASP programs can concisely express the compatibility rules of HPC software stacks and provide strong quality-of-solution guarantees. Using ASP, we can mix new builds with preinstalled binaries, and solver performance is acceptable even when considering tens of thousands of packages.

关键词： logic programming software packages high performance computing dependency management package management software reusability answer set programming

来源：评论

学校读者我要写书评

暂无评论

Modular answer set programming as a Formal Specification Language

引用

THEORY AND PRACTICE OF LOGIC programming 2020年第5期20卷 767-782页

作者： Cabalar, Pedro Fandinno, Jorge Lierler, Yuliya Univ A Coruna La Coruna Spain Univ Potsdam Potsdam Germany Univ Nebraska Omaha Omaha NE USA

In this paper, we study the problem of formal verification for answer set programming (ASP), namely, obtaining aformal proofshowing that the answer sets of a given (non-ground) logic programPcorrectly correspond to the solutions to the problem encoded byP, regardless of the problem instance. To this aim, we use a formal specification language based on ASP modules, so that each module can be proved to capture some informal aspect of the problem in an isolated way. This specification language relies on a novel definition of (possibly nested, first order)program modulesthat may incorporate local hidden atoms at different levels. Then,verifyingthe logic programPamounts to prove some kind of equivalence betweenPand its modular specification.

关键词： answer set programming Formal Specification Formal Verification Modular Logic Programs

来源：评论

学校读者我要写书评

暂无评论

A Unifying Approach for Nonmonotonic S4F, (Reflexive) Autoepistemic Logic, and answer set programming

引用

FUNDAMENTA INFORMATICAE 2020年第3-4期176卷 205-234页

作者： Su, Ezgi Iraz Istanbul Aydin Univ Fac Engn Comp Engn Program Istanbul Turkey

This paper presents a general strategy, bringing together some major types of nonmonotonic reasoning under a monotonic bimodal setting. Such formalisms are also of interest to the fields of knowledge representation and declarative programming. We exemplify the methodology, capturing minimal model reasoning that underlies nonmonotonicity over S4F first, but then we also show how to apply the technique to other nonmonotonic logics respectively based on the modal logics KD45 and SW5. We naturally succeed it, by modifying only the axioms of the underlying modal logic and show that it successfully works. The last two formalisms are also known as autoepistemic logic (AEL) and its reflexive extension (RAEL) in the given order: AEL is an important form of nonmonotonic reasoning, introduced by Robert C. Moore in order to allow an agent to reason about his own knowledge. Equilibrium logic (EL) is a general-purpose nonmonotonic reasoning formalism, proposed more recently by David Pearce as a semantical framework for answer set programming (ASP). The latter is an efficient declarative problem solving approach with lots of applications to science and technology. Fariflas et al. have embedded EL (and so ASP) into a monotonic bimodal logic. We take this work as an initiative and successfully apply a similar methodology to closely aligned nonmonotonic modal logics. We finally discuss the potential capability to subsume the epistemic extensions of ASP within our unified paradigm.

关键词： nonmonotonic reasoning minimal model semantics (autoepistemic) equilibrium logic answer set programming epistemic specifications monotonic modal logic Kripke model

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Imperative Code from answer set programming Specifications 29th

Synthesizing Imperative Code from Answer Set Programming Spe...

引用

29th International Conference on Logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Varanasi, Sarat Chandra Salazar, Elmer Mittal, Neeraj Gupta, Gopal Univ Texas Dallas Dept Comp Sci Richardson TX 75083 USA

ISBN: (纸本)9783030452599;9783030452605

We consider the problem of obtaining an implementation of an algorithm from its specification. We assume that these specifications are written in answer set programming (ASP). ASP is an ideal formalism for writing specifications due to its highly declarative and expressive nature. To obtain an implementation from its specification, we utilize the operational semantics of ASP implemented in the s(ASP) system. This operational semantics is used to transform the declarative specification written in ASP to obtain an equivalent efficient program that uses imperative control features. This work is inspired by our overarching goal of automatically deriving efficient concurrent algorithms from declarative specifications. This paper reports our first step towards achieving that goal where we restrict ourselves to simple sequential algorithms. We illustrate our ideas through several examples. Our work opens up a new approach to logic-based program synthesis not explored before.

关键词： Program synthesis Program transformation answer set programming Partial evaluation Symbolic execution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：