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

On the relation between weak completion semantics and answer set semantics

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Saldanha, Emmanuelle-Anna Dietz Fandinno, Jorge Technische Universitat Dresden Technische Universitat Potsdam Germany

The Weak Completion Semantics (WCS) is a computational cognitive theory that has shown to be successful in modeling episodes of human reasoning. As the WCS is a recently developed logic programming approach, this paper investigates the correspondence of the WCS with respect to the well-established Answer Set Semantics (ASP). The underlying three-valued logic of both semantics is different and their models are evaluated with respect to different program transformations. We first illustrate these differences by the formal representation of some examples of a well-known psychological experiment, the suppression task. After that, we will provide a translation from logic programs understood under the WCS into logic programs understood under the ASP. In particular, we will show that logic programs under the WCS can be represented as logic programs under the ASP by means of a definition completion, where all defined atoms in a program must be false when their definitions are false. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

Horn Clauses in Hybrid-Dynamic First-Order logic

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Găină, Daniel Ţuţu, Ionuţ Institute of Mathematics for Industry Kyushu University Japan Department of Mathematics and Statistics La Trobe University Australia Simion Stoilow Institute of Mathematics of the Romanian Academy Department of Computer Science Royal Holloway University of London United Kingdom

We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are common to hybrid logics and to dynamic logics. This provides certain key advantages for dealing with reconfigurable systems, such as: (a) a signature of nominals, including operation and relation symbols, that allows references to specific possible worlds / system configurations – as in the case of hybrid logics;(b) distinguished signatures of rigid and flexible symbols, where the rigid symbols are interpreted uniformly across possible worlds;this supports a rigid form of quantification, which ensures that variables have the same interpretation regardless of the possible world where they are evaluated;(c) hybrid terms, which increase the expressive power of the logic in the context of rigid symbols;and (d) modal operators over dynamic-logic actions, which are defined as regular expressions over binary nominal relations. We then study Horn clauses in this hybrid-dynamic logic, and develop a series of results that lead to an initial-semantics theorem for arbitrary sets of clauses. This shows that a significant fragment of hybrid-dynamic first-order logic has good computational properties, and can serve as a basis for defining executable languages for reconfigurable systems. Lastly, we set out the foundations of logic programming in this fragment by proving a hybrid-dynamic variant of Herbrand’s theorem, which reduces the semantic entailment of a logic-programming query by a program to the search of a suitable answer substitution. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

ASP-based discovery of semi-markovian causal models under weaker assumptions

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhalama Zhang, Jiji Eberhardt, Frederick Mayer, Wolfgang Li, Mark Junjie University of South Australia Lingnan University California Institute of Technology Shenzhen University

In recent years the possibility of relaxing the socalled Faithfulness assumption in automated causal discovery has been investigated. The investigation showed (1) that the Faithfulness assumption can be weakened in various ways that in an important sense preserve its power, and (2) that weakening of Faithfulness may help to speed up methods based on Answer Set programming. However, this line of work has so far only considered the discovery of causal models without latent variables. In this paper, we study weakenings of Faithfulness for constraint-based discovery of semi-Markovian causal models, which accommodate the possibility of latent variables, and show that both (1) and (2) remain the case in this more realistic setting. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

The Seventh Answer Set programming Competition: Design and Results

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Gebser, Martin Maratea, Marco Ricca, Francesco Institute for Computer Science University of Potsdam Germany DIBRIS University of Genova Italy Dipartimento di Matematica e Informatica Università della Calabria Italy

Answer Set programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning. Biennial ASP competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving. In this paper, we report on the design and results of the Seventh ASP Competition, jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation with the 14th International Conference on logic programming and Non-Monotonic Reasoning (LPNMR 2017). (Under consideration foracceptance in TPLP). Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

Micro-intelligence for the IoT: SE Challenges and Practice in LPaaS

学校读者我要写书评

暂无评论

Micro-intelligence for the IoT: SE Challenges and Practice i...

IEEE International Conference on Cloud Engineering (IEEE IC2E)

作者： Calegari, Roberta Ciatto, Giovanni Mariani, Stefano Denti, Enrico Omicini, Andrea Univ Bologna Dept Comp Sci & Engn DISI Alma Mater Studiorum Bologna Italy Univ Modena & Reggio Emilia Dept Sci & Methods Engn DISMI Reggio Emilia Italy

ISBN: (纸本)9781538650080

