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

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

作者： Pensel, Maximilian Turhan, Anni-Yasmin Tech Univ Dresden Inst Theoret Comp Sci Dresden Germany

ISBN: (纸本)9783319616605;9783319616599

Defeasible Description logics (DDLs) can state defeasible concept inclusions and often use rational closure according to the KLM postulates for reasoning. If in DDLs with quantification a defeasible sub-sumption relationship holds between concepts, it can also hold if these concepts appear nested in existential restrictions. Earlier reasoning algorithms did not detect this kind of relationships. We devise a new form of canonical models that extend classical ones for EL. by elements that satisfy increasing amounts of defeasible knowledge and show that reasoning w.r.t. these models yields the missing rational entailments.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

Representing hybrid automata by action language modulo theories

Representing hybrid automata by action language modulo theor...

引用

33rd International Conference on logic programming colocated with the 23rd International Conference on Principles and practice of Constraint programming / 20th International Conference on theory and Applications of Satisfiability Testing

作者： Lee, Joohyung Loney, Nikhil Meng, Yunsong Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85281 USA Houzz Inc Palo Alto CA USA

Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them. We show how to succinctly represent hybrid automata in an action language which in turn is defined as a high-level notation for answer set programming modulo theories-an extension of answer set programs to the firstorder level similar to the way satisfiability modulo theories (SMT) extends propositional satisfiability (SAT). We first show how to represent linear hybrid automata with convex invariants by an action language modulo theories. A further translation into SMT allows for computing them using SMT solvers that support arithmetic over reals. Next, we extend the representation to the general class of non-linear hybrid automata allowing even non-convex invariants. We represent them by an action language modulo ordinary differential equations, which can be compiled into satisfiability modulo ordinary differential equations. We present a prototype system CPLUS2ASPMT based on these translations, which allows for a succinct representation of hybrid transition systems that can be computed effectively by the state-of-the-art SMT solver dReal.

关键词： Answer set programming Action languages Hybrid automata

来源：评论

学校读者我要写书评

暂无评论

Ticker: A system for incremental ASP-based stream reasoning

Ticker: A system for incremental ASP-based stream reasoning

引用

作者： Beck, Harald Eiter, Thomas Folie, Christian Vienna Univ Technol Inst Informat Syst Favoritenstr 9-11 A-1040 Vienna Austria

In complex reasoning tasks, as expressible by Answer Set programming (ASP), problems often permit for multiple solutions. In dynamic environments, where knowledge is continuously changing, the question arises how a given model can be incrementally adjusted relative to new and outdated information. This paper introduces Ticker, a prototypical engine for well-defined logical reasoning over streaming data. Ticker builds on a practical fragment of the recent rule-based language LARS, which extends ASP for streams by providing flexible expiration control and temporal modalities. We discuss Ticker's reasoning strategies: first, the repeated one-shot solving mode calls Clingo on an ASP encoding. We show how this translation can be incrementally updated when new data is streaming in or time passes by. Based on this, we build on Doyle's classic justification-based truth-maintenance system to update models of non-stratified programs. Finally, we empirically compare the obtained evaluation mechanisms.

关键词： Stream reasoning Answer set programming Non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Technical note the external interface for extending WASP

arXiv

引用

arXiv 2018年

作者： Dodaro, Carmine Ricca, Francesco DIBRIS University of Genova Genova Italy DEMACS University of Calabria Rende Italy

Answer set programming (ASP) is a successful declarative formalism for knowledge representation and reasoning. The evaluation of ASP programs is nowadays based on the Conflict-Driven Clause Learning (CDCL) backtracking search algorithm. Recent work suggested that the performance of CDCL-based implementations can be considerably improved on specific benchmarks by extending their solving capabilities with custom heuristics and propagators. However, embedding such algorithms into existing systems requires expert knowledge of the internals of ASP implementations. The development of effective solver extensions can be made easier by providing suitable programming interfaces. In this paper, we present the interface for extending the CDCL-based ASP solver WASP. The interface is both general, i.e. it can be used for providing either new branching heuristics and propagators, and external, i.e. the implementation of new algorithms requires no internal modifications of WASP. Moreover, we review the applications of the interface witnessing it can be successfully used to extend WASP for solving effectively hard instances of both real-world and synthetic problems. Under consideration in theory and practice of logic programming (TPLP). Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Rotation-Based Formulation for Stable Matching 23rd

