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

Positive Dependency Graphs Revisited

THEORY AND PRACTICE OF LOGIC programming 2023年第5期23卷 1128-1137页

作者： Fandinno, Jorge Lifschitz, Vladimir Univ Nebraska Omaha NE 68182 USA Univ Texas Austin Austin TX 78712 USA

Theory of stable models is the mathematical basis of answer set programming. Several results in that theory refer to the concept of the positive dependency graph of a logic program. We describe a modification of that concept and show that the new understanding of positive dependency makes it possible to strengthen some of these results.

关键词： answer set programming stable models completion splitting loop formulas

来源：评论

学校读者我要写书评

暂无评论

Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems

引用

THEORY AND PRACTICE OF LOGIC programming 2022年第4期22卷 606-622页

作者： Tarzariol, Alice Schekotihin, Konstantin Gebser, Martin Law, Mark Univ Klagenfurt Klagenfurt Austria Graz Univ Technol Graz Austria Imperial Coll London London England

Many industrial applications require finding solutions to challenging combinatorial problems. Efficient elimination of symmetric solution candidates is one of the key enablers for high-performance solving. However, existing model-based approaches for symmetry breaking are limited to problems for which a set of representative and easily solvable instances is available, which is often not the case in practical applications. This work extends the learning framework and implementation of a model-based approach for answer set programming to overcome these limitations and address challenging problems, such as the Partner Units Problem. In particular, we incorporate a new conflict analysis algorithm in the Inductive Logic programming system ILASP, redefine the learning task, and suggest a new example generation method to scale up the approach. The experiments conducted for different kinds of Partner Units Problem instances demonstrate the applicability of our approach and the computational benefits due to the first-order constraints learned.

关键词： answer set programming inductive logic programming symmetry breaking constraints

来源：评论

学校读者我要写书评

暂无评论

A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders

引用

THEORY AND PRACTICE OF LOGIC programming 2021年第1期21卷 80-124页

作者： Calimeri, Francesco Cauteruccio, Francesco Cinelli, Luca Marzullo, Aldo Stamile, Claudio Terracina, Giorgio Durand-Dubief, Francoise Sappey-Marinier, Dominique Univ Calabria DEMACS Calabria Italy CREATIS Paris France CNRS UMR5220 Paris France INSERM U1206 Paris France Univ Lyon 1 Univ Lyon INSA Lyon Villeurbanne France Hosp Civils Lyon Hop Neurol Serv Neurol Bron France Univ Lyon CERMEP Imagerie Vivant Bron France

Deductive formalisms have been strongly developed in recent years;among them, answer set programming (ASP) gained some momentum and has been lately fruitfully employed in many real-world scenarios. Nonetheless, in spite of a large number of success stories in relevant application areas, and even in industrial contexts, deductive reasoning cannot be considered the ultimate, comprehensive solution to artificial intelligence;indeed, in several contexts, other approaches result to be more useful. Typical bioinformatics tasks, for instance classification, are currently carried out mostly by machine learning (ML)-based solutions. In this paper, we focus on the relatively new problem of analyzing the evolution of neurological disorders. In this context, ML approaches already demonstrated to be a viable solution for classification tasks;here, we show how ASP can play a relevant role in the brain evolution simulation task. In particular, we propose a general and extensible framework to support physicians and researchers at understanding the complex mechanisms underlying neurological disorders. The framework relies on a combined use of ML and ASP, and is general enough to be applied in several other application scenarios, which are outlined in the paper.

关键词： logic programming answer set programming rule-based systems deductive reasoning neural networks neurological disorders machine learning declarative formalisms bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Debugging Non-ground ASP Programs: Technique and Graphical Tools

引用

THEORY AND PRACTICE OF LOGIC programming 2019年第2期19卷 290-316页

作者： Dodaro, Carmine Gasteiger, Philip Reale, Kristian Ricca, Francesco Schekotihin, Konstantin Univ Genoa DIBRIS Genoa Italy Alpen Adria Univ Klagenfurt Klagenfurt Austria Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

answer set programming (ASP) is one of the major declarative programming paradigms in the area of logic programming and non-monotonic reasoning. Despite that ASP features a simple syntax and an intuitive semantics, errors are common during the development of ASP programs. In this paper we propose a novel debugging approach allowing for interactive localization of bugs in non-ground programs. The new approach points the user directly to a set of non-ground rules involved in the bug, which might be refined (up to the point in which the bug is easily identified) by asking the programmer a sequence of questions on an expected answer set. The approach has been implemented on top of the ASP solver WASP. The resulting debugger has been complemented by a user-friendly graphical interface, and integrated in ASPI DE, a rich integrated development environment (IDE) for answer set programs. In addition, an empirical analysis shows that the new debugger is not affected by the grounding blowup limiting the application of previous approaches based on meta-programming.

关键词： answer set programming debugging graphical user interface

来源：评论

学校读者我要写书评

暂无评论

Ordered completion for logic programs with aggregates

引用

ARTIFICIAL INTELLIGENCE 2015年 224卷 72-102页

作者： Asuncion, Vernon Chen, Yin Zhang, Yan Zhou, Yi Univ Western Sydney Sch Comp Engn & Math AIRG Penrith NSW 1797 Australia S China Normal Univ Dept Comp Sci Guangzhou Guangdong Peoples R China

