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

The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines

引用

theory and practice of logic programming 2012年第1-2期12卷 97-126页

作者： Tarau, Paul Univ N Texas Dept Comp Sci & Engn Denton TX 76203 USA

We describe the BinProlog system's compilation technology, runtime system and its extensions supporting first-class logic Engines while providing a short history of its development, details of some of its newer re-implementations as well as an overview of the most important architectural choices involved in their design. With focus on its differences with conventional Warren Abstract Machine (WAM) implementations, we explain key details of BinProlog's compilation technique, which replaces the WAM with a simplified continuation passing runtime system (the "BinWAM"), based on a mapping of full Prolog to binary logic programs. This is followed by a description of a term compression technique using a "tag-on-data" representation. Later derivatives, the Java-based Jinni Prolog compiler and the recently developed Lean Prolog system refine the BinProlog architecture with first-class logic Engines, made generic through the use of an Interactor interface. An overview of their applications with focus on the ability to express at source level a wide variety of Prolog built-ins and extensions covers these newer developments.

关键词： Prolog logic programming system continuation passing style compilation implementation of Prolog first-class logic engines data-representations for Prolog runtime systems

来源：评论

学校读者我要写书评

暂无评论

An Improved Proof-Theoretic Compilation of logic Programs

引用

theory and practice of logic programming 2012年第4-5期12卷 639-657页

作者： Cervesato, Iliano Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA

In prior work, we showed that logic programming compilation can be given a proof-theoretic justification for generic abstract logic programming languages, and demonstrated this technique in the case of hereditary Harrop formulas and their linear variant. Compiled clauses were themselves logic formulas except for the presence of a second-order abstraction over the atomic goals matching their head. In this paper, we revisit our previous results into a more detailed and fully logical justification that does away with this spurious abstraction. We then refine the resulting technique to support well-moded programs efficiently.

关键词： Compilation Abstract logic programming Hereditary Harrop Formulas Well-Moded logic Programs

来源：评论

学校读者我要写书评

暂无评论

A design and implementation of the Extended Andorra Model

引用

theory and practice of logic programming 2012年第3期12卷 319-360页

作者： Lopes, Ricardo Costa, Vitor Santos Silva, Fernando Univ Porto CRACS INESC Porto LA P-4169007 Oporto Portugal Univ Porto Fac Ciencias P-4169007 Oporto Portugal

logic programming provides a high-level view of programming, giving implementers a vast latitude into what techniques to explore to achieve the best performance for logic programs. Towards obtaining maximum performance, one of the holy grails of logic programming has been to design computational models that could be executed efficiently and that would allow both for a reduction of the search space and for exploiting all the available parallelism in the application. These goals have motivated the design of the Extended Andorra Model (EAM), a model where goals that do not constrain nondeterministic goals can execute first. In this work, we present and evaluate the Basic design for EAM, a system that builds upon David H. D. Warren's original EAM with Implicit Control. We provide a complete description and implementation of the Basic design for EAM System as a set of rewrite and control rules. We present the major data structures and execution algorithms that are required for efficient execution, and evaluate system performance. A detailed performance study of our system is included. Our results show that the system achieves acceptable base performance and that a number of applications benefit from the advanced search inherent to the EAM.

关键词： logic programming implementation extended Andorra model

来源：评论

学校读者我要写书评

暂无评论

Machines Who Write

引用

IEEE ANNALS OF THE HISTORY OF COMPUTING 2013年第2期35卷 88-+页

作者： Dick, Stephanie Harvard Univ Dept Hist Sci Cambridge MA 02138 USA

In 1936, Alan Turing remarked that 'computing is normally done by writing certain symbols on paper.' Although computing was then the prerogative of human computers, Turing imagined that machines might calculate by writing as well. Turing intended for this notional machine to be analogous to human computers who calculated by writing and manipulating symbols, relying on paper to augment their memories. But to what extent is Turing's machine actually writing and reading like a human computer? Recent scholarship in the history of mathematics has argued that mathematical thinking and practice are inextricably entwined with the historical development of different cultures and systems of writing. Looking at computer writing as writing directs historical attention away from abstract formal representations of hardware and software and toward the materiality of data--how it is inscribed and configured within specific digital media. [ABSTRACT FROM PUBLISHER]

