The proceedings contain 10 papers. The topics discussed include: Ziria: wireless programming for hardware dummies;pension reserve computations on GPUs;parallel computation of multifield topology: experience of Haskell...
ISBN:
(纸本)9781450330404
The proceedings contain 10 papers. The topics discussed include: Ziria: wireless programming for hardware dummies;pension reserve computations on GPUs;parallel computation of multifield topology: experience of Haskell in a computational science application;an efficient representation for lazy constructors using 64-bit pointers;size slicing - a hybrid approach to size inference in Futhark;defunctionalizing push arrays;fusing filters with integer linear programming;lazy data-oriented evaluation strategies;group communication patterns for high performance computing in Scala;native offload of Haskell Repa programs to integrated GPUs;and LambdaJIT: a dynamic compiler for heterogeneous optimizations of Stl algorithms.
We compare two executable languages: the rewriting logic based specification language Maude and the higher-order, lazy, functional programming language Haskell. We compare these languages experimentally on a problem i...
详细信息
Uncertainty and ambiguity are two inherent properties of historical and archaeological data. It is very often that different researchers express conflicting opinions about an artifact39;s chronology, creation, origi...
详细信息
We present a new knowledge-based robot architecture that relies on ontologies and logical programming to represent robot behavior in a declarative fashion. Most state-of-theart robot architectures, instead, build on v...
详细信息
This paper describes a new approach on optimization of constraint satisfaction problems (CSPs) by means of substituting sub-CSPs with locally consistent regular membership constraints. The purpose of this approach is ...
详细信息
Capturing the uncertain aspects in cyber threat analyses is an important part of a wide range of efforts, including diagnostics, threat evaluation, and preventing attacks. However, there has been insufficient research...
详细信息
Answer Set programming (ASP) has become the paradigm of choice in the field of logicprogramming and non-monotonic reasoning. With the design of new and efficient solvers, ASP has been successfully adopted in a wide r...
详细信息
Almost climate neutral buildings are one of the core goals in terms of sustainability. Beside the support of the necessary design decisions for an integrated, interoperable, ecological and economical operation of buil...
详细信息
AGM39;s belief revision is one of the main paradigms in the study of belief change operations. In this context, belief bases (prioritised bases) have been primarily used to specify the agent39;s belief state. Whil...
详细信息
ISBN:
(纸本)9783030388089;9783030388072
AGM's belief revision is one of the main paradigms in the study of belief change operations. In this context, belief bases (prioritised bases) have been primarily used to specify the agent's belief state. While the connection of iterated AGM-like operations and their encoding in dynamic epistemic logics have been studied before, few works considered how well-known postulates from iterated belief revision theory can be characterised by means of belief bases and their counterpart in dynamic epistemic logic. Particularly, it has been shown that some postulates can be characterised through transformations in priority graphs, while others may not be represented that way. This work investigates changes in the semantics of Dynamic Preference logic that give rise to an appropriate syntactic representation for its models that allow us to represent and reason about iterated belief base change in this logic.
Classical Answer Set programming is a widely known knowledgerepresentation framework based on the logicprogramming paradigm that has been extensively studied in the past decades. Semantic theories for classical answ...
详细信息
ISBN:
(纸本)9783319493978;9783319493961
Classical Answer Set programming is a widely known knowledgerepresentation framework based on the logicprogramming paradigm that has been extensively studied in the past decades. Semantic theories for classical answer sets are implicitly three-valued in nature, yet with few exceptions, computing classical answer sets is based on translations into classical logic and the use of SAT solving techniques. In this paper, we introduce a variation of Kleene three-valued logic with strong connectives, R-3, and then provide a sound and complete proof procedure for R-3 based on the use of signed tableaux. We then define a restriction on the syntax of R-3 to characterize Kleene ASPs. Strongly-supported models, which are a subset of R-3 models are then defined to characterize the semantics of Kleene ASPs. A filtering technique on tableaux for R-3 is then introduced which provides a sound and complete tableau-based proof technique for Kleene ASPs. We then show a translation and semantic correspondence between Classical ASPs and Kleene ASPs, where answer sets for normal classical ASPs are equivalent to strongly-supported models. This implies that the proof technique introduced can be used for classical normal ASPs as well as Kleene ASPs. The relation between non-normal classical and Kleene ASPs is also considered.
暂无评论