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

How to Build Your Own ASP-based System?!

THEORY AND PRACTICE OF LOGIC programming 2023年第1期23卷 299-361页

作者： Kaminski, Roland Romero, Javier Schaub, Torsten Wanko, Philipp Univ Potsdam Potsdam Germany

Answer Set programming, or ASP for short, has become a popular and sophisticated approach to declarative problem solving. Its popularity is due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science. However, in contrast to ASP's ease of use, the high degree of sophistication of the underlying technology makes it even hard for ASP experts to put ideas into practice whenever this involves modifying ASP's machinery. For addressing this issue, this tutorial aims at enabling users to build their own ASP-based systems. More precisely, we show how the ASP system clingo can be used for extending ASP and for implementing customized special-purpose systems. To this end, we propose two alternatives. We begin with a traditional AI technique and show how metaprogramming can be used for extending ASP. This is a rather light approach that relies on clingo's reification feature to use ASP itself for expressing new functionalities. The second part of this tutorial uses traditional programming (in Python) for manipulating clingo via its application programming interface. This approach allows for changing and controlling the entire model-ground-solve workflow of ASP. Central to this is clingo's new Application class that allows us to draw on clingo's infrastructure by customizing processes similar to the one in clingo. For instance, we may apply manipulations to programs' abstract syntax trees, control various forms of multi-shot solving, and set up theory propagators for foreign inferences. A cross-sectional structure, spanning meta as well as application programming, is clingo's intermediate format, aspif, that specifies the interface among the underlying grounder and solver. We illustrate the aforementioned concepts and techniques throughout this tutorial by means of examples and several nontrivial case studies. In particular, we show how clingo can be extended by difference constraints

关键词： Answer Set programming Answer Set Systems meta programming Answer Set Solving modulo Theories

来源：评论

学校读者我要写书评

暂无评论

Supporting software development through declaratively codified programming patterns

引用

EXPERT SYSTEMS WITH APPLICATIONS 2002年第4期23卷 405-413页

作者： Mens, K Michiels, I Wuyts, R Free Univ Brussels Programming Technol Lab B-1050 Brussels Belgium Catholic Univ Louvain Dept Ingn Informat B-1348 Louvain Belgium Univ Bern Inst Informat Software Composit Grp CH-3012 Bern Switzerland

In current-day software development, programmers often use programming patterns to clarify their intents and to increase the understandability of their programs. Unfortunately, most software development environments do not adequately support the declaration and use of such patterns. To explicitly codify these patterns, we adopt a declarative meta programming approach. In this approach, we reify the structure of a (object-oriented) program in terms of logic clauses. We declare programming patterns as logic rules on top of these clauses. By querying the logic system, these rules allow us to check, enforce and search for occurrences of certain patterns in the software. As such, the programming patterns become an active part of the software development and maintenance environment. (C) 2002 Elsevier Science Ltd. All rights reserved.

关键词： programming patterns logic programming meta programming tool support object-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Agenda control for heterogeneous reasoners

引用

JOURNAL OF LOGIC AND ALGEBRAIC programming 2005年第1期62卷 41-69页

作者： Stolle, R Hogan, A Bradley, E PARC Palo Alto CA 94304 USA Univ Calif Berkeley Dept Math Berkeley CA 94720 USA Univ Colorado Dept Comp Sci Boulder CO 80309 USA

As artificial intelligence techniques are maturing and being deployed in large applications, the problem of specifying control and reasoning strategies is regaining attention. Complex AI systems tend to comprise a suite of modules, each of which is capable of solving a different aspect of the overall problem, and each of which may incorporate a different reasoning paradigm. The orchestration of such heterogeneous problem solvers can be divided into two subproblems: (1) When and how are various reasoning modes invoked? and (2) How is information passed between various reasoning modes? In this paper, we explore some solutions to this problem. In particular, we describe a logic programming system that is based on three ideas: equivalence of declarative and operational semantics, declarative specification of control information, and smoothness of interaction with nonlogic-based programs. meta-level predicates are used to specify control information declaratively, compensating for the absence of procedural constructs that usually facilitate formulation of efficient programs. Knowledge that has been derived in the course of the current inference process can at any time be passed to non-logic-based program modules. Traditional SLD inference engines maintain only the linear path to the current state in the SLD search tree: fonnulae that have been proved on this path are implicitly represented in a stack of recursive calls to the inference engine, and formulae that have been proved on previous, unsuccessful paths are lost altogether. In our system, previously proved formulae are maintained explicitly and therefore can be passed to other reasoning modules. As an application example, we show how this inference system acts as the knowledge representation and reasoning framework of PRET-a program that automates system identification. (C) 2003 Elsevier Inc. All rights reserved.