Rotation-Based Formulation for Stable Matching

引用

33rd International Conference on logic programming / 23rd International Conference on Principles and practice of Constraint programming (CP) / 20th International Conference on theory and Applications of Satisfiability Testing (SAT)

作者： Siala, Mohamed O'Sullivan, Barry Univ Coll Cork Insight Ctr Data Analyt Dept Comp Sci Cork Ireland

ISBN: (纸本)9783319661582;9783319661575

We introduce new CP models for the many-to-many stable matching problem. We use the notion of rotation to give a novel encoding that is linear in the input size of the problem. We give extra filtering rules to maintain arc consistency in quadratic time. Our experimental study on hard instances of sex-equal and balanced stable matching shows the efficiency of one of our propositions as compared with the state-of-the-art constraint programming approach.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

Non-monotonic spatial reasoning with answer set programming modulo theories

引用

theory and practice of logic programming 2017年第2期17卷 205-225页

作者： Walega, Przemyslaw Andrzej Schultz, Carl Bhatt, Mehul DesignSpace Grp Spatial Reasoning Neuherberg Germany Univ Warsaw Warsaw Poland Univ Munster Munster Germany Univ Bremen Bremen Germany

The systematic modelling of dynamic spatial systems is a key requirement in a wide range of application areas such as commonsense cognitive robotics, computer-aided architecture design, and dynamic geographic information systems. We present Answer Set programming Modulo Theories (ASPMT)(QS), a novel approach and fully implemented prototype for non-monotonic spatial reasoning - a crucial requirement within dynamic spatial systems based on ASPMT. ASPMT(QS) consists of a (qualitative) spatial representation module (QS) and a method for turning tight ASPMT instances into Satisfiability Modulo Theories (SMT) instances in order to compute stable models by means of SMT solvers. We formalise and implement concepts of default spatial reasoning and spatial frame axioms. Spatial reasoning is performed by encoding spatial relations as systems of polynomial constraints, and solving via SMT with the theory of real non-linear arithmetic. We empirically evaluate ASPMT(QS) in comparison with other contemporary spatial reasoning systems both within and outside the context of logic programming. ASPMT(QS) is currently the only existing system that is capable of reasoning about indirect spatial effects (i.e., addressing the ramification problem), and integrating geometric and QS information within a non-monotonic spatial reasoning context.

关键词： non-monotonic spatial reasoning answer set programming modulo theories declarative spatial reasoning dynamic spatial systems reasoning about space actions and change

来源：评论

学校读者我要写书评

暂无评论

When you must forget: Beyond strong persistence when forgetting in answer set programming

When you must forget: Beyond strong persistence when forgett...

引用

作者： Goncalves, Ricardo Knorr, Matthias Leite, Joao Woltran, Stefan Univ Nova Lisboa NOVA LINCS Lisbon Portugal TU Wien Vienna Austria

Among the myriad of desirable properties discussed in the context of forgetting in Answer Set programming, strong persistence naturally captures its essence. Recently, it has been shown that it is not always possible to forget a set of atoms from a program while obeying this property, and a precise criterion regarding what can be forgotten has been presented, accompanied by a class of forgetting operators that return the correct result when forgetting is possible. However, it is an open question what to do when we have to forget a set of atoms, but cannot without violating this property. In this paper, we address this issue and investigate three natural alternatives to forget when forgetting without violating strong persistence is not possible, which turn out to correspond to the different possible relaxations of the characterization of strong persistence. Additionally, we discuss their preferable usage, shed light on the relation between forgetting and notions of relativized equivalence established earlier in the context of Answer Set programming, and present a detailed study on their computational complexity.

