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

24th International Conference on Logic programming (ICLP)

作者： Cabalar, Pedro Univ A Coruna Dept Comp Sci Corunna Spain

In this paper we propose an extension of answer set programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL(F)(=) where the set of functions is partitioned into Herbrand functions (or constructors) and evaluable functions (or operations). We show how this extension has a direct connection to Scott's Logic of Existence, and introduce several useful derived operators, some of them directly borrowed from Scott's formalisation. Using this general framework for arbitrary theories, we proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality. We provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally, we also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.

关键词： answer set programming equilibrium logic partial functions functional logic programming

来源：评论

学校读者我要写书评

暂无评论

Declarative Sequential Pattern Mining of Care Pathways 16th

Declarative Sequential Pattern Mining of Care Pathways

引用

16th Conference on Artificial Intelligence in Medicine (AIME)

作者： Guyet, Thomas Happe, Andre Dauxais, Yann AGROCAMPUS OUEST IRISA UMR6074 Rennes France CHRU Brest EA REPERES 7449 Paris France Rennes Univ 1 IRISA UMR6074 Rennes France

ISBN: (纸本)9783319597584;9783319597577

Sequential pattern mining algorithms are widely used to explore care pathways database, but they generate a deluge of patterns, mostly redundant or useless. Clinicians need tools to express complex mining queries in order to generate less but more significant patterns. These algorithms are not versatile enough to answer complex clinician queries. This article proposes to apply a declarative pattern mining approach based on answer set programming paradigm. It is exemplified by a pharmaco-epidemiological study investigating the possible association between hospitalization for seizure and antiepileptic drug switch from a french medico-administrative database.

关键词： answer set programming Epidemiology Medico-administrative databases Patient care pathways

来源：评论

学校读者我要写书评

暂无评论

Extending answer set Programs with Interpreted Functions as First-Class Citizens 19th

Extending Answer Set Programs with Interpreted Functions as ...

引用

19th International Symposium on Practical Aspects of Declarative Languages (PADL)

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

ISBN: (纸本)9783319516769;9783319516752

answer set programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs. Existing approaches towards integrating function terms into ASP can be organized in two classes: uninterpreted function symbols and interpreted functions;we focus on the latter. Existing approaches usually define interpreted functions in the program (e.g. using term equations), while evaluation wrt. to a pre-existing external semantics is neglected. However, this is useful if existing function libraries shall be accessed or if a function is more naturally implemented in procedural code. In this paper, we propose the declarative language of hex ifu - programs which extends answer set programs (ASP) with such interpreted functions. However, rather than just providing a means for evaluating functions, it further turns interpreted functions into first-class citizens, i.e., functions are represented by accessible objects in the program. This paves the way for functionals (higher-order functions), i.e., functions that take other functions as arguments or return them. We provide then a rewriting of such programs to hex-programs, an extension of ASP with external sources, and an implementation based on this rewriting. Afterwards we present applications which motivated our work, e.g. the adoption of design pattern from software engineering. Finally, we discuss properties of the formalism and differences to related work.

关键词： answer set programming Nonmonotonic reasoning FLP semantics Function symbols

来源：评论

学校读者我要写书评

暂无评论

Applying answer set programming to Points-to Analysis of Object-Oriented Language

Applying Answer Set Programming to Points-to Analysis of Obj...

引用

7th International Conference on Intelligent Computing (ICIC)

作者： Yang, Bo Zhang, Mingyi Zhang, Ying Guizhou Univ Coll Comp Sci & Informat Guiyang 550003 Peoples R China Guiyang Univ Dept Phys & Electron Informat Guiyang Peoples R China Guizhou Acad Sci Guiyang Peoples R China

ISBN: (纸本)9783642247279

Points-to information is essential in software engineering, including compiler optimization, instruction-level parallelism, program verification, and so on. The propagating of points-to information along paths of a program can be viewed as the "frame problem" in a dynamic world. As a primary knowledge representing and reasoning tool in Artificial Intelligence, answer set programming (ASP) provides a natural and concise way to express the frame problem. We present a collection of ASP rules to model the propagating of points-to information along paths of an object-oriented program. With these rules and basic facts of a program. points-to information at each program point can be computed easily. This makes it possible to acquire useful information for program analysis through existing ASP solvers.

关键词： answer set programming knowledge representing and reasoning points-to analysis object-oriented language

来源：评论

学校读者我要写书评

暂无评论

A New Tree-Decomposition Based Algorithm for answer set programming

A New Tree-Decomposition Based Algorithm for Answer Set Prog...

引用

23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Morak, Michael Musliu, Nysret Pichler, Reinhard Ruemmele, Stefan Woltran, Stefan Vienna Univ Technol Inst Informat Syst Vienna Austria

A promising approach to tackle intractable problems is given by combining decomposition methods with dynamic programming algorithms. One such decomposition concept is tree decomposition. In this paper, we provide a ne... 详细信息

ISBN: (纸本)9780769545967

关键词： Artificial intelligence Conferences answer set programming answer set programming computability dynamic programming dynamic programming dynamic programming inference mechanisms intractable problems reasoning problems tree decomposition tree-decomposition

来源：评论

学校读者我要写书评

暂无评论

answer set Programs with Queries over Subprograms 14th

Answer Set Programs with Queries over Subprograms

引用

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

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

ISBN: (纸本)9783319616605;9783319616599