关键词： Alan Turing Alfred North Whitehead Allen Newell automated theorem proving Bertrand Russell book history Computers Herbert Simon history of computing history of mathematics John Clifford Shaw logic theory Machine Mathematics media history Principia Mathematica programming RAND Johnniac Turing machines Writing

来源：评论

学校读者我要写书评

暂无评论

SICStus Prolog-The first 25 years

引用

theory and practice of logic programming 2012年第1-2期12卷 35-66页

作者： Carlsson, Mats Mildner, Per SICS SE-16429 Kista Sweden

SICStus Prolog has evolved for nearly 25 years. This is an appropriate point in time for revisiting the main language and design decisions, and try to distill some lessons. SICStus Prolog was conceived in a context of multiple, conflicting Prolog dialect camps and a fledgling standardization effort. We reflect on the impact of this effort and role model implementations on our development. After summarizing the development history, we give a guided tour of the system anatomy, exposing some designs that were not published before. We give an overview of our new interactive development environment, and describe a sample of key applications. Finally, we try to identify key good and not so good design decisions.

关键词： Prolog logic programming system virtual machine compilers memory management

来源：评论

学校读者我要写书评

暂无评论

Contextual hypotheses and semantics of logic programs

引用

theory and practice of logic programming 2012年第6期12卷 843-887页

作者： Martin, Eric A. Univ New S Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia

logic programming has developed as a rich field, built over a logical substratum whose main constituent is a nonclassical form of negation, sometimes coexisting with classical negation. The field has seen the advent of a number of alternative semantics, with Kripke-Kleene semantics, the well-founded semantics, the stable model semantics, and the answer-set semantics standing out as the most successful. We show that all aforementioned semantics are particular cases of a generic semantics, in a framework where classical negation is the unique form of negation and where the literals in the bodies of the rules can be 'marked' to indicate that they can be the targets of hypotheses. A particular semantics then amounts to choosing a particular marking scheme and choosing a particular set of hypotheses. When a literal belongs to the chosen set of hypotheses, all marked occurrences of that literal in the body of a rule are assumed to be true, whereas the occurrences of that literal that have not been marked in the body of the rule are to be derived in order to contribute to the firing of the rule. Hence the notion of hypothetical reasoning that is presented in this framework is not based on making global assumptions, but more subtly on making local, contextual assumptions, taking effect as indicated by the chosen marking scheme on the basis of the chosen set of hypotheses. Our approach offers a unified view on the various semantics proposed in logic programming, classical in that only classical negation is used, and links the semantics of logic programs to mechanisms that endow rule-based systems with the power to harness hypothetical reasoning.

关键词： Kripke-Kleene semantics answer-set semantics stable model semantics well-founded semantics classical negation contextual hypotheses hypothetical reasoning

来源：评论

学校读者我要写书评

暂无评论

Module theorem for the general theory of stable models

引用

theory and practice of logic programming 2012年第4-5期12卷 719-735页

作者： Babb, Joseph Lee, Joohyung Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85287 USA

The module theorem by Janhunen et al. demonstrates how to provide a modular structure in answer set programming, where each module has a well-defined input/output interface which can be used to establish the compositionality of answer sets. The theorem is useful in the analysis of answer set programs, and is a basis of incremental grounding and reactive answer set programming. We extend the module theorem to the general theory of stable models by Ferraris et al. The generalization applies to non-ground logic programs allowing useful constructs in answer set programming, such as choice rules, the count aggregate, and nested expressions. Our extension is based on relating the module theorem to the symmetric splitting theorem by Ferraris et al. Based on this result, we reformulate and extend the theory of incremental answer set computation to a more general class of programs.

关键词： answer set programming module theorem splitting theorem

来源：评论

学校读者我要写书评

暂无评论

The language features and architecture of B-Prolog

引用

theory and practice of logic programming 2012年第1-2期12卷 189-218页

