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

Reasoning about actions with Temporal answer sets

THEORY AND PRACTICE OF LOGIC programming 2013年第02期13卷 201-225页

作者： Giordano, Laura Martelli, Alberto Dupre, Daniele Theseider Univ Piemonte Orientale Dipartimento Informat Alessandria Italy Univ Turin Dipartimento Informat I-10149 Turin Italy

In this paper, we combine answer set programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. The action language allows general DLTL formulas to be included in domain descriptions to constrain the space of possible extensions. We introduce a notion of Temporal answer set for domain descriptions, based on the usual notion of answer set. Also, we provide a translation of domain descriptions into standard ASP and use Bounded Model Checking (BMC) techniques for the verification of DLTL constraints.

关键词： answer set programming Temporal Logic Bounded Model Checking

来源：评论

学校读者我要写书评

暂无评论

Conflict-driven ASP solving with external sources

引用

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

作者： Eiter, Thomas Fink, Michael Krennwallner, Thomas Redl, Christoph Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

answer set programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. To enable access to external information, HEX-programs extend programs with external atoms, which allow for a bidirectional communication between the logic program and external sources of computation (e. g., description logic reasoners and Web resources). Current solvers evaluate HEX-programs by a translation to ASP itself, in which values of external atoms are guessed and verified after the ordinary answer set computation. This elegant approach does not scale with the number of external accesses in general, in particular in presence of nondeterminism (which is instrumental for ASP). In this paper, we present a novel, native algorithm for evaluating HEX-programs which uses learning techniques. In particular, we extend conflict-driven ASP solving techniques, which prevent the solver from running into the same conflict again, from ordinary to HEX-programs. We show how to gain additional knowledge from external source evaluations and how to use it in a conflict-driven algorithm. We first target the uninformed case, i.e., when we have no extra information on external sources, and then extend our approach to the case where additional meta-information is available. Experiments show that learning from external sources can significantly decrease both the runtime and the number of considered candidate compatible sets.

关键词： answer set programming nonmonotonic reasoning conflict-driven clause learning

来源：评论

学校读者我要写书评

暂无评论

Vicious Circle Principle and Logic Programs with Aggregates

引用

THEORY AND PRACTICE OF LOGIC programming 2014年第4-5期14卷 587-601页

作者： Gelfond, Michael Zhang, Yuanlin Texas Tech Univ Lubbock TX 79414 USA

The paper presents a knowledge representation language Alog which extends ASP with aggregates. The goal is to have a language based on simple syntax and clear intuitive and mathematical semantics. We give some propert... 详细信息

关键词： Aggregates answer set programming

来源：评论

学校读者我要写书评

暂无评论

Automating Semantic Analysis of System Assurance Cases Using Goal-Directed ASP

引用

THEORY AND PRACTICE OF LOGIC programming 2024年第4期24卷 805-824页

作者： Murugesan, Anitha Wong, Isaac Arias, Joaquin Stroud, Robert Varadarajan, Srivatsan Salazar, Elmer Gupta, Gopal Bloomfield, Robin Rushby, John Honeywell Aerosp Plymouth MN 55441 USA Univ Rey Juan Carlos CETINIA Madrid Spain Adelard Part NCC Grp London England Univ Texas Dallas Dallas TX USA City Univ London London England SRI Int Menlo Pk CA USA

Assurance cases offer a structured way to present arguments and evidence for certification of systems where safety and security are critical. However, creating and evaluating these assurance cases can be complex and challenging, even for systems of moderate complexity. Therefore, there is a growing need to develop new automation methods for these tasks. While most existing assurance case tools focus on automating structural aspects, they lack the ability to fully assess the semantic coherence and correctness of the assurance *** prior work, we introduced the Assurance 2.0 framework that prioritizes the reasoning process, evidence utilization, and explicit delineation of counter-claims (defeaters) and counter-evidence. In this paper, we present our approach to enhancing Assurance 2.0 with semantic rule-based analysis capabilities using common-sense reasoning and answer set programming solvers, specifically s(CASP). By employing these analysis techniques, we examine the unique semantic aspects of assurance cases, such as logical consistency, adequacy, indefeasibility, etc. The application of these analyses provides both system developers and evaluators with increased confidence about the assurance case.

关键词： automated assurance reasoning semantic analysis answer set programming

来源：评论

学校读者我要写书评

暂无评论

eclingo : A Solver for Epistemic Logic Programs

引用

THEORY AND PRACTICE OF LOGIC programming 2020年第6期20卷 834-847页

作者： Cabalar, Pedro Fandinno, Jorge Garea, Javier Romero, Javier Schaub, Torsten Univ A Coruna La Coruna Spain Univ Potsdam Potsdam Germany

We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the answer set programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. This process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.

关键词： answer set programming Epistemic Logic Programs Non-Monotonic Reasoning Conformant Planning

来源：评论

学校读者我要写书评

暂无评论

Reasoning support for risk prediction and prevention in independent living

引用

THEORY AND PRACTICE OF LOGIC programming 2011年第2-3期11卷 361-395页

作者： Mileo, A. Merico, D. Bisiani, R. Univ Milano Bicocca NOMADIS Res Lab Dept Informat Syst & Commun I-20126 Milan Italy

