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

Logic programming approaches for routing fault-free and maximally parallel wavelength-routed optical networks-on-chip (Application paper)

引用

THEORY AND PRACTICE OF LOGIC programming 2017年第5-6期17卷 800-818页

作者： Gavanelli, Marco Nonato, Maddalena Peano, Andrea Bertozzi, Davide Ferrara Univ Dept Engn Ferrara Italy QuanTek Bologna Italy

One promising trend in digital system integration consists of boosting on-chip communication performance by means of silicon photonics, thus materializing the so-called Optical Networkson- Chip. Among them, wavelength routing can be used to route a signal to destination by univocally associating a routing path to the wavelength of the optical carrier. Such wavelengths should be chosen so to minimize interferences among optical channels and to avoid routing faults. As a result, physical parameter selection of such networks requires the solution of complex constrained optimization problems. In previous work, published in the proceedings of the International Conference on Computer-Aided Design, we proposed and solved the problem of computing the maximum parallelism obtainable in the communication between any two endpoints while avoiding misrouting of optical signals. The underlying technology, only quickly mentioned in that paper, is answer set programming. In this work, we detail the answer set programming approach we used to solve such problem. Another important design issue is to select the wavelengths of optical carriers such that they are spread across the available spectrum, in order to reduce the likelihood that, due to imperfections in the manufacturing process, unintended routing faults arise. We show how to address such problem in Constraint Logic programming on Finite Domains.

关键词： answer set programming Logic programming applications Optical networks-on-chip Constrained optimization Constraint logic programming on finite domains

来源：评论

学校读者我要写书评

暂无评论

answer set programming for Procedural Content Generation: A Design Space Approach

引用

IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES 2011年第3期3卷 187-200页

作者： Smith, Adam M. Mateas, Michael Univ Calif Santa Cruz Dept Comp Sci Santa Cruz CA 95064 USA

Procedural content generators for games produce artifacts from a latent design space. This space is often only implicitly defined, an emergent result of the procedures used in the generator. In this paper, we outline an approach to content generation that centers on explicit description of the design space, using domain-independent procedures to produce artifacts from the described space. By concisely capturing a design space as an answer set program, we can rapidly define and expressively sculpt new generators for a variety of game content domains. We walk through the reimplementation of a reference evolutionary content generator in a tutorial example, and review existing applications of answer set programming to generative-content design problems in and outside of a game context.

关键词： answer set programming constraint programming game design logic programming procedural content generation

来源：评论

学校读者我要写书评

暂无评论

answer set programming: A Declarative Approach to Solving Challenging Search Problems

Answer Set Programming: A Declarative Approach to Solving Ch...

引用

41st IEEE International Symposium on Multiple-Valued Logic (ISMVL)

作者： Niemela, Ilkka Aalto Univ Dept Informat & Comp Sci FI-00076 Aalto Finland

ISBN: (纸本)9780769544052

answer set programming (ASP) is a declarative programming paradigm targeted to solving search problems. The basic idea of ASP is similar to, for example, SAT-based planning or constraint satisfaction problems but ASP provides a more powerful knowledge representation language for effective problem encoding. A number of successful ASP systems have already been developed and applied in a large range of areas. The talk explains the theoretical underpinnings of ASP, introduces the answer set programming paradigm, outlines computational techniques used in current ASP solvers, and discusses some interesting applications of the approach.

关键词： answer set programming constraint satisfaction propositional satisfiability search problems

来源：评论

学校读者我要写书评

暂无评论

Logic programming approaches for routing fault-free and maximally parallel wavelength-routed optical networks-on-chip (Application paper)

Logic programming approaches for routing fault-free and maxi...

引用

33rd International Conference on Logic programming colocated with the 23rd International Conference on Principles and Practice of Constraint programming / 20th International Conference on Theory and Applications of Satisfiability Testing

作者： Gavanelli, Marco Nonato, Maddalena Peano, Andrea Bertozzi, Davide Ferrara Univ Dept Engn Ferrara Italy QuanTek Bologna Italy

