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

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

作者： Lopes, Carlos Knorr, Matthias Leite, Joao Univ Nova Lisboa NOVA LINCS Dept Informat Fac Ciencias & Tecnol P-2829516 Caparica Portugal

ISBN: (纸本)9783319616605;9783319616599

We present the latest, substantially improved, version of NoHR, a reasoner designed to answer queries over hybrid theories composed of an OWL ontology in Description logics and a set of non-monotonic rules in logic programming. Whereas the need to combine the distinctive features of these two knowledge representation and reasoning approaches stems from real world applications, their integration is nevertheless theoretically challenging due to their substantial semantical differences. NoHR has been developed as a plug-in for the widely used ontology editor Protege - in fact, the first hybrid reasoner of its kind for Protege, building on a combination of reasoners dedicated to OWL and rules - but it is also available as a library, allowing for its integration within other environments and applications. Compared to previous versions of NoHR, this is the first that supports all polynomial OWL profiles, and even beyond, allowing for its usage with real-world ontologies that do not fit within a single profile. In addition, NoHR has now an enhanced integration with its rule engine, which provides support for a vast number of standard built-in Prolog predicates that considerably extend its usability.

关键词： Query answering logic programming Description logic ontologies

来源：评论

学校读者我要写书评

暂无评论

Temporary Read-Only Permissions for Separation logic 1

引用

26th European Symposium on programming (ESOP) Held as Part of the European Joint Conferences on theory and practice of Software (ETAPS)

作者： Chargueraud, Arthur Pottier, Francois Inria Paris France Univ Strasbourg ICube CNRS Strasbourg France

ISBN: (数字)9783662544341

ISBN: (纸本)9783662544341;9783662544334

We present an extension of Separation logic with a general mechanism for temporarily converting any assertion (or "permission") to a read-only form. No accounting is required: our read-only permissions can be freely duplicated and discarded. We argue that, in circumstances where mutable data structures are temporarily accessed only for reading, our read-only permissions enable more concise specifications and proofs. The metatheory of our proposal is verified in Coq.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

A concurrent constraint programming interpretation of access permissions

arXiv

引用

arXiv 2018年

作者： Olarte, Carlos Pimentel, Elaine Rueda, Camilo ECT Universidade Federal Rio Grande do Norte Brazil DMAT Universidade Federal Rio Grande do Norte Brazil DECC Pontificia Universidad Javeriana Cali Colombia

A recent trend in object oriented (OO) programming languages is the use of Access Permissions (APs) as an abstraction for controlling concurrent executions of programs. The use of AP source code annotations defines a protocol specifying how object references can access the mutable state of objects. Although the use of APs simplifies the task of writing concurrent code, an unsystematic use of them can lead to subtle problems. This paper presents a declarative interpretation of APs as Linear Concurrent Constraint Programs (lcc). We represent APs as constraints (i.e., formulas in logic) in an underlying constraint system whose entailment relation models the transformation rules of APs. Moreover, we use processes in lcc to model the dependencies imposed by APs, thus allowing the faithful representation of their flow in the *** verify relevant properties about AP programs by taking advantage of the interpretation of lcc processes as formulas in Girard's intuitionistic linear logic (ILL). Properties include deadlock detection, program correctness (whether programs adhere to their AP specifications or not), and the ability of methods to run concurrently. By relying on a focusing discipline for ILL, we provide a complexity measure for proofs of the above mentioned properties. The effectiveness of our verification techniques is demonstrated by implementing the Alcove tool that includes an animator and a verifier. The former executes the lcc model, observing the flow of APs and quickly finding inconsistencies of the APs vis-á-vis the implementation. The latter is an automatic theorem prover based on ILL. This paper is under consideration for publication in theory and practice of logic programming (TPLP). Copyright © 2018, The Authors. All rights reserved.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

36th Annual International Conference on the theory and Applications of Cryptographic Techniques, EUROCRYPT 2017