We consider the problem of translating first-order answer set programs with aggregates into first-order sentences with the same type of aggregates. In particular, we show that, on finite structures, normal logic programs with convex aggregates, which cover both monotone and antimonotone aggregates as well as the aggregates appearing in most benchmark programs, can always be captured in first-order logic with the same type of aggregates by introducing auxiliary predicates. More precisely, we prove that every finite stable model of a normal program with convex aggregates is corresponding to a classical model of its enhanced ordered completion. This translation then suggests an alternative way for computing the stable models of such kind of programs. We report some experimental results, which demonstrate that our solver GROCv2 is comparable to the state-of-the-art answer set solvers. We further show that convex aggregates form a maximal class for this purpose. That is, we can always construct a normal logic program under any given non-convex aggregate context and prove that it can never be translated into first-order sentences with the same type of aggregates unless NP = coNP. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Knowledge representation and reasoning answer set programming Aggregates First-order logic Logic programming

来源：评论

学校读者我要写书评

暂无评论

Adding Metalogic Features to Knowledge Representation Languages

引用

FUNDAMENTA INFORMATICAE 2021年第1期181卷 71-98页

作者： Costantini, Stefania Formisano, Andrea Univ Aquila DISIM Via Vetoio Loc Coppito I-67010 Laquila Italy Univ Udine DMIF Via Sci 206 I-33100 Udine Italy

In this paper we present a methodology for introducing customizable metalogic features in logic-based knowledge representation and reasoning languages. The proposed approach is based on concepts of introspection and reflection previously introduced and discussed by various authors in relevant literature. This allows a knowledge engineer to specify enhanced reasoning engines by defining properties and meta-properties of relations as expressible for instance in OWL. We employ meta-level axiom schemata based upon a naming (reification) device. We propose general principles for extending the semantics of "host" formalisms accordingly. Consequently, suitable pre-defined libraries of properties can be made available, while user-defined new schemata are also allowed. We make the specific cases of answer set programming (ASP) and Datalog(+/-), where such features may be part of software engineering toolkits for these programming paradigms. On the one hand, concerning ASP, we extend the programming principles and practice to accommodate the proposed methodology, so as to perform meta-reasoning within the plain ASP semantics. The computational complexity of the resulting framework does not change. On the other hand, we show how metalogic features can significantly enrich Datalog(+/-) with minor changes to its operational semantics (provided in terms of "chase") and, also in this case, no additional complexity burden.

关键词： Meta-reasoning answer set programming Datalog(+/-) Web-ontologies

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Specifying and Reasoning about CPS through the Lens of the NIST CPS Framework

引用

THEORY AND PRACTICE OF LOGIC programming 2023年第5期23卷 1029-1069页

作者： Thanh Hai Nguyen Bundas, Matthew Son, Tran Cao Balduccini, Marcello Garwood, Kathleen Campbell Griffor, Edward R. New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA St Josephs Univ Philadelphia PA 19131 USA NIST Gaithersburg MD 20899 USA

This paper introduces a formal definition of a Cyber-Physical System (CPS) in the spirit of the CPS Framework proposed by the National Institute of Standards and Technology (NIST). It shows that using this definition, various problems related to concerns in a CPS can be precisely formalized and implemented using answer set programming (ASP). These include problems related to the dependency or conflicts between concerns, how to mitigate an issue, and what the most suitable mitigation strategy for a given issue would be. It then shows how ASP can be used to develop an implementation that addresses the aforementioned problems. The paper concludes with a discussion of the potentials of the proposed methodologies.

关键词： artificial intelligence knowledge representation automated reasoning and planning cyber-physical system answer set programming concern satisfaction CPS ontology

来源：评论

学校读者我要写书评

暂无评论

Modeling preferences and conditional preferences on resource consumption and production in ASP

引用

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC 2009年第1期64卷 3-15页

作者： Costantini, Stefania Formisano, Andrea Univ Aquila Dipartimento Informat I-67010 Coppito Italy Univ Perugia Dipartimento Matemat & Informat I-06123 Perugia Italy

In this paper, we extend our previous work on Resourced ASP, or for short RASP, where we have introduced the possibility of defining and using resources in ASP. In RASP, one can define resources with their amounts, Where available resources can be used for producing other resources and the remaining amount, if any, can be used in a different way. In this paper, we introduce P-RASP (RASP with Preferences) where it is possible to express preferences about which resources should be either consumed or produced. Moreover, conditional preferences, of different forms, allow one to express preferences according to certain conditions, that are to be evaluated "dynamically", namely, with respect to the specific answer set at hand. The semantic of conditional preferences is given in terms of (non-conditional) preferences, though the translation is not straightforward and thus the new features are not syntactic sugar. Complexity of P-RASP is also discussed. (C) 2009 Elsevier Inc. All rights reserved.

关键词： answer set programming Quantitative reasoning Preferences Non-monotonic logic programming Language extensions

来源：评论

学校读者我要写书评

暂无评论

On the equivalence and range of applicability of graph-based representations of logic programs

引用

INFORMATION PROCESSING LETTERS 2002年第5期84卷 241-249页

作者： Costantini, S D'Antona, O Provetti, A Univ Aquila Dipartimento Informat I-67100 Laquila Italy Univ Milan Dipartimento Sci Informaz I-20135 Milan Italy Univ Messina Dipartimento Fis I-98166 Messina Italy

Logic programs under answer sets semantics can be studied, and actual computation can be carried out, by means of representing them by directed graphs. Several reductions of logic programs to directed graphs are now available. We compare our proposed representation, called Extended Dependency Graph, to the Block Graph representation recently defined by Linke [Proc. IJCAI-2001, 2001, pp. 641-648]. On the relevant fragment of well-founded irreducible programs, extended dependency and block graph turns out to be isomorphic. So, we argue that graph representation of general logic programs should be abandoned in favor of graph representation of well-founded irreducible programs, which are more concise, more uniform in structure while being equally expressive. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： logic programming answer set programming graph algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：