关键词： answer set programming Logic programming applications Optical networks-on-chip Constrained optimization Constraint logic programming on finite domains

来源：评论

学校读者我要写书评

暂无评论

Relational data factorization

引用

MACHINE LEARNING 2017年第12期106卷 1867-1904页

作者： Paramonov, Sergey van Leeuwen, Matthijs De Raedt, Luc Katholieke Univ Leuven Machine Learning Dept Comp Sci Leuven Belgium Leiden Univ Leiden Inst Adv Comp Sci Leiden Netherlands

Motivated by an analogy with matrix factorization, we introduce the problem of factorizing relational data. In matrix factorization, one is given a matrix and has to factorize it as a product of other matrices. In relational data factorization, the task is to factorize a given relation as a conjunctive query over other relations, i.e., as a combination of natural join operations. Given a conjunctive query and the input relation, the problem is to compute the extensions of the relations used in the query. Thus, relational data factorization is a relational analog of matrix factorization;it is also a form of inverse querying as one has to compute the relations in the query from the result of the query. The result of relational data factorization is neither necessarily unique nor required to be a lossless decomposition of the original relation. Therefore, constraints can be imposed on the desired factorization and a scoring function is used to determine its quality (often similarity to the original data). Relational data factorization is thus a constraint satisfaction and optimization problem. We show how answer set programming can be used for solving relational data factorization problems.

关键词： answer set programming Inductive logic programming Pattern mining Relational data Factorization Data mining Declarative modeling

来源：评论

学校读者我要写书评

暂无评论

CASP solutions for planning in hybrid domains

引用

THEORY AND PRACTICE OF LOGIC programming 2017年第4期17卷 591-633页

作者： Balduccini, Marcello Magazzeni, Daniele Maratea, Marco Leblanc, Emily C. St Josephs Univ Dept Decis & Support Serv 5600 City Ave Philadelphia PA 19131 USA Kings Coll London Dept Informat London WC2R 2LS England Univ Genoa Genoa Italy Drexel Univ Dept Comp Sci 3141 Chestnut Ave Philadelphia PA 19104 USA

Constraint answer set programming (CASP) is an extension of answer set programming that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the ezcsp CASP solver in order to solve CASP programs arising from PDDL+ domains. An experimental analysis, performed on well-known linear and non-linear variants of PDDL+ domains, involving various configurations of the ezcsp solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution.

关键词： answer set programming planning hybrid domains

来源：评论

学校读者我要写书评

暂无评论

Infinitary equilibrium logic and strongly equivalent logic programs

引用

ARTIFICIAL INTELLIGENCE 2017年 246卷 22-33页

作者： Harrison, Amelia Lifschitz, Vladimir Pearce, David Valverde, Agustin Univ Texas Austin Austin TX 78712 USA Univ Politecn Madrid Madrid Spain Univ Malaga Malaga Spain

Strong equivalence is an important concept in the theory of answer set programming. Informally speaking, two sets of rules are strongly equivalent if they have the same meaning in any context. Equilibrium logic was used to prove that sets of rules expressed as propositional formulas are strongly equivalent if and only if they are equivalent in the logic of here-and-there. We extend this line of work to formulas with infinitely long conjunctions and disjunctions, show that the infinitary logic of here-and-there characterizes strong equivalence of infinitary formulas, and give an axiomatization of that logic. This is useful because of the relationship between infinitary formulas and logic programs with local variables. (C) 2017 Elsevier B.V. All rights reserved.

关键词： answer set programming Strong equivalence Logic of here-and-there

来源：评论

学校读者我要写书评

暂无评论

Constraints on signaling network logic reveal functional subgraphs on Multiple Myeloma OMIC data

引用

BMC SYSTEMS BIOLOGY 2018年第3-Sup期12卷 32-32页

作者： Miannay, Bertrand Minvielle, Stephane Magrangeas, Florence Guziolowski, Carito Ecole Cent Nantes LS2N UMR 6004 Nantes France Univ Nantes Univ Angers CNRS INSERMCRCINA Nantes France

