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

On the relation between SPARQL1.1 and answer set programming

Journal of Applied Non-Classical Logics 2013年第1-2期23卷 159-212页

In the context of the emerging Semantic Web and the quest for a common logical framework underpinning its architecture, the relation of rule-based languages such as answer set programming (ASP) and ontology languages such as the Web Ontology Language (OWL) has attracted a lot of attention in the literature over the past years. With its roots in Deductive Databases and Datalog though, ASP shares much more commonality with another Semantic Web standard, namely the Simple Protocol and RDF Query Language (SPARQL). In this paper, we take the recent approval of the SPARQL1.1 standard by the World Wide Web consortium (W3C) as an opportunity to introduce this standard to the Logic programming community by providing a translation of SPARQL1.1 into ASP. In this translation, we explain and highlight peculiarities of the new W3C standard. Along the way, we survey existing literature on foundations of SPARQL and SPARQL1.1, and also combinations of SPARQL with ontology and rules languages. Thereby, apart from providing the means to implement and support SPARQL natively within Logic programming engines and particularly ASP engines, we hope to pave the way for further research on a common logical framework for Semantic Web languages, including query languages, from an ASP point of view.

关键词： SPARQL Datalog answer set programming Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Repairing Boolean logical models from time-series data using answer set programming

引用

ALGORITHMS FOR MOLECULAR BIOLOGY 2019年第1期14卷 9-9页

作者： Lemos, Alexandre Lynce, Ines Monteiro, Pedro T. Univ Lisbon Inst Super Tecn INESC ID Rua Alves Redol 9 P-1000029 Lisbon Portugal

Background: Boolean models of biological signalling-regulatory networks are increasingly used to formally describe and understand complex biological processes. These models may become inconsistent as new data become available and need to be repaired. In the past, the focus has been shed on the inference of (classes of) models given an interaction network and time-series data sets. However, repair of existing models against new data is still in its infancy, where the process is still manually performed and therefore slow and prone to errors. Results: In this work, we propose a method with an associated tool to suggest repairs over inconsistent Boolean models, based on a set of atomic repair operations. answer set programming is used to encode the minimal repair problem as a combinatorial optimization problem. In particular, given an inconsistent model, the tool provides the minimal repairs that render the model capable of generating dynamics coherent with a (set of) time-series data set(s), considering either a synchronous or an asynchronous updating scheme. Conclusions: The method was validated using known biological models from different species, as well as synthetic models obtained from randomly generated networks. We discuss the method's limitations regarding each of the updating schemes and the considered minimization algorithm.

关键词： Biological regulatory networks Boolean functions Model repair (A)synchronous dynamics answer set programming

来源：评论

学校读者我要写书评

暂无评论

Fact-Checking Reasoning System for Fake Review Detection Using answer set programming

引用

ALGORITHMS 2021年第7期14卷 190页

作者： Jnoub, Nour Brankovic, Admir Klas, Wolfgang Univ Vienna Fac Comp Sci A-1090 Vienna Austria

A rising number of people use online reviews to choose if they want to use or buy a service or product. Therefore, approaches for identifying fake reviews are in high request. This paper proposes a hybrid rule-based fact-checking framework based on answer set programming (ASP) and natural language processing. The paper incorporates the behavioral patterns of reviewers combined with the qualitative and quantitative properties/features extracted from the content of their reviews. As a case study, we evaluated the framework using a movie review dataset, consisting of user accounts with their associated reviews, including the review title, content, and the star rating of the movie, to identify reviews that are not trustworthy and labeled them accordingly in the output. This output is then used in the front end of a movie review platform to tag reviews as fake and show their sentiment. The evaluation of the proposed approach showed promising results and high flexibility.

关键词： online fake review detection answer set programming fact checking

来源：评论

学校读者我要写书评

暂无评论

Reasoning About Policies in Security-Aware Service Discovery Using answer set programming

引用

INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS 2016年第1期25卷 1650003-1650003页

