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

Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP

THEORY AND PRACTICE OF LOGIC programming 2018年第3-4期18卷 438-451页

作者： Dahlem, Marc Bhagyanath, Anoop Schneider, Klaus Insiders Technol GmbH Kaiserslautern Germany Univ Kaiserslautern Dept Comp Sci Kaiserslautern Germany

Conventional processor architectures are restricted in exploiting instruction level parallelism (ILP) due to the relatively low number of programmer-visible registers. Therefore, more recent processor architectures expose their datapaths so that the compiler (1) can schedule parallel instructions to different processing units and (2) can make effective use of local storage of the processing units. Among these architectures, the Synchronous Control Asynchronous Dataflow (SCAD) architecture is a new exposed datapath architecture whose processing units are equipped with first-in first-out (FIFO) buffers at their input and output ports. In contrast to register-based machines, the optimal code generation for SCAD is still a matter of research. In particular, SAT and SMT solvers were used to generate optimal resource constrained and optimal time constrained schedules for SCAD, respectively. As answer set programming (ASP) offers better flexibility in handling such scheduling problems, we focus in this paper on using an answer set solver for both resource and time constrained optimal SCAD code generation. As a major benefit of using ASP, we are able to generate all optimal schedules for a given program which allows one to study their properties. Furthermore, the experimental results of this paper demonstrate that the answer set solver can compete with SAT solvers and outperforms SMT solvers. This paper is under consideration for acceptance in TPLP.

关键词： answer set programming Exposed Datapath Architectures Optimal Scheduling Code Generation

来源：评论

学校读者我要写书评

暂无评论

Winning Snake: Design Choices in Multi-Shot ASP

引用

THEORY AND PRACTICE OF LOGIC programming 2024年第4期24卷 772-789页

作者： Boehl, Elisa Ellmauthaler, Stefan Gaggl, Sarah alice Tech Univ Dresden Logic Programming & Argumentat Dresden Germany Tech Univ Dresden ScaDS AI Cfaed Knowledge Based Syst Grp Dresden Germany

answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snake. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game's progress.

关键词： answer set programming multi-shot Hamiltonian cycles snakes

来源：评论

学校读者我要写书评

暂无评论

Module theorem for the general theory of stable models

引用

THEORY AND PRACTICE OF LOGIC programming 2012年第4-5期12卷 719-735页

作者： Babb, Joseph Lee, Joohyung Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85287 USA

The module theorem by Janhunen et al. demonstrates how to provide a modular structure in answer set programming, where each module has a well-defined input/output interface which can be used to establish the compositionality of answer sets. The theorem is useful in the analysis of answer set programs, and is a basis of incremental grounding and reactive answer set programming. We extend the module theorem to the general theory of stable models by Ferraris et al. The generalization applies to non-ground logic programs allowing useful constructs in answer set programming, such as choice rules, the count aggregate, and nested expressions. Our extension is based on relating the module theorem to the symmetric splitting theorem by Ferraris et al. Based on this result, we reformulate and extend the theory of incremental answer set computation to a more general class of programs.

关键词： answer set programming module theorem splitting theorem

来源：评论

学校读者我要写书评

暂无评论

Incremental and Iterative Learning of answer set Programs from Mutually Distinct Examples

引用

THEORY AND PRACTICE OF LOGIC programming 2018年第3-4期18卷 623-637页

作者： Mitra, Arindam Baral, Chitta Arizona State Univ Tempe AZ 85287 USA

Over the years the Artificial Intelligence (AI) community has produced several datasets which have given the machine learning algorithms the opportunity to learn various skills across various domains. However, a subclass of these machine learning algorithms that aimed at learning logic programs, namely the Inductive Logic programming algorithms, have often failed at the task due to the vastness of these datasets. This has impacted the usability of knowledge representation and reasoning techniques in the development of AI systems. In this research, we try to address this scalability issue for the algorithms that learn answer set programs. We present a sound and complete algorithm which takes the input in a slightly different manner and performs an efficient and more user controlled search for a solution. We show via experiments that our algorithm can learn from two popular datasets from machine learning community, namely bAbl (a question answering dataset) and MNIST (a dataset for handwritten digit recognition), whicYh to the best of our knowledge was not previously possible. The system is publicly available at https://***/KdWAcV.

关键词： Inductive Logic programming answer set programming Question answering Handwritten Digit Recognition Context Dependent Learning

来源：评论

学校读者我要写书评

暂无评论

Stable model semantics for founded bounds

引用

THEORY AND PRACTICE OF LOGIC programming 2013年第4-5期13卷 517-532页

作者： 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

来源：评论

学校读者我要写书评

暂无评论

A Translation-based Approach to the Verification of Modular Equivalence

引用

JOURNAL OF LOGIC AND COMPUTATION 2009年第4期19卷 591-613页

作者： Oikarinen, Emilia Janhunen, Tomi Aalto Univ Dept Informat & Comp Sci FI-02015 Helsinki Finland

The goal of this article is to foster modular program development in answer set programming using a Gaifman-Shapiro-style module architecture. More specifically, a method for verifying the equivalence of logic program modules is devised and proved correct. The idea is to adapt a translation-based verification technique, which was originally devised for complete programs only, for program modules. In addition, optimization strategies are addressed in order to exploit the modular structure of programs in verification tasks. A number of experiments on verification strategies are also conducted using lpeq which implements the verification method for the smodels system. The preliminary experimental results reported in this article suggest that the modularization of equivalence verification leads to potential time savings especially if the modules involved share a common context.

关键词： answer set programming modular program development compositionality of stable model semantics module theorem translation-based verification method