Background: The integration of gene expression profiles (GEPs) and large-scale biological networks derived from pathways databases is a subject which is being widely explored. Existing methods are based on network distance measures among significantly measured species. Only a small number of them include the directionality and underlying logic existing in biological networks. In this study we approach the GEP-networks integration problem by considering the network logic, however our approach does not require a prior species selection according to their gene expression level. Results: We start by modeling the biological network representing its underlying logic using Logic programming. This model points to reachable network discrete states that maximize a notion of harmony between the molecular species active or inactive possible states and the directionality of the pathways reactions according to their activator or inhibitor control role. Only then, we confront these network states with the GEP. From this confrontation independent graph components are derived, each of them related to a fixed and optimal assignment of active or inactive states. These components allow us to decompose a large-scale network into subgraphs and their molecular species state assignments have different degrees of similarity when compared to the same GEP. We apply our method to study the set of possible states derived from a subgraph from the NCI-PID Pathway Interaction Database. This graph links Multiple Myeloma (MM) genes to known receptors for this blood cancer. Conclusion: We discover that the NCI-PID MM graph had 15 independent components, and when confronted to 611 MM GEPs, we find 1 component as being more specific to represent the difference between cancer and healthy profiles.

关键词： answer set programming Regulatory network modeling Omic data integration

来源：评论

学校读者我要写书评

暂无评论

ASPeRiX, a first-order forward chaining approach for answer set computing

引用

THEORY AND PRACTICE OF LOGIC programming 2017年第3期17卷 266-310页

作者： Lefevre, Claire Beatrix, Christopher Stephan, Igor Garcia, Laurent Univ Angers LERIA 2 Blvd Lavoisier F-49045 Angers 01 France

The natural way to use answer set programming (ASP) to represent knowledge in Artificial Intelligence or to solve a combinatorial problem is to elaborate a first-order logic program with default negation. In a preliminary step, this program with variables is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they exist) one or many answer sets (stable models) of the program, each answer set encoding one solution of the initial problem. Until today, almost all ASP systems apply this two steps computation. In this article, the project ASPeRiX is presented as a first-order forward chaining approach for answer set Computing. This project was among the first to introduce an approach of answer set computing that escapes the preliminary phase of rule instantiation by integrating it in the search process. The methodology applies a forward chaining of first-order rules that are grounded on the fly by means of previously produced atoms. Theoretical foundations of the approach are presented, the main algorithms of the ASP solver ASPeRiX are detailed and some experiments and comparisons with existing systems are provided.

关键词： answer set programming solver implementation grounding on the fly first order forward chaining

来源：评论

学校读者我要写书评

暂无评论

Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

引用

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2017年第4期18卷 1–42页

作者： Calautti, Marco Greco, Sergio Trubitsyna, Irina Univ Edinburgh Informat Forum 10 Crichton St Edinburgh EH8 9AB Midlothian Scotland Univ Calabria DIMES Via P Bucci I-87036 Arcavacata Di Rende CS Italy

In this article, we propose a new technique for checking whether the bottom-up evaluation of logic programs with function symbols terminates. The technique is based on the definition of mappings from arguments to strings of function symbols, representing possible values which could be taken by arguments during the bottom-up evaluation. Starting from mappings, we identify mapping-restricted arguments, a subset of limited arguments, namely arguments that take values from finite domains. Mapping-restricted programs, consisting of rules whose arguments are all mapping restricted, are terminating under the bottom-up computation, as all of its arguments take values from finite domains. We show that mappings can be computed by transforming the original program into a unary logic program: this allows us to establish decidability of checking if a program is mapping restricted. We study the complexity of the presented approach and compare it to other techniques known in the literature. We also introduce an extension of the proposed approach that is able to recognize a wider class of logic programs. The presented technique provides a significant improvement, as it can detect terminating programs not identified by other criteria proposed so far. Furthermore, it can be combined with other techniques to further enlarge the class of programs recognized as terminating under the bottom-up evaluation.

关键词： answer set programming function symbols bottom-up evaluation program termination computational complexity stable models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：