36th Annual International Conference on the Theory and Appli...

引用

26th European Symposium on programming, ESOP 2017 held as Part of the European Joint Conferences on theory and practice of Software, ETAPS 2017

ISBN: (纸本)9783662544334

The proceedings contain 36 papers. The special focus in this conference is on programming, theory and practice of Software. The topics include: Disjoint polymorphism;generalizing inference systems by coaxioms;observed communication semantics for classical processes;implementing corecursion in foundational proof assistants;confluence of graph rewriting with interfaces;verifying robustness of event-driven asynchronous programs against concurrency;incremental update for graph rewriting;linearity, control effects, and behavioral types;temporary read-only permissions for separation logic;faster algorithms for weighted recursive state machines;ML and extended branching VASS;contextual equivalence for probabilistic programs with continuous random variables and scoring;probabilistic termination by monadic affine sized typing;extensible datasort refinements;programs using syntax with first-class binders;a linear logical framework with first-class contexts;unified reasoning about robustness properties of symbolic-heap separation logic;proving linearizability using partial orders;characterising complexity classes using non-deterministic cons-free programming;the essence of higher-order concurrent separation logic;the essence of functional programming on semantic data;a classical sequent calculus with dependent types;context-free session type inference;modular verification of higher-order functional programs;commutative semantics for probabilistic programming;conditional dyck-CFL reachability analysis for complete and efficient library summarization;a higher-order logic for concurrent termination-preserving refinement;modular verification of procedure equivalence in the presence of memory allocation and abstract specifications for concurrent maps.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unified Reasoning About Robustness Properties of Symbolic-Heap Separation logic 26th

Unified Reasoning About Robustness Properties of Symbolic-He...

引用

26th European Symposium on programming (ESOP) Held as Part of the European Joint Conferences on theory and practice of Software (ETAPS)

作者： Jansen, Christina Katelaan, Jens Matheja, Christoph Noll, Thomas Zuleger, Florian Rhein Westfal TH Aachen Software Modeling & Verificat Grp Aachen Germany TU Wien Vienna Austria

ISBN: (纸本)9783662544341;9783662544334

We introduce heap automata, a formalism for automatic reasoning about robustness properties of the symbolic heap fragment of separation logic with user-defined inductive predicates. Robustness properties, such as satisfiability, reachability, and acyclicity, are important for a wide range of reasoning tasks in automated program analysis and verification based on separation logic. Previously, such properties have appeared in many places in the separation logic literature, but have not been studied in a systematic manner. In this paper, we develop an algorithmic framework based on heap automata that allows us to derive asymptotically optimal decision procedures for a wide range of robustness properties in a uniform way. We implemented a prototype of our framework and obtained promising results for all of the aforementioned robustness properties. Further, we demonstrate the applicability of heap automata beyond robustness properties. We apply our algorithmic framework to the model checking and the entailment problem for symbolic-heap separation logic.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Constraint answer set programming without grounding

arXiv

引用

arXiv 2018年

作者： Arias, Joaquin Carro, Manuel Salazar, Elmer Marple, Kyle Gupta, Gopal IMDEA Software Institute Universidad Politécnica de Madrid University of Texas Dallas United States

Extending ASP with constraints (CASP) enhances its expressiveness and performance. This extension is not straightforward as the grounding phase, present in most ASP systems, removes variables and the links among them, and also causes a combinatorial explosion in the size of the program. Several methods to overcome this issue have been devised: restricting the constraint domains (e.g., discrete instead of dense), or the type (or number) of models that can be returned. In this paper we propose to incorporate constraints into s(ASP), a goal-directed, top-down execution model which implements ASP while retaining logical variables both during execution and in the answer sets. The resulting model, s(CASP), can constrain variables that, as in CLP, are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) and is parametric w.r.t. the constraint solver. We describe this novel execution model and show through several examples the enhanced expressiveness of s(CASP) w.r.t. ASP, CLP, and other CASP systems. We also report improved performance w.r.t. other very mature, highly optimized ASP systems in some benchmarks. This paper is under consideration for publication in theory and practice of logic programming (TPLP). Copyright © 2018, The Authors. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Combining Stochastic Constraint Optimization and Probabilistic programming From Knowledge Compilation to Constraint Solving 23rd

