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

I-DLV-sr: A stream reasoning system based on I-DLV1

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Calimeri, Francesco Manna, Marco Mastria, Elena Morelli, Maria Concetta Perri, Simona Zangari, Jessica Department of Mathematics and Computer Science University of Calabria Rende Italy

We introduce a novel logic-based system for reasoning over data streams, which relies on a framework enabling a tight, fine-tuned interaction between Apache Flink and the I2-DLV system. The architecture allows to take advantage from both the powerful distributed stream processing capabilities of Flink and the incremental reasoning capabilities of I2-DLV, based on overgrounding techniques. Besides the system architecture, we illustrate the supported input language and its modeling capabilities, and discuss the results of an experimental activity aimed at assessing the viability of the approach. This paper is under consideration in Theory and Practice of logic programming (TPLP). Copyright © 2021, The Authors. All rights reserved.

关键词： logic programming

Operating room (Re)scheduling with bed management via ASP

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Dodaro, Carmine Galatà, Giuseppe Khan, Muhammad Kamran Maratea, Marco Porro, Ivan University of Calabria Italy SurgiQ srl Italy University of Genoa Italy

The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms, taking into account different specialties, lengths and priority scores of each planned surgery, operating room session durations, and the availability of beds for the entire length of stay both in the Intensive Care Unit and in the wards. A proper solution to the ORS problem is of primary importance for the healthcare service quality and the satisfaction of patients in hospital environments. In this paper we first present a solution to the problem based on Answer Set programming (ASP). The solution is tested on benchmarks with realistic sizes and parameters, on three scenarios for the target length on 5-day scheduling, common in small-medium sized hospitals, and results show that ASP is a suitable solving methodology for the ORS problem in such setting. Then, we also performed a scalability analysis on the schedule length up to 15 days, which still shows the suitability of our solution also on longer plan horizons. Moreover, we also present an ASP solution for the rescheduling problem, i.e. when the off-line schedule cannot be completed for some reason. Finally, we introduce a web framework for managing ORS problems via ASP that allows a user to insert the main parameters of the problem, solve a specific instance, and show results graphically in real-time. Under consideration in Theory and Practice of logic programming (TPLP).12. Copyright © 2021, The Authors. All rights reserved.

关键词： logic programming

ON SYNTACTICALLY SIMILAR logic PROGRAMS AND SEQUENTIAL DECOMPOSITIONS

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Antić, Christian Vienna Austria

Rule-based reasoning is an essential part of human intelligence prominently formalized in artificial intelligence research via logic programs. Describing complex objects as the composition of elementary ones is a common strategy in computer science and science in general. The author has recently introduced the sequential composition of logic programs in the context of logic-based analogical reasoning and learning in logic programming. Motivated by these applications, in this paper we construct a qualitative and algebraic notion of syntactic logic program similarity from sequential decompositions of programs. We then show how similarity can be used to answer queries across different domains via a one-step reduction. In a broader sense, this paper is a further step towards an algebraic theory of logic programming. Copyright © 2021, The Authors. All rights reserved.

关键词： logic programming

Vicious circle principle, aggregates, and formation of sets in ASP based languages

学校读者我要写书评

暂无评论

ARTIFICIAL INTELLIGENCE 2019年 275卷 28-77页

作者： Gelfond, Michael Zhang, Yuanlin Texas Tech Univ Lubbock TX 79409 USA

The paper introduces an extension of the original Answer Set Prolog (ASP) by several set constructs including aggregates, defined as functions on sets. The new language, called Alog allows creating sets based on the Vicious Circle Principle by Poincare and Russell which eliminates a number of problems found in existing extensions of ASP by aggregates. We argue that, despite the fact that Alog is not as expressive as other extensions of ASP by aggregates, clarity of its syntax and semantics, addition of several new set-based constructs, and simplicity and the ease of use make it a viable competitor to these languages. We also study a number of important properties of the language and show how ideas used in its design can be utilized to generalize and simplify the definition of another important extension of ASP by aggregates. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Aggregates Answer set programming logic programming Knowledge representation Language design

Graph based answer set programming solver systems

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Li, Fang University of Texas at Dallas Richardson United States

Answer set programming (ASP) is a popular nonmonotonic-logic based paradigm for knowledge representation and solving combinatorial problems. Computing the answer set of an ASP program is NP-hard in general, and researchers have been investing significant effort to speed it up. The majority of current ASP solvers employ SAT solver-like technology to find these answer sets. As a result, justification for why a literal is in the answer set is hard to produce. There are dependency graph based approaches to find answer sets, but due to the representational limitations of dependency graphs, such approaches are limited. This paper proposes a novel dependency graph-based approach for finding answer sets in which conjunction of goals is explicitly represented as a node which allows arbitrary answer set programs to be uniformly represented. Our representation preserves causal relationships allowing for justification for each literal in the answer set to be elegantly found. In this paper, we explore two different approaches based on the graph representation: bottom-up and top-down. The bottom-up approach finds models by assigning truth values along with the topological order, while the top-down approach generates models starting from the constraints. © 2021, CC BY.