作者： Zhou, Neng-Fa CUNY Dept Comp & Informat Sci Brooklyn Coll New York NY 10021 USA CUNY Grad Ctr New York NY 10021 USA

B-Prolog is a high-performance implementation of the standard Prolog language with several extensions including matching clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative loop constructs, and tabling. The B-Prolog system is based on the Tree-Oriented Abstract Machine (TOAM) architecture which differs from the Warren Abstract Machine (WAM) mainly in that (1) arguments are passed old fashionedly through the stack, (2) only one frame is used for each predicate call, and (3) instructions are provided for encoding matching trees. The most recent architecture, called TOAM Jr., departs further from the WAM in that it employs no registers for arguments or temporary variables, and provides variable-size instructions for encoding predicate calls. This paper gives an overview of the language features and a detailed description of the TOAM Jr. architecture, including architectural support for action rules and tabling.

关键词： Prolog logic programming system

来源：评论

学校读者我要写书评

暂无评论

On the implementation of GNU Prolog

引用

theory and practice of logic programming 2012年第1-2期12卷 253-282页

作者： Diaz, Daniel Abreu, Salvador Codognet, Philippe Univ Paris 01 F-75013 Paris France Univ Evora P-7004516 Evora Portugal Centria FCT UNL P-7004516 Evora Portugal Univ Tokyo JFLI CNRS Tokyo Japan

GNU Prolog is a general-purpose implementation of the Prolog language, which distinguishes itself from most other systems by being, above all else, a native-code compiler which produces stand-alone executables which do not rely on any bytecode emulator or meta-interpreter. Other aspects which stand out include the explicit organization of the Prolog system as a multipass compiler, where intermediate representations are materialized, in Unix compiler tradition. GNU Prolog also includes an extensible and high-performance finite-domain constraint solver, integrated with the Prolog language but implemented using independent lower-level mechanisms. This paper discusses the main issues involved in designing and implementing GNU Prolog: requirements, system organization, performance, and portability issues as well as its position with respect to other Prolog system implementations and the ISO standardization initiative.

关键词： Prolog logic programming system GNU ISO WAM native code compilation finite-domain constraints

来源：评论

学校读者我要写书评

暂无评论

An overview of Ciao and its design philosophy

引用

theory and practice of logic programming 2012年第1-2期12卷 219-252页

作者： Hermenegildo, M. V. Bueno, F. Carro, M. Lopez-Garcia, P. Mera, E. Morales, J. F. Puebla, G. Univ Politecn Madrid Fac Informat E-28660 Madrid Spain Madrid Inst Adv Studies Software Dev Technol IMDE Madrid 28660 Spain Spanish Res Council Madrid 28006 Spain Univ Complutense Madrid Fac Informat E-28040 Madrid Spain

We provide an overall description of the Ciao multiparadigm programming system emphasizing some of the novel aspects and motivations behind its design and implementation. An important aspect of Ciao is that, in addition to supporting logic programming (and, in particular, Prolog), it provides the programmer with a large number of useful features from different programming paradigms and styles and that the use of each of these features (including those of Prolog) can be turned on and off at will for each program module. Thus, a given module may be using, e. g., higher order functions and constraints, while another module may be using assignment, predicates, Prolog meta-programming, and concurrency. Furthermore, the language is designed to be extensible in a simple and modular way. Another important aspect of Ciao is its programming environment, which provides a powerful preprocessor (with an associated assertion language) capable of statically finding non-trivial bugs, verifying that programs comply with specifications, and performing many types of optimizations (including automatic parallelization). Such optimizations produce code that is highly competitive with other dynamic languages or, with the (experimental) optimizing compiler, even that of static languages, all while retaining the flexibility and interactive development of a dynamic language. This compilation architecture supports modularity and separate compilation throughout. The environment also includes a powerful autodocumenter and a unit testing framework, both closely integrated with the assertion system. The paper provides an informal overview of the language and program development environment. It aims at illustrating the design philosophy rather than at being exhaustive, which would be impossible in a single journal paper, pointing instead to previous Ciao literature.

关键词： Prolog logic programming system assertions verification extensible languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：