answer-set programming (ASP) is a declarative programming paradigm. In this paper we discuss two related restrictions and present a novel modeling technique to overcome them: (1) Meta-reasoning about the collection of answer sets of a program is in general only possible by external postprocessing, but not within the program. This prohibits the direct continuation of reasoning based on the answer to the query over a (sub) program's answer sets. (2) The saturation programming technique exploits the minimality criterion for answer sets of a disjunctive ASP program to solve co-NP-hard problems, which typically involve checking if a property holds for all objects in a certain domain. However, the technique is advanced and not easily applicable by average ASP users;moreover, the use of default-negation within saturation encodings is limited. In this paper, we present an approach which allows for brave and cautious query answering over normal subprograms within a disjunctive program in order to address restriction (1). The query answer is represented by a dedicated atom within each answer set of the overall program, which paves the way also for a more intuitive alternative to saturation encodings and allows also using default-negation within such encodings, which addresses restriction (2).

关键词： answer set programming Nonmonotonic reasoning FLP semantics Meta programming Saturation

来源：评论

学校读者我要写书评

暂无评论

External Computations and Interoperability in the New DLV Grounder 16th

External Computations and Interoperability in the New DLV Gr...

引用

16th International Conference of the Italian Association for Artificial Intelligence (AI*IA)

作者： Calimeri, Francesco Fusca, Davide Perri, Simona Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy DLVSystem Srl Arcavacata Di Rende Italy

ISBN: (纸本)9783319701691;9783319701684

In this paper we focus on some of the most recent advancements in I-DLV, the new intelligent grounder of DLV;the system has been endowed with means aimed at easing the interoperability and integration with external systems and accommodating external source of computation and value invention within ASP programs. In particular, we describe here the support for external computations via explicit calls to Python scripts, and tools for the interoperability with both relational and graph databases.

关键词： Knowledge representation and reasoning answer set programming DLV Artificial Intelligence Deductive database systems Grounding Instantiation

来源：评论

学校读者我要写书评

暂无评论

Application of answer set programming for Public Health Data Integration and Analysis

Application of Answer Set Programming for Public Health Data...

引用

IFIP WG 8.4/8.9 International Cross Domain Conference on Multidisciplinary Research and Practice for Business, Enterprise and Health Information Systems (ARES)

作者： Nogueira, Monica L. Greis, Noel P. Univ N Carolina Kenan Flagler Business Sch Ctr Logist & Digital Strategy Chapel Hill NC 27713 USA

ISBN: (纸本)9783642232992;9783642233005

Public health surveillance systems routinely process massive volumes of data to identify health adverse events affecting the general population. Surveillance and response to foodborne disease suffers from a number of systemic and other delays that hinder early detection and confirmation of emerging contamination situations. In this paper we develop an answer set programming (ASP) application to assist public health officials in detecting an emerging foodborne disease outbreak by integrating and analyzing in near real-time temporally, spatially and symptomatically diverse data. These data can be extracted from a large number of distinct information systems such as surveillance and laboratory reporting systems from health care providers, real-time complaint hotlines from consumers, and inspection reporting systems from regulatory agencies. We encode geographic ontologies in ASP to infer spatial relationships that may not be evident using traditional statistical tools. These technologies and ontologies have been implemented in a new informatics tool, the North Carolina Foodborne Events Data Integration and Analysis Tool (NCFEDA). The application was built to demonstrate the potential of situational awareness-created through real-time data fusion, analytics, visualization, and real-time communication-to reduce latency of response to foodborne disease outbreaks by North Carolina public health personnel.

关键词： data integration answer set programming public health food safety ontology

来源：评论

学校读者我要写书评

暂无评论

Automatic music composition using answer set programming

Automatic music composition using answer set programming

引用

24th International Conference on Logic programming (ICLP)

作者： Boenn, Georg Brain, Martin De Vos, Marina Ffitch, John Univ Glamorgan Cardiff Sch Creat & Cultural Ind Pontypridd CF37 1DL M Glam Wales Univ Bath Dept Comp Sci Bath BA2 7AY Avon England

Music composition used to be a pen and paper activity. These days music is often composed with the aid of computer software, even to the point where the computer composes parts of the score autonomously. The composition of most styles of music is governed by rules. We show that by approaching the automation, analysis and verification of composition as a knowledge representation task and formalising these rules in a suitable logical language, powerful and expressive intelligent composition tools can be easily built. This application paper describes the use of answer set programming to construct an automated system, named Anton, that can compose melodic, harmonic and rhythmic music, diagnose errors in human compositions and serve as a computer-aided composition tool. The combination of harmonic, rhythmic and melodic composition in a single framework makes Anton unique in the growing area of algorithmic composition. With near real-time composition, Anton reaches the point where it can not only be used as a component in an interactive composition tool but also has the potential for live performances and concerts or automatically generated background music in a variety of applications. With the use of a fully declarative language and an "off-the-shelf" reasoning engine, Anton provides the human composer a tool which is significantly simpler, more compact and more versatile than other existing systems.

关键词： answer set programming Applications of ASP Music composition Algorithmic composition Harmonic and melodic composition Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming

引用

BIOSYSTEMS 2016年 149卷 139-153页

作者： Ostrowski, M. Pauleve, L. Schaub, T. Siegel, A. Guziolowski, C. Univ Potsdam Potsdam Germany INRIA Rennes France Univ Paris Sud LRI UMR 8623 CNRS Orsay France Univ Rennes 1 CNRS IRISA UMR 6074 Rennes France CNRS IRCCyN UMR 6597 Ecole Cent Nantes Nantes France

Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use answer set programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks;for a larger case study, our method provides optimal answers after 7 min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. (C) 2016 Elsevier Ireland Ltd. All rights reserved.

关键词： Model identification Time series data Multiplex phosphoproteomics data Boolean networks answer set programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：