关键词： logic programming

Disjunctive Abduction

学校读者我要写书评

暂无评论

NEW GENERATION COMPUTING 2019年第2期37卷 219-243页

作者： Inoue, Katsumi Sakama, Chiaki Natl Inst Informat Tokyo Japan Grad Univ Adv Studies SOKENDAI Dept Informat Tokyo Japan Tokyo Inst Technol Sch Comp Dept Comp Sci Tokyo Japan Wakayama Univ Dept Comp & Commun Sci Wakayama Japan

Given an observation or a goal, abduction infers candidate hypotheses to explain the observation or to achieve the goal. In this paper, we consider disjunctive abduction, in which disjunctions play important roles in abduction. Machine-oriented intelligent systems can utilize disjunctive abduction in many ways. For example, consider the case in which multiple explanations exist for an observation. We may need to select the best explanation among them, but often it is difficult to choose only one given insufficient information. In that case, we can leave the decision indefinite by considering a disjunctive explanation, which is a disjunction of possible alternative explanations. Disjunctive explanations can offer a consistent way to theory changes when they are incorporated or assimilated into the current knowledge base. The assimilated knowledge base preserves the intended semantics from the collection of all possible updated knowledge bases. A merit of disjunctive explanations is that we only need one current knowledge base at a time, still keeping every possible change in a single state. This method is extended to accomplish an update when there are multiple ways to remove old unnecessary hypotheses from the knowledge base. The proposed framework is well applicable to view updates in disjunctive databases. We also show that disjunctive abduction can be considered in inductive logic programming.

关键词： Abduction logic programming Knowledge assimilation Inductive logic programming

Answer set programming made easy

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Fandinno, Jorge Mishra, Seemran Romero, Javier Schaub, Torsten University of Nebraska at Omaha United States University of Potsdam Germany

We take up an idea from the folklore of Answer Set programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set programming. We elaborate upon the foundations of this idea in the context of the logic of Here-and-There and show how it can be derived from the logical principle of extension by definition. We then provide an austere form of logic programs that may serve as a normalform for logic programs similar to conjunctive normalform in classical logic. Finally, we take the key ideas and propose a modeling methodology for ASP beginners and illustrate how it can be used. © 2021, CC BY.

关键词： logic programming

Prolog as a querying language for MongoDB

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Beßler, Daniel Jongebloed, Sascha Beetz, Michael Institute for Artificial Intelligence University of Bremen DEU Germany

Today's database systems have shown to be capable of supporting AI applications that demand a lot of data processing. To this end, these systems incorporate powerful querying languages that go far beyond the mere retrieval of data, and provide sophisticated facilities for data processing as well. In the case of SQL, the language has been even demonstrated to be Turing-complete in some implementations of the language. In the area of NoSQL databases, a widely adopted one nowadays is the MongoDB database. Queries in MongoDB databases are represented as sequential stages within an aggregation pipeline where each stage defines a transformation of the input data, and passes the transformed data to the next stage. But aggregation queries tend to become rather large for more complex computational problems, lack organization into re-usable pieces, and are thus hard to debug and maintain. We propose a new database querying language called Mongolog which is syntactically a subset of the Prolog language, and we define its operational semantics through translations into aggregation pipelines. To this end, we make use of and extend the formal framework of the MQuery language which characterizes the aggregation framework set-theoretically. © 2021, CC BY.

关键词： logic programming

An ASP-based Approach to Answering Natural Language Questions for Texts

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Pendharkar, Dhruva Basu, Kinjal Shakerin, Farhad Gupta, Gopal The University of Texas at Dallas United States

An approach based on answer set programming (ASP) is proposed in this paper for representing knowledge generated from natural language texts. Knowledge in a text is modeled using a Neo Davidsonian-like formalism, which is then represented as an answer set program. Relevant commonsense knowledge is additionally imported from resources such as WordNet and represented in ASP. The resulting knowledge-base can then be used to perform reasoning with the help of an ASP system. This approach can facilitate many natural language tasks such as automated question answering, text summarization, and automated question generation. ASP-based representation of techniques such as default reasoning, hierarchical knowledge organization, preferences over defaults, etc., are used to model commonsense reasoning methods required to accomplish these tasks. In this paper, we describe the CASPR system that we have developed to automate the task of answering natural language questions given English text. CASPR can be regarded as a system that answers questions by "understanding" the text and has been tested on the SQuAD data set, with promising results. Copyright © 2021, The Authors. All rights reserved.

关键词： logic programming