作者： Asuncion, Vernon Khan, Khaled M. Erradi, Abdelkarim Alhazbi, Saleh Qatar Univ Coll Engn KINDI Comp Res Lab Dept Comp Sci & Engn POB 2713 Doha Qatar

In order to enable a secure interaction between dynamically discovered software services and the client's application in a cooperative information system such as service oriented system, one of the pre-requisites is the reconciliation of service-specific security policies of all stakeholders. Existing service discovery research does not address the issue of enormous search space in finding security-aware services based on preferred security policy alternatives of the client of software services. In this paper, we propose an answer set programming (ASP) approach, drawn from the field of artificial intelligence (AI), to explore a viable solution of finding security-aware services for the client. We argue that the ASP approach can significantly reduce the search space and achieve great performance gains. We use ASP to: (i) specify security policies including expressing service-specific security preference weighting and importance scoring in quantifiable terms;and (ii) reason about the compliance between the security policies of the client and the software service.

关键词： Software services answer set programming security policy reasoning policy compliance

来源：评论

学校读者我要写书评

暂无评论

Dealing with Biology Systems in the Framework of answer set programming

引用

Procedia Computer Science 2020年 176卷 450-459页

作者： Tarek Khaled Belaid Benhamou Aix Marseille University University of Toulon CNRS LIS Marseille France

Reasoning about gene networks is essential from various perspectives, such as predicting side effects of drugs or explaining unusual cellular behavior. Because of the massive size of these gene networks, a biologist can only work on a small part of the network. Thus, there is an essential requirement for logical representations and automated reasoning on such networks to help biologists to understand genetic interactions. However, the knowledge about gene networks is always incomplete and sometimes not accurate. Hence, knowledge has to be continuously revised and extended. In this work, we propose an approach based on non-monotonic logic programming, and the framework of answer set programming(ASP), to represent and handle gene networks. We show how to model reasoning, predict events, and explain observations in gene networks. Finally, we show how our approach is applied to represent and resolve the DNA double-strand breaks, which is one of the most severe genomic lesions.

关键词： answer set programming Logic programming Stable Models Bioinformatics Gene Networks Knowledge Representation

来源：评论

学校读者我要写书评

暂无评论

ASP (): answer set programming with Algebraic Constraints

引用

Theory and Practice of Logic programming 2020年第6期20卷 895-910页

作者： THOMAS EITER RAFAEL KIESEL Technical University Vienna Vienna Austria (e-mail: thomas.eiter@tuwien.ac.at rafael.kiesel@tuwien.ac.at)

Weighted Logic is a powerful tool for the specification of calculations over semirings that depend on qualitative information. Using a novel combination of Weighted Logic and Here-and-There (HT) Logic, in which this dependence is based on intuitionistic grounds, we introduce answer set programming with Algebraic Constraints (ASP($\mathcal A \mathcal C$)), where rules may contain constraints that compare semiring values to weighted formula evaluations. Such constraints provide streamlined access to a manifold of constructs available in ASP, like aggregates, choice constraints, and arithmetic operators. They extend some of them and provide a generic framework for defining programs with algebraic computation, which can be fruitfully used e.g. for provenance semantics of datalog programs. While undecidable in general, expressive fragments of ASP($\mathcal A \mathcal C$) can be exploited for effective problem solving in a rich framework.

关键词： Weighted Logic Here-and-There Logic answer set programming Constraints

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling in parallel answer set programming solvers 07

Dynamic scheduling in parallel answer set programming solver...

引用

Proceedings of the 2007 spring simulation multiconference - Volume 2

作者： Hung Viet Le Enrico Pontelli New Mexico State University

ISBN: (纸本)9781565553132

The paper describes an experimental analysis of dynamic scheduling strategies for a novel logic programming paradigm---answer set programming. The work identifies a collection of policies to classify variations of centralized and decentralized scheduling schemes, and develops adaptive solutions in the context of a decentralized dynamic scheduling. The resulting techniques have been integrated in a state-of-the-art parallel solver, with excellent performance results.