关键词： automated reasoning reasoning architectures meta architectures meta control meta programming reasoning strategies logic programming declarative programming

来源：评论

学校读者我要写书评

暂无评论

An update calculus for expressing type-safe program updates

引用

SCIENCE OF COMPUTER programming 2007年第2-3期67卷 199-222页

作者： Erwig, Martin Ren, Deling Oregon State Univ Sch EECS Corvallis OR 97331 USA

The dominant share of software development costs is spent on software maintenance, particularly the process of updating programs in response to changing requirements. Currently, such program changes tend to be performed using text editors, an unreliable method that often causes many errors. In addition to syntax and type errors, logical errors can be easily introduced since text editors cannot guarantee that changes are performed consistently over the whole program. All these errors can cause a correct and perfectly running program to become instantly unusable. It is not surprising that this situation exists because the "text-editor method" reveals a low-level view of programs that fails to reflect the structure of programs. We address this problem by pursuing a programming-language-based approach to program updates. To this end we discuss in this paper the design and requirements of an update language for expressing update programs. We identify as the essential part of any update language a scope update that performs coordinated update of the definition and all uses of a symbol. As the underlying basis for update languages, we define an update calculus for updating lambda calculus programs. We develop a type system for the update calculus that infers the possible type changes that can be caused by an update program. We demonstrate that type-safe update programs that fulfill certain structural constraints preserve the type correctness of lambda terms. The update calculus can serve as a basis for higher-level update languages, such as for Haskell or Java. (c) 2007 Elsevier B.V. All rights reserved.

关键词： program transformation meta programming type safety refactoring software evolution

来源：评论

学校读者我要写书评

暂无评论

Typed query languages for databases containing queries

引用

INFORMATION SYSTEMS 1999年第7期24卷 569-595页

作者： Neven, F Van den Bussche, J Van Gucht, D Vossen, G Limburgs Univ Ctr B-3590 Diepenbeek Belgium Indiana Univ Dept Comp Sci Bloomington IN 47408 USA Univ Munster Inst Informat D-48161 Munster Germany

This paper introduces and studies the relational meta algebra, a statically typed extension of the relational algebra to allow for meta programming in databases. In this meta algebra one can manipulate database relations involving not only stored data values (as in classical relational databases) but also stored relational algebra expressions. Topics discussed include modeling of advanced database applications involving "procedural data";desirability as well as limitations of a strict typing discipline in this context;equivalence with a first-order calculus;and global expressive power and non-redundancy of the proposed formalism. (C) 1999 Elsevier Science Ltd. All rights reserved.

关键词： databases query languages stored procedures meta programming

来源：评论

学校读者我要写书评

暂无评论

Inter-language reflection: A conceptual model and its implementation

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2006年第2-3期32卷 109-124页

作者： Gybels, K Wuyts, R Ducasse, S D'Hondt, M Vrije Univ Brussels Brussels Belgium Univ Libre Bruxelles Brussels Belgium Univ Savoie LISTIC Savoie France Univ Sci & Technol Lille Villeneuve Dascq France

meta programming is the act of reasoning about a computational system. For example, a program in Prolog can reason about a program written in Smalltalk. Reflection is a more powerful form of meta programming where the same language is used to reason about, and act upon, itself in a causally connected way. Thus on the one hand we have meta programming that allows different languages or paradigms to be used, but without causal connection, while on the other hand we have reflection that offers causal connection but only for a single language. This paper combines both and presents inter-language reflection that allows one language to reason about and change in a causally connected way another language and vice versa. The fundamental aspects of inter-language reflection and the language symbiosis used therein, are discussed. Moreover the implementation of two symbiotic reflective languages is discussed: Agora/Java and SOUL/Smalltalk. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： meta programming reflection linguistic symbiosis inter-language reflection

来源：评论

学校读者我要写书评

暂无评论