Distributing situated intelligence in Cyber-Physical Systems (CPS) to realise the vision of Internet of Intelligent Things (IoIT) raises issues of efficiency and scalability-in particular when dealing with huge numbers of physical objects. Such issues do not just regard the application or service logic and runtime, but also impact on the software development process. Moving from the notion of logic programming as a Service (LPaaS) - a re-interpretation of distributed logic programming tailored to the IoT era - in this paper we describe how its architecture and development process deals with the aforementioned issues from a software engineering standpoint, by discussing the design, development practices, and delivery means of the LPaaS technology.

关键词： Software Servers logic programming Scalability Engines Computer architecture

The informal semantics of answer set programming: A tarskian perspective

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Denecker, Marc Lierler, Yuliya Truszczynski, Miroslaw Vennekens, Joost Department of Computer Science KU Leuven Leuven3001 Belgium Department of Computer Science University of Nebraska at Omaha OmahaNE68182 United States Department of Computer Science University of Kentucky LexingtonKY40506-0633 United States Department of Computer Science KU Leuven Campus De Nayer Sint-Katelijne-Waver2860 Belgium

In Knowledge Representation, it is crucial that knowledge engineers have a good understanding of the formal expressions that they write. What formal expressions state intuitively about the domain of discourse is studied in the theory of the informal semantics of a logic. In this paper we study the informal semantics of Answer Set programming. The roots of answer set programming lie in the language of Extended logic programming, which was introduced initially as an epistemic logic for default and autoepistemic reasoning. In 1999, the seminal papers on answer set programming proposed to use this logic for a different purpose, namely, to model and solve search problems. Currently, the language is used primarily in this new role. However, the original epistemic intuitions lose their explanatory relevance in this new context. How answer set programs are connected to the specifications of problems they model is more easily explained in a classical Tarskian semantics, in which models correspond to possible worlds, rather than to belief states of an epistemic agent. In this paper, we develop a new theory of the informal semantics of answer set programming, which is formulated in the Tarskian setting and based on Frege's compositionality principle. It differs substantially from the earlier epistemic theory of informal semantics, providing a different view on the meaning of the connectives in answer set programming and on its relation to other logics, in particular classical logic. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

A Distributed Approach to LARS Stream Reasoning (System paper)

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Eiter, Thomas Ogris, Paul Schekotihin, Konstantin Technische Universitt Wien Institut fr Logic and Computation KBS Group Alpen-Adria-Universitt Klagenfurt Austria

Stream reasoning systems are designed for complex decision-making from possibly infinite, dynamic streams of data. Modern approaches to stream reasoning are usually performing their computations using stand-alone solvers, which incrementally update their internal state and return results as the new portions of data streams are pushed. However, the performance of such approaches degrades quickly as the rates of the input data and the complexity of decision problems are growing. This problem was already recognized in the area of stream processing, where systems became distributed in order to allocate vast computing resources provided by clouds. In this paper we propose a distributed approach to stream reasoning that can efficiently split computations among different solvers communicating their results over data streams. Moreover, in order to increase the throughput of the distributed system, we suggest an interval-based semantics for the LARS language, which enables significant reductions of network traffic. Performed evaluations indicate that the distributed stream reasoning significantly outperforms existing stand-alone LARS solvers when the complexity of decision problems and the rate of incoming data are increasing. Under consideration for acceptance in Theory and Practice of logic programming. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

Solving a flowshop scheduling problem with answer set programming: Exploiting the problem to reduce the number of combinations

学校读者我要写书评

暂无评论

arXiv 2019年

作者： García-Mata, Carmen Leticia Márquez-Gutiérrez, Pedro Rafael Tecnológico Nacional de México - Tecnológico de Chihuahua Chihuahua Chih. Mexico

Planning and scheduling have been a central theme of research in computer science. In particular, the simplicity of the theoretical approach of a no-wait flowshop scheduling problem does not allow to perceive the problem’s complexity at first sight. In this paper the applicability of the Answer Set programming language is explored for the solution of the Automated Wet-etching scheduling problem in Semiconductor Manufacturing Systems. A method based in ranges is proposed in order to reduce the huge number of combinations. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming

KBSET – Knowledge-Based Support for Scholarly Editing and Text Processing

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Kittelmann, Jana Wernhard, Christoph Martin-Luther-Universität Halle-Wittenberg Germany Berlin Germany

KBSET supports a practical workflow for scholarly editing, based on using LATEX with dedicated commands for semantics-oriented markup and a Prolog-implemented core system. Prolog plays there various roles: as query language and access mechanism for large Semantic Web fact bases, as data representation of structured documents and as a workflow model for advanced application tasks. The core system includes a LATEX parser and a facility for the identification of named entities. We also sketch future perspectives of this approach to scholarly editing based on techniques of computational logic. Copyright © 2019, The Authors. All rights reserved.

关键词： logic programming