关键词： parallel computing answer set programming scheduling non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Sketched answer set programming 30

Sketched Answer Set Programming

引用

30th IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Paramonov, Sergey Bessiere, Christian Dries, Anton De Raedt, Luc Katholieke Univ Leuven Leuven Belgium CNRS LIRMM Montpellier France

ISBN: (纸本)9781538674499

answer set programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models can be hard. We propose a novel method, called Sketched answer set programming (SkASP), aimed at facilitating this. In SkASP, the user writes partial ASP programs, in which uncertain parts are left open and marked with question marks. In addition, the user provides a number of positive and negative examples of the desired program behaviour. SkASP then synthesises a complete ASP program. This is realized by rewriting the SkASP program into another ASP program, which can then be solved by traditional ASP solvers. We evaluate our approach on 21 well known puzzles and combinatorial problems inspired by Karps 21 NP-complete problems and on publicly available ASP encodings.

关键词： inductive logic programming constraint learning answer set programming sketching constraint programming relational learning

来源：评论

学校读者我要写书评

暂无评论

Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge 10

Using answer set programming to model multi-agent scenarios ...

引用

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

作者： Chitta Baral Gregory Gelfond Tran Cao Son Enrico Pontelli Arizona State University Tempe AZ New Mexico State University Las Cruces NM

ISBN: (纸本)9780982657119

One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to take it into account when planning and acting. In the past this has been done using modal and dynamic epistemic logics. In this paper we explore the use of answer set programming (ASP), and reasoning about action techniques for this purpose. These approaches present a number of theoretical and practical advantages. From the theoretical perspective, ASP's property of non-monotonicity (and several other features) allow us to express causality in an elegant fashion. From the practical perspective, recent implementations of ASP solvers have become very efficient, outperforming several other systems in recent SAT competitions. Finally, the use of ASP and reasoning about action techniques allows for the adaptation of a large body of research developed for single-agent to multi-agent domains. We begin our discussion by showing how ASP can be used to find Kripke models of a modal theory. We then illustrate how both the muddy children, and the sum-and-product problems can be represented and solved using these concepts. We describe and implement a new kind of action, which we call "ask-and-truthfully-answer," and show how this action brings forth a new dimension to the muddy children problem.

关键词： reasoning about actions answer set programming

来源：评论

学校读者我要写书评

暂无评论

CSP Bounded Model Checking of Preprocessed CTL extended with Events using answer set programming

CSP Bounded Model Checking of Preprocessed CTL extended with...

引用

Asia-Pacific Software Engineering Conference

作者： Lingyun Situ Lingzhong Zhao State Key Laboratory of Novel Computer Software Technology Nanjing University School of Computer Science and Engineering Guilin University of Electronic Technology

ISBN: (纸本)9781467396455

Model checking is a mainstream method for formal verification of communicating sequential processes (CSP). Existing CSP Model Checkers are incapable of verifying multiple properties concurrently in one run of a model checker. In addition, the properties to be verified are described with CSP in most model checkers, which is good for refinement checking, but leads to limited description power and weak generality. In order to tackle the two problems, answer set programming (ASP), which is completely free of sequential dependencies, is used to construct a CSP bounded model checking framework, where the CSP model checking problem is turned into a computation problem of answer sets. CTL is extended with events to describe the properties to be verified. In addition, preprocessing technique of properties is proposed for the sake of reducing the expense spending on replicated verification of the same sub formulas. An ASP based description system is constructed for complete description of various CSP processes and automatic generation of parallel processes. We integrated all the methods into a CSP model checker - ACSPChecker. The feasibility and efficiency of our methods are illustrated by the experiments with a classic concurrency problem - dining philosophers problem.

关键词： Communicating Sequential Processes Bounded Model Checking CTL Preprocess answer set programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：