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

Query answering in object oriented knowledge bases in logic programming: Description and challenge for ASP 6

学校读者我要写书评

暂无评论

Query answering in object oriented knowledge bases in logic ...

6th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2013, co-located with the 29th International Conference on logic programming, ICLP 2013

作者： Chaudhri, Vinay K. Heymans, Stijn Wessel, Michael Son, Tran Cao Artificial Intelligence Center SRI International Menlo ParkCA94025 United States Computer Science Department New Mexico State University NM88003 United States

Research on developing efficient and scalable ASP solvers can substantially benefit by the availability of data sets to experiment with. KB Bio 101 contains knowledge from a biology textbook, has been developed as part of Project Halo, and has recently become available for research use. KB Bio 101 is one of the largest KBs available in ASP and the reasoning with it is undecidable in general. We give a description of this KB and ASP programs for a suite of queries that have been of practical interest. We explain why these queries pose significant practical challenges for the current ASP solvers. © 2013 ***. All rights reserved.

关键词： logic programming

Integrative functional statistics in logic programming

学校读者我要写书评

暂无评论

Integrative functional statistics in logic programming

15th International Symposium on Practical Aspects of Declarative Languages, PADL 2013

作者： Angelopoulos, Nicos Santos Costa, Vítor Azevedo, João Wielemaker, Jan Camacho, Rui Wessels, Lodewyk Bioinformatics and Statistics Netherlands Cancer Institute Amsterdam Netherlands Netherlands CRACS-INESC Porto LA Universidade Do Porto 4169-007 Porto Portugal DCC-FCUP Universidade Do Porto Rua do Campo Alegre 1021/1055 4169-007 Porto Portugal LIAAD Faculdade de Engenharia Universidade Do Porto Portugal Vrije Universiteit Amsterdam Netherlands

ISBN: (纸本)9783642452833

We present r..eal , a library that integrates the R statistical environment with Prolog. Due to R's functional programming affinity the interface introduced has a minimalistic feel. Programs utilising the library syntax are elegant and succinct with intuitive semantics and clear integration. In effect, the library enhances logic programming with the ability to tap into the vast wealth of statistical and probabilistic reasoning available in R. The software is a useful addition to the efforts towards the integration of statistical reasoning and knowledge representation within an AI context. Furthermore it can be used to open up new application areas for logic programming and AI techniques such as bioinformatics, computational biology, text mining, psychology and neuro sciences, where R has particularly strong presence. © 2013 Springer-Verlag.

关键词： logic programming

A History of the Oz Multiparadigm Language

学校读者我要写书评

暂无评论

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2020年第HOPL期4卷 1–56页

作者： Van Roy, Peter Haridi, Seif Schulte, Christian Smolka, Gert Catholic Univ Louvain B-1348 Louvain La Neuve Belgium Royal Inst Technol Stockholm Sweden RISE Stockholm Sweden Saarland Univ Saarbrucken Germany

Oz is a programming language designed to support multiple programming paradigms in a clean factored way that is easy to program despite its broad coverage. It started in 1991 as a collaborative effort by the DFKI (Germany) and SICS (Sweden) and led to an influential system, Mozart, that was released in 1999 and widely used in the 2000s for practical applications and education. We give the history of Oz as it developed from its origins in logic programming, starting with Prolog, followed by concurrent logic programming and constraint logic programming, and leading to its two direct precursors, the concurrent constraint model and the Andorra Kernel Language (AKL). We give the lessons learned from the Oz effort including successes and failures and we explain the principles underlying the Oz design. Oz is defined through a kernel language, which is a formal model similar to a foundational calculus, but that is designed to be directly useful to the programmer. The kernel language is organized in a layered structure, which makes it straightforward to write programs that use different paradigms in different parts. Oz is a key enabler for the book Concepts, Techniques, and Models of Computer programming (MIT Press, 2004). Based on the book and the implementation, Oz has been used successfully in university-level programming courses starting from 2001 to the present day.

关键词： Computer programming multiparadigm programming concurrent programming dataflow functional programming logic programming lazy evaluation programming education distributed programming

Fixpoints for the Masses: programming with First-Class Datalog Constraints

学校读者我要写书评

暂无评论

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2020年第OOPSLA期4卷 1–28页

作者： Madsen, Magnus Lhotak, Ondrej Aarhus Univ Dept Comp Sci Abogade 34 DK-8210 Aarhus Denmark Univ Waterloo Cheriton Sch Comp Sci 200 Univ Ave West Waterloo ON N2L 3G1 Canada

Datalog is a declarative logic programming language that has been used in a variety of applications, including big-data analytics, language processing, networking and distributed systems, and program analysis. In this paper, we propose first-class Datalog constraints as a mechanism to construct, compose. and solve Datalog programs at run time. The benefits are twofold: We gain the full power of a functional programming language to operate on Datalog constraints-as-values, while simultaneously we can use Datalog where it really shines: to declaratively express and solve fixpoint problems. We present an extension of the lambda calculus with first-class Datalog constraints, including its semantics and a type system with row polymorphism based on Hindley-Milner. We prove soundness of the type system and implement it as an extension of the Flix programming language.

关键词： functional programming logic programming first-class datalog

