A PROLOG program for the generation of molecular formulas

1990 ◽  
Vol 67 (3) ◽  
pp. 234 ◽  
Author(s):  
B. Mendez ◽  
J. A. Moreno
Keyword(s):  
Prolog Program

Representation and matching of chemical structures by a Prolog program

1989 ◽  
Vol 29 (2) ◽  
pp. 51-60 ◽  
Author(s):  
Joseph L. Armstrong ◽  
D. Brynn Hibbert
Keyword(s):  
Prolog Program ◽  
Chemical Structures

scholarly journals Logic + control: On program construction and verification

2017 ◽  
Vol 18 (1) ◽  
pp. 1-29
Author(s):  
WŁODZIMIERZ DRABENT
Keyword(s):  
Logic Program ◽  
Practical Importance ◽  
Operational Semantics ◽  
Program Transformations ◽  
Logic Programs ◽  
Formal Reasoning ◽  
Prolog Program ◽  
Logic Control ◽  
Sat Solver ◽  
Program Construction

AbstractThis paper presents an example of formal reasoning about the semantics of a Prolog program of practical importance (the SAT solver of Howe and King). The program is treated as a definite clause logic program with added control. The logic program is constructed by means of stepwise refinement, hand in hand with its correctness and completeness proofs. The proofs are declarative – they do not refer to any operational semantics. Each step of the logic program construction follows a systematic approach to constructing programs which are provably correct and complete. We also prove that correctness and completeness of the logic program is preserved in the final Prolog program. Additionally, we prove termination, occur-check freedom and non-floundering.Our example shows how dealing with “logic” and with “control” can be separated. Most of the proofs can be done at the “logic” level, abstracting from any operational semantics.The example employs approximate specifications; they are crucial in simplifying reasoning about logic programs. It also shows that the paradigm of semantics-preserving program transformations may be not sufficient. We suggest considering transformations which preserve correctness and completeness with respect to an approximate specification.

scholarly journals PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking

2004 ◽  
Vol 4 (3) ◽  
pp. 371-380 ◽  
Author(s):  
MAURICE BRUYNOOGHE
Keyword(s):  
Search Algorithm ◽  
Search Space ◽  
Prolog Program ◽  
Dead End ◽  
Intelligent Backtracking ◽  
Search Program ◽  
Simple Search

This paper illustrates how a Prolog program, using chronological backtracking to find a solution in some search space, can be enhanced to perform intelligent backtracking. The enhancement crucially relies on the impurity of Prolog that allows a program to store information when a dead end is reached. To illustrate the technique, a simple search program is enhanced.

scholarly journals A Statistical Analysis and Datamining Approach for Wind Speed Predication

2014 ◽  
Vol 14 (2) ◽  
pp. 5464-5478
Author(s):  
Mahesh K ◽  
Dr M V Vijayakumar ◽  
Gangadharaiah. Y.H .
Keyword(s):  
Wind Speed ◽  
Wind Power ◽  
Wind Farms ◽  
Predictive Performance ◽  
Power Industry ◽  
New Paradigm ◽  
Prolog Program ◽  
Wind Speed Data ◽  
Wind Power Industry ◽  
Intelligent Technology

The wind power industry has seen an unprecedented growth in last few years. The surge in orders for wind turbines has resulted in a producers market. This market imbalance, the relative immaturity of the wind industry, and rapid developments in data processing technology have created an opportunity to improve the performance of wind farms and change misconceptions surrounding their operations. This research offers a new paradigm for the wind power industry, data-driven modeling. Each wind Mast generates extensive data for many parameters, registered as frequently as every minute. As the predictive performance approach is novel to wind industry, it is essential to establish a viable research road map. This paper proposes a data-mining-based methodology for long term wind forecasting (ANN), which is suitable to deal with large real databases. The paper includes a case study based on a real database of five years of wind speed data for a site and discusses results of wind power density was determined by using the Weibull and Rayleigh probability density functions. Wind speed predicted using wind speed data with Datamining methodology using intelligent technology as Artificial Neural Networks (ANN) and a PROLOG program designed to calculate the monthly mean wind speed.

scholarly journals PROLOG & TXL: A Case Study for Prototyping Structural Testing Supporting Tools

2002 ◽  
Vol 5 (1) ◽  
Author(s):  
Tatiana Sugeta ◽  
Adenilso da Silva Simao ◽  
Jose Carlos Maldonado ◽  
Maria Carolina Monard
Keyword(s):  
Data Flow ◽  
Structural Testing ◽  
Test Case ◽  
Prolog Program ◽  
Main Ideas ◽  
Testing Criteria ◽  
Program Graph

Structured testing criteria are usually used to assess the adequacy of test case sets, defining coverage measures. Control and data flow based criteria employ information about the program graph as well as definition and usage of variables to establish the testing requirements. In this paper, we present an approach to prototype supporting tools for control and data flow based criteria. In the proposed approach, we use TXL — a language based in the transformational paradigm — to analyze and instrument the program under test. The instrumentation aims at making it possible to process the data by a Prolog program which allows the tester to assess the test case set adequacy. A simple example is used to illustrate the main ideas of our approach.

scholarly journals Theoretical foundations of the organization of branches and repetitions in programs in the logic programming language Prolog

2021 ◽  
Vol 21 (2) ◽  
pp. 200-206
Author(s):  
D. V. Zdor
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Programming Language ◽  
Educational Process ◽  
Prolog Program ◽  
Logic Programming Language ◽  
Technological Basis ◽  
Program Testing ◽  
Logical Language ◽  
Logical Programming

Introduction. The organization of branches and repetitions in the context of logical programming is considered by an example of the Prolog language. The fundamental feature of the program in a logical programming language is the fact that a computer must solve a problem by reasoning like a human. Such a program contains a description of objects and relations between them in the language of mathematical logic. At the same time, the software implementation of branching and repetition remains a challenge in the absence of special operators for the indicated constructions in the logical language. The objectives of the study are to identify the most effective ways to solve problems using branching and repetition by means of the logic programming language Prolog, as well as to demonstrate the results obtained by examples of computational problems.  Materials and Methods. An analysis of the literature on the subject of the study was carried out. Methods of generalization and systematization of knowledge, of the program testing, and analysis of the program execution were used.  Results. Constructions of branching and repetition organization in a Prolog program are proposed. To organize repetitions, various options for completing a recursive cycle when solving problems are given.  Discussion and Conclusions. The methods of organizing branches and repetitions in the logic programming language Prolog are considered. All these methods are illustrated by examples of solving computational problems. The results obtained can be used in the further development of the recursive predicates in logical programming languages, as well as in the educational process when studying logical programming in the Prolog language. The examples of programs given in the paper provide using them as a technological basis for programming branches and repetitions in the logic programming language Prolog.

scholarly journals A Tabled Prolog Program for Solving Sokoban

2013 ◽  
Vol 124 (4) ◽  
pp. 561-575 ◽  
Author(s):  
Neng-Fa Zhou ◽  
Agostino Dovier
Keyword(s):  
Prolog Program

A Parallel Incremental Architecture for Prolog Program Execution

1991 ◽  
pp. 133-142
Author(s):  
Alessandro De Gloria ◽  
Paolo Faraboschi ◽  
Elio Guidetti
Keyword(s):  
Program Execution ◽  
Prolog Program
Sign in / Sign up

Export Citation Format

Share Document