User-driven modelling: Visualisation and systematic interaction for end-user programming

引用

JOURNAL OF VISUAL LANGUAGES AND COMPUTING 2012年第6期23卷 354-379页

作者： Hale, Peter Solomonides, Anthony E. Beeson, Ian Univ W England Bristol BS16 1QY Avon England

This research enables computer literate engineers to model problems in software by minimising code they need to write. Software development is difficult for many engineers as they may have no time, experience, or access to software development tools necessary to model their problems. Using a combination of modelling via use of formulae (equations) and visualisation of the way these formulae interact, it is possible to construct modelling software without requiring code. This technique of user-driven modelling/programming (UDM/P) could be applied to any problem that requires linked equations to be represented and tracked, and results from these calculated. End-user programming could be tackled by many researchers co-operating to create specific solutions to different kinds of end-user programming problems. A stepped ontology based translation process assists with progress towards a generic solution, this is first applied to engineering modelling. (c) 2012 Elsevier Ltd. All rights reserved.

关键词： Visual programming Visualisation Translation Transformation meta programming Cost modelling Modelling Decision support Design Manufacture User-driven modelling Semantic Web Ontologies End-user programming

来源：评论

学校读者我要写书评

暂无评论

A SELF-APPLICABLE PARTIAL EVALUATOR AND ITS USE IN INCREMENTAL COMPILATION

引用

NEW GENERATION COMPUTING 1988年第2-3期6卷 91-118页

作者： FUJITA, H FURUKAWA, K 1. ICOT Research Center Institute for New Generation Computer Technology 1-4-28 Mita Minato-ku 108 Tokyo Japan

This paper presents an experimental implementation of a self-applicable partial evaluator in Prolog used for compiler generation and compiler generator generation. The partial evaluator is an extension of a simple meta interpreter for Prolog programs, and its self-application is straightforward because of its simplicity. A method of incremental compilation is also described as a promising application of the partial evaluator for knowledge-based systems.

关键词： Partial Evaluation Self-Application Logic programming meta programming Compilation Compiler Compiler Generator Incremental Compilation

来源：评论

学校读者我要写书评

暂无评论

COMPETITIVE PARTIAL EVALUATION - SOME REMAINING PROBLEMS OF PARTIAL EVALUATION

引用

NEW GENERATION COMPUTING 1988年第2-3期6卷 259-277页

作者： TAKEUCHI, A FUJITA, H INST NEW GENERAT COMP TECHNOL ICOT RES CTRMINATO KUTOKYO 108JAPAN

This paper discusses the remaininig problems of partial evaluation, comparing competitive partial evaluation to expert programmers who are able to improve programs very effectively. Two case studies of medium size examples are presented to show how to obtain maximal speedup and global control of partial evaluation respectively. These studies are expected to suggest the direction of future research towards everyday-use partial evaluation.

关键词： Partial Evaluation Logic programming meta programming Optimization

来源：评论

学校读者我要写书评

暂无评论

Answer Set Programs with Queries over Subprograms 14th

Answer Set Programs with Queries over Subprograms

引用

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

作者： Redl, Christoph Tech Univ Wien Inst Informat Syst Favoritenstr 9-11 A-1040 Vienna Austria

ISBN: (纸本)9783319616605;9783319616599

Answer-Set programming (ASP) is a declarative programming paradigm. In this paper we discuss two related restrictions and present a novel modeling technique to overcome them: (1) meta-reasoning about the collection of answer sets of a program is in general only possible by external postprocessing, but not within the program. This prohibits the direct continuation of reasoning based on the answer to the query over a (sub) program's answer sets. (2) The saturation programming technique exploits the minimality criterion for answer sets of a disjunctive ASP program to solve co-NP-hard problems, which typically involve checking if a property holds for all objects in a certain domain. However, the technique is advanced and not easily applicable by average ASP users;moreover, the use of default-negation within saturation encodings is limited. In this paper, we present an approach which allows for brave and cautious query answering over normal subprograms within a disjunctive program in order to address restriction (1). The query answer is represented by a dedicated atom within each answer set of the overall program, which paves the way also for a more intuitive alternative to saturation encodings and allows also using default-negation within such encodings, which addresses restriction (2).

关键词： Answer Set programming Nonmonotonic reasoning FLP semantics meta programming Saturation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：