From logic to Functional logic Programs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Hanus, Michael Institut für Informatik CAU Kiel Germany

logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable functions into predicates in order to stay in the logic programming framework. Since amalgamated functional logic languages offer flexible as well as efficient evaluation strategies, we propose an opposite approach in this paper. By mapping logic programs into functional logic programs with a transformation based on inferring functional dependencies, we develop a fully automatic transformation which keeps the flexibility of logic programming but can improve computations by reducing infinite search spaces to finite ones. Copyright © 2022, The Authors. All rights reserved.

关键词： logic programming

Exploring Consequences of Privacy Policies with Narrative Generation via Answer Set programming

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Dabral, Chinmaya Tosch, Emma Martens, Chris North Carolina State University United States Northeastern University United States

Informed consent has become increasingly salient for data privacy and its regulation. Entities from governments to for-profit companies have addressed concerns about data privacy with policies that enumerate the conditions for personal data storage and transfer. However, increased enumeration of and transparency in data privacy policies has not improved end-users’ comprehension of how their data might be used: not only are privacy policies written in legal language that users may struggle to understand, but elements of these policies may compose in such a way that the consequences of the policy are not immediately apparent. We present a framework that uses Answer Set programming (ASP) — a type of logic programming — to formalize privacy policies. Privacy policies thus become constraints on a narrative planning space, allowing end-users to forward-simulate possible consequences of the policy in terms of actors having roles and taking actions in a domain. We demonstrate through the example of the Health Insurance Portability and Accountability Act (HIPAA) how to use the system in various ways, including asking questions about possibilities and identifying which clauses of the law are broken by a given sequence of events. Copyright © 2022, The Authors. All rights reserved.

关键词： logic programming

Cosmos: A Comprehensive Framework for Automatically Generating Domain-Oriented Test Suite

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Kalaee, Akram Parsa, Saeed Fathi, Negar School of Computer Engineering Iran University of Science and Technology Tehran16846-13114 Iran

Context: Constraint solvers basically attempt to provide test data satisfying a given path constraint. However, a major difficulty is that fault does not reveal in many cases unless the input data fall in a particular ***: This paper introduces the new concept of domain solver, called COSMOS. COSMOS computes the feasible domain of inputs for a given path constraint. Domain coverage is of great use to evaluate the adequacy of test data used to reveal latent faults, particularly where there are coincidentally correct executions. Such executions degrade spectrum-based fault localization ***: COSMOS splits a path constraint into conjunctions of comparisons. Such a splitting simplifies the constraint solving task to find the regions satisfying a comparison between two expressions of compatible types. After finding a region satisfying a comparison between two expressions, an improved version of an algorithm, update, is used to determine the domain of variables involved in the comparing ***: COSMOS is implemented using the Roslyn compiler and assessed the benefits and costs of our domain solver with some well-known constraint solvers such as CVC4, Yices2, and Z3. Our experiments with an industrial benchmark with 55 constraints show that Domain-solver improves the number of supported data types involved in a constraint and solves100\% of the instances on which the other solvers fail. It also achieves the best accuracy of 84\% compared to existing domain-oriented test suite generation approaches, such as PRT, IP-PRT, DDR, and ***: In comparison with the existing domain-oriented test suite generation methods, COSMOS supports a wide range of data types, from basic to complex. COSMOS generates more accurate subdomains in the desired time than the domain-oriented test suite generation methods. COSMOS is also more effective than the selected constraint solvers in terms of the number of solved constraints. © 2022, The Authors

关键词： logic programming

On Establishing Robust Consistency in Answer Set Programs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Thevapalan, Andre Kern-Isberner, Gabriele Technische Universität Dortmund Dortmund Germany

Answer set programs used in real-world applications often require that the program is usable with different input data. This, however, can often lead to contradictory statements and consequently to an inconsistent program. Causes for potential contradictions in a program are conflicting rules. In this paper, we show how to ensure that a program P remains non-contradictory given any allowed set of such input data. For that, we introduce the notion of conflict-resolving λ-extensions. A conflict-resolving λ-extension for a conflicting rule r is a set λ of (default) literals such that extending the body of r by λ resolves all conflicts of r at once. We investigate the properties that suitable λ-extensions should possess and building on that, we develop a strategy to compute all such conflict-resolving λ-extensions for each conflicting rule in P. We show that by implementing a conflict resolution process that successively resolves conflicts using λ-extensions eventually yields a program that remains non-contradictory given any allowed set of input data. Copyright © 2022, The Authors. All rights reserved.

关键词： logic programming

Verification of Locally Tight Programs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Fandinno, Jorge Lifschitz, Vladimir Temple, Nathan University of Nebraska Omaha United States University of Texas Austin United States

Program completion is a translation from the language of logic programs into the language of first-order theories. Its original definition has been extended to programs that include integer arithmetic, accept input, and distinguish between output predicates and auxiliary predicates. For tight programs, that generalization of completion is known to match the stable model semantics, which is the basis of answer set programming. We show that the tightness condition in this theorem can be replaced by a less restrictive "local tightness" requirement. From this fact we conclude that the proof assistant anthem-p2p can be used to verify equivalence between locally tight programs. Copyright © 2022, The Authors. All rights reserved.

关键词： logic programming