关键词： forgetting Answer Set programming strong equivalence relativized equivalence computational complexity

来源：评论

学校读者我要写书评

暂无评论

A web system for reasoning with probabilistic OWL

引用

SOFTWARE-practice & EXPERIENCE 2017年第1期47卷 125-142页

作者： Bellodi, Elena Lamma, Evelina Riguzzi, Fabrizio Zese, Riccardo Cota, Giuseppe Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 Ferrara Italy

We present the web application Tableau Reasoner for descrIption logics in proLog on SWI-Prolog for SHaring (TRILL on SWISH) which allows the user to write probabilistic description logic (DL) theories and compute the probability of queries with just a web browser. Various probabilistic extensions of DLs have been proposed in the recent past, because uncertainty is a fundamental component of the Semantic Web. We consider probabilistic DL theories following our distribution semantics for probabilistic ontologies (DISPONTE) semantics. Axioms of a DISPONTE knowledge base can be annotated with a probability, and the probability of queries can be computed with inference algorithms. TRILL is a probabilistic reasoner for DISPONTE knowledge base that is implemented in Prolog and exploits its backtracking facilities for handling the non-determinism of the tableau algorithm. TRILL on SWISH is based on SWISH, a recently proposed web framework for logic programming, based on various features and packages of SWI-Prolog (e.g., a web server and a library for creating remote Prolog engines and posing queries to them). TRILL on SWISH also allows users to cooperate in writing a probabilistic DL theory. It is free, open, and accessible on the Web at the url:;it includes a number of examples that cover a wide range of domains and provide interesting Probabilistic Semantic Web applications. By building a web-based system, we allow users to experiment with probabilistic DLs without the need to install a complex software stack. In this way, we aim to reach out to a wider audience and popularize the Probabilistic Semantic Web. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： semantic web web applications description logics probabilistic description logics SWI-Prolog logic programming

来源：评论

学校读者我要写书评

暂无评论

Answer Set programming with Graded Modality 14th

Answer Set Programming with Graded Modality

引用

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

作者： Zhang, Zhizheng Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9783319616605;9783319616599

Answer set programming with graded modality (ASP(GM)) introduced in [6] provides an intuitive way for expressing modal concepts "at least as many as......" as well as "at most as many as......", and defaults. This paper studies the semantics of ASP(GM) and investigates its connection to the most recent language of epistemic specification (ASP(KM)) proposed in [3] and the answer set programming with epistemic negation (ASP(NOT)) presented in [5]. Particularly, we define a new approach to evaluating graded modalities in ASP(GM) such that ASP(GM) is compatible with ASP(KM) as well as ASP(NOT) at the semantic level.

关键词： Answer set Graded modality Introspection

来源：评论

学校读者我要写书评

暂无评论

LP2NORMAL-A Normalization Tool for Extended logic Programs 14th

LP2NORMAL-A Normalization Tool for Extended Logic Programs

引用

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

作者： Bomanson, Jori Aalto Univ Dept Comp Sci Espoo Finland

ISBN: (纸本)9783319616605;9783319616599

Answer set programming (ASP) features a rich rule-based modeling language for encoding search problems. While normal rules form the simplest rule type in the language, various forms of extended rules have been introduced in order to ease modeling of complex conditions and constraints. Normalization means replacing such extended rules with identically functioning sets of normal rules. In this system description, we present LP2NORMAL, which is a state-of-the-art normalizer that acts as a filter on ground logic programs produced by grounders, such as gringo. It provides options to translate away choice rules, cardinality rules, and weight rules, and to rewrite optimization statements using comparable techniques. The produced logic programs are suitable inputs to tools that lack support for extended rules, in particular. We give an overview of the normalization techniques currently supported by the tool and summarize its features. Moreover, we discuss the typical application scenarios of normalization, such as when implementing the search for answer sets using a back-end solver without direct support for cardinality constraints or pseudo-Boolean constraints.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：