来源：评论

学校读者我要写书评

暂无评论

The DLVHEX system for knowledge representation: recent advances (system description)

引用

THEORY AND PRACTICE OF LOGIC programming 2016年第5-6期16卷 866-883页

作者： Redl, Christoph Vienna Univ Technol Inst Informat Syst Favoritenstr 9-11 A-1040 Vienna Austria

The DLVHEX system implements the hex-semantics, which integrates answer set programming (ASP) with arbitrary external sources. Since its first release ten years ago, significant advancements were achieved. Most importantly, the exploitation of properties of external sources led to efficiency improvements and flexibility enhancements of the language, and technical improvements on the system side increased user's convenience. In this paper, we present the current status of the system and point out the most important recent enhancements over early versions. While existing literature focuses on theoretical aspects and specific components, a bird's eye view of the overall system is missing. In order to promote the system for real-world applications, we further present applications which were already successfully realized on top of DLVHEX.

关键词： answer set programming Nonmonotonic Reasoning Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Towards Robust and Versatile Causal Discovery for Business Applications 16

Towards Robust and Versatile Causal Discovery for Business A...

引用

22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)

作者： Borboudakis, Giorgos Tsamardinos, Ioannis Univ Crete Dept Comp Sci Gnosis Data Anal IKE Iraklion Greece

ISBN: (纸本)9781450342322

Causal discovery algorithms can induce some of the causal relations from the data, commonly in the form of a causal network such as a causal Bayesian network. Arguably however, all such algorithms lack far behind what is necessary for a true business application. We develop an initial version of a new, general causal discovery algorithm called ETIO with many features suitable for business applications. These include (a) ability to accept prior causal knowledge (e.g., taking senior driving courses improves driving skills), (b) admitting the presence of latent confounding factors, (c) admitting the possibility of (a certain type of) selection bias in the data (e.g., clients sampled mostly from a given region), (d) ability to analyze data with missing-by-design (i.e., not planned to measure) values (e.g., if two companies merge and their databases measure different attributes), and (e) ability to analyze data from different interventions (e.g., prior and posterior to an advertisement campaign). ETIO is an instance of the logical approach to integrative causal discovery that has been relatively recently introduced and enables the solution of complex reverse-engineering problems in causal discovery. ETIO is compared against the state-of-the-art and is shown to be more effective in terms of speed, with only a slight degradation in terms of learning accuracy, while incorporating all the features above. The code is available on the *** website.

关键词： Causal Discovery Semi-Markov Causal Models Latent Variables Selection Bias Multiple Datasets Bayes-Ball Algorithm answer set programming Interventional Data

来源：评论

学校读者我要写书评

暂无评论

Exploiting conjunctive queries in description logic programs

Exploiting conjunctive queries in description logic programs

引用

10th International Symposium on Artificial Intelligence and Mathematics

作者： Eiter, Thomas Ianni, Giovambattista Krennwallner, Thomas Schindlauer, Roman Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria Univ Calabria Dipartimento Matemat I-87036 Arcavacata Di Rende CS Italy

Towards combining rules and ontologies for the Semantic Web, nonmonotonic Description Logic Programs (dl-programs) have been proposed as a powerful formalism to couple nonmonotonic logic programming and Description Logic reasoning on a clear semantic basis. In this paper, we present cq-programs, which enhance dl-programs with conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics knowledge bases, as well as with disjunctive rules. The novel formalism has two advantages. First, it offers increased expressivity because it allows for (U)CQs in the bodies of the rules. The (U)CQs allow one to access unnamed individuals in the rules and they increase the expressivity of the formalism, as evident from the increase in complexity from NEXP to 2-EXP. And second, when implemented as a combination between a logic programming system and a DL-reasoner, this integration of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner, by exploiting specific support for (U)CQs. To this end, we present equivalence preserving transformations which can be used for program rewriting, and we present respective generic rewriting algorithms. Experimental results for a cq-program prototype show that this can lead to significant performance improvements, and suggest that cq-programs and program rewriting provide a useful basis for dl- and cq-program optimization.

关键词： Hybrid rule languages Conjunctive queries and description logics answer set programming Semantic web

来源：评论

学校读者我要写书评

暂无评论

HEX PROGRAMS WITH ACTION ATOMS

HEX PROGRAMS WITH ACTION ATOMS

引用

26th International Conference on Logic programming (ICLP)

作者： Basol, Selen Erdem, Ozan Fink, Michael Ianni, Giovambattista Sabanci Univ Fac Engn & Nat Sci TR-34956 Istanbul Turkey TU Wien Inst Informat Syst A-1040 Vienna Austria Univ Calabria Dipartimento Matemat I-87036 Arcavacata Di Rende Italy

ISBN: (纸本)9783939897170

HEX programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectionally accessing external sources of knowledge and/or computation. The original framework, however, does not deal satisfactorily with stateful external environments: the possibility of predictably influencing external environments has thus not yet been considered explicitly. This paper lifts HEX programs to ACTHEX programs: ACTHEX programs introduce the notion of action atoms, which are associated to corresponding functions capable of actually changing the state of external environments. The execution of specific sequences of action atoms can be declaratively programmed. Furthermore, ACTHEX programs allow for selecting preferred actions, building on weights and corresponding cost functions. We introduce syntax and semantics of ACTHEX programs;ACTHEX programs can successfully be exploited as a general purpose language for the declarative implementation of executable specifications, which we illustrate by encodings of knowledge bases updates, action languages, and an agent programming language. A system capable of executing ACTHEX programs has been implemented and is publicly available.

关键词： answer set programming Logic programming interoperability Action languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：