In recent years there has been a growing interest in solutions for the delivery of clinical care for the elderly because of the large increase in aging population. Monitoring a patient in his home environment is necessary to ensure continuity of care in home settings, but, to be useful, this activity must not be too invasive for patients and a burden for caregivers. We prototyped a system called Secure and IN Dependent lIving (SINDI), focused on (a) collecting a limited amount of data about the person and the environment through Wireless Sensor Networks (WSN), and (b) inferring from these data enough information to support caregivers in understanding patients' well-being and in predicting possible evolutions of their health. Our hierarchical logic-based model of health combines data from different sources, sensor data, tests results, common-sense knowledge and patient's clinical profile at the lower level, and correlation rules between health conditions across upper levels. The logical formalization and the reasoning process are based on answer set programming. The expressive power of this logic programming paradigm makes it possible to reason about health evolution even when the available information is incomplete and potentially incoherent, while declarativity simplifies rules specification by caregivers and allows automatic encoding of knowledge. This paper describes how these issues have been targeted in the application scenario of the SINDI system.

关键词： answer set programming wireless sensor networks independent living prediction context-awareness knowledge representation dependency graph

来源：评论

学校读者我要写书评

暂无评论

Specifying and Verbalising answer set Programs in Controlled Natural Language

引用

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

作者： Schwitter, Rolf Macquarie Univ Dept Comp Sydney NSW 2109 Australia

We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one;our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing.

关键词： Bi-directional grammars controlled natural languages answer set programming sentence planning executable specifications

来源：评论

学校读者我要写书评

暂无评论

A program-level approach to revising logic programs under the answer set semantics

引用

THEORY AND PRACTICE OF LOGIC programming 2010年第4-6期10卷 565-580页

作者： Delgrande, James P. Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

An approach to the revision of logic programs under the answer set semantics is presented. For programs P and Q, the goal is to determine the answer sets that correspond to the revision of P by Q, denoted P * Q. A fundamental principle of classical (AGM) revision, and the one that guides the approach here, is the success postulate. In AGM revision, this stipulates that alpha is an element of K * alpha. By analogy with the success postulate, for programs P and Q, this means that the answer sets of Q will in some sense be contained in those of P * Q. The essential idea is that for P * Q, a three-valued answer set for Q, consisting of positive and negative literals, is first determined. The positive literals constitute a regular answer set, while the negated literals make up a minimal set of naf literals required to produce the answer set from Q. These literals are propagated to the program P, along with those rules of Q that are not decided by these literals. The approach differs from work in update logic programs in two main respects. First, we ensure that the revising logic program has higher priority, and so we satisfy the success postulate;second, for the preference implicit in a revision P * Q, the program Q as a whole takes precedence over P, unlike update logic programs, since answer sets of Q are propagated to P. We show that a core group of the AGM postulates are satisfied, as are the postulates that have been proposed for update logic programs.

关键词： answer set programming belief change belief revision

来源：评论

学校读者我要写书评

暂无评论

Functional ASP with Intensional sets: Application to Gelfond-Zhang Aggregates

引用

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

作者： Cabalar, Pedro Fadinno, Jorge Del Cerro, Luis Farinas Pearce, David Univ A Coruna Dept Comp Sci Corunna Spain Univ Toulouse CNRS IRIT Toulouse France Univ Politecn Madrid Madrid Spain

In this paper, we propose a variant of answer set programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the syntax of First Order Logic with equality and the semantics of Quantified Equilibrium Logic with evaluable functions (QEL(F)(=)). Then, we proceed to incorporate a new kind of logical term, intensional set (a construct commonly used to denote the set of objects characterised by a given formula), and to extend QEL(F)(=) semantics for this new type of expression. In our extended approach, intensional sets can be arbitrarily used as predicate or function arguments or even nested inside other intensional sets, just as regular first-order logical terms. As a result, aggregates can be naturally formed by the application of some evaluable function (count, sum, maximum, etc) to a set of objects expressed as an intensional set. This approach has several advantages. First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the QEL(F)(=) interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction. Second, aggregates can be explicitly defined now within the logical language by the simple addition of formulas that fix their meaning in terms of multiple applications of some (commutative and associative) binary operation. For instance, we can use recursive rules to define sum in terms of integer addition. Last, but not least, we prove that the semantics we obtain for aggregates coincides with the one defined by Gelfond and Zhang for the Alog language, when we restrict to that syntactic fragment.

关键词： answer set programming Equilibrium Logic Partial Functions Aggregates

来源：评论

学校读者我要写书评

暂无评论

OntoDLV: An ASP-based System for Enterprise Ontologies

引用

JOURNAL OF LOGIC AND COMPUTATION 2009年第4期19卷 643-670页

作者： Ricca, Francesco Gallucci, Lorenzo Schindlauer, Roman Dell'Armi, Tina Grasso, Giovanni Leone, Nicola Univ Calabria Dept Math I-87036 Arcavacata Di Rende CS Italy Univ Calabria Exeura SRL I-87036 Arcavacata Di Rende CS Italy

Enterprise/Corporate ontologies are widely adopted to conceptualize business enterprise information. In this area, the semantic peculiarities of answer set programming (ASP), like the Closed World Assumption (CWA) and the Unique Name Assumption (UNA), are more appropriate than the OntologyWeb Language (OWL) assumptions, also because such ontologies frequently stem from relational databases, where both CWA and UNA are adopted. This article presents OntoDLV, a system based on ASP for the specification and reasoning on enterprise ontologies. OntoDLV implements a powerful ontology representation language, called OntoDLP, extending (disjunctive) ASP with all the main ontology features including classes, inheritance, relations and axioms. OntoDLP is strongly typed, and includes also complex type constructors, like lists and sets. Importantly, OntoDLV supports a powerful interoperability mechanism with OWL, allowing the user to retrieve information from OWL ontologies, and build rule-based reasoning on top of OWL ontologies. The system is already used in a number of real-world applications including agent-based systems, information extraction, and text classification.

关键词： Logic programming disjunctive logic programming answer set programming ontology languages enterprise ontologies OWL

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：