Combining Stochastic Constraint Optimization and Probabilist...

引用

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)

作者： Latour, Anna L. D. Babaki, Behrouz Dries, Anton Kimmig, Angelika Van den Broeck, Guy Nijssen, Siegfried Leiden Univ LIACS Leiden Netherlands Katholieke Univ Leuven Dept Comp Sci Leuven Belgium Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90024 USA Catholic Univ Louvain ICTEAM Louvain La Neuve Belgium

ISBN: (纸本)9783319661582;9783319661575

We show that a number of problems in Artificial Intelligence can be seen as Stochastic Constraint Optimization Problems (SCOPs): problems that have both a stochastic and a constraint optimization component. We argue that these problems can be modeled in a new language, SC-ProbLog, that combines a generic Probabilistic logic programming (PLP) language, ProbLog, with stochastic constraint optimization. We propose a toolchain for effectively solving these SC-ProbLog programs, which consists of two stages. In the first stage, decision diagrams are compiled for the underlying distributions. These diagrams are converted into models that are solved using Mixed Integer programming or Constraint programming solvers in the second stage. We show that, to yield linear constraints, decision diagrams need to be compiled in a specific form. We introduce a new method for compiling small Sentential Decision Diagrams in this form. We evaluate the effectiveness of several variations of this toolchain on test cases in viral marketing and bioinformatics.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Non-monotonic spatial reasoning with answer set programming modulo theories

Non-monotonic spatial reasoning with answer set programming ...

引用

作者： Waleȩga, Przemyslaw Andrzej Schultz, Carl Bhatt, Mehul University of Warsaw Warsaw Poland University of Münster Münster Germany University of 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. © Cambridge University Press 2016.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Conjunctions of Among Constraints 23rd

Conjunctions of Among Constraints

引用

作者： Dalmau, Victor Univ Pompeu Fabra Dept Informat & Commun Technol Barcelona Spain

ISBN: (纸本)9783319661582;9783319661575

Many existing global constraints can be encoded as a conjunction of among constraints. An among constraint holds if the number of the variables in its scope whose value belongs to a prespecified set, which we call its range, is within some given bounds. It is known that domain filtering algorithms can benefit from reasoning about the interaction of among constraints so that values can be filtered out taking into consideration several among constraints simultaneously. The present paper embarks into a systematic investigation on the circumstances under which it is possible to obtain efficient and complete domain filtering algorithms for conjunctions of among constraints. We start by observing that restrictions on both the scope and the range of the among constraints are necessary to obtain meaningful results. Then, we derive a domain flow-based filtering algorithm and present several applications. In particular, it is shown that the algorithm unifies and generalizes several previous existing results.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

Job Sequencing Bounds from Decision Diagrams 23rd

Job Sequencing Bounds from Decision Diagrams

引用

作者： Hooker, J. N. Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9783319661582;9783319661575

In recent research, decision diagrams have proved useful for the solution of discrete optimization problems. Their success relies on the use of relaxed decision diagrams to obtain bounds on the optimal value, either through a node merger or a node splitting mechanism. We investigate the potential of node merger to provide bounds for dynamic programming models that do not otherwise have a practical relaxation, in particular the job sequencing problem with time windows and state-dependent processing times. We prove general conditions under which a node merger operation yields a valid relaxation and apply them to job sequencing. Computational experiments show that, surprisingly, relaxed diagrams prove the optimal value when their size is only a small fraction of the size of an exact diagram. On the other hand, a relaxed diagram of fixed size ceases to provide a useful bound as the instances scale up.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：