Abstract--A pattern-matching feature for the Prolog language is described. Through the use of patterns, introduced as Prolog predicates, the feature favors the specification f string handling algorithms in a declarative style. A number of convenient pre-defined patterns, adapted from SNOBOL 4, are included. The use of two-level grammars as a paradigm for developing Prolog programs incorporating the pattern-matching feature is also discussed. Logic programming Prolog Pattern-matching String processing SNOBOL 1
The paper focuses on three ideas for solving problems with writing interpreters for the logic progra...
A SNOBOL4 like pattern data type and pattern matching operation were introduced to the Unicon langua...
Although Prolog is (still) the most widely used logic language, it suffers from a number of drawback...
An approach to Prolog programming based on patterns is presented. Two classes of patterns are identi...
This paper presents matching logic, a first-order logic (FOL) variant forspecifying and reasoning ab...
The first Part of the thesis explains from first principles the concept of "logic programming" and ...
We present a method of extracting the programming techniques employed in Prolog programs. Techniques...
The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog pr...
The goal of this paper is to construct a semantic basis for the abstract interpretaion of Prolog pro...
We provide simple conditions which allow us to conclude that in case of several well-known Prolog pr...
Introduction. The organization of branches and repetitions in the context of logical programming is ...
The problem of frequent pattern discovery is defined as the process of searching for patterns such a...
In this paper, we propose a simple module system for Prolog. A minimal set of simple concepts realiz...
The present chapter describes a few standard algorithms used for processing texts
These lecture notes present some basic techniques for: (i) exploring search spaces, (ii) parsing con...
The paper focuses on three ideas for solving problems with writing interpreters for the logic progra...
A SNOBOL4 like pattern data type and pattern matching operation were introduced to the Unicon langua...
Although Prolog is (still) the most widely used logic language, it suffers from a number of drawback...
An approach to Prolog programming based on patterns is presented. Two classes of patterns are identi...
This paper presents matching logic, a first-order logic (FOL) variant forspecifying and reasoning ab...
The first Part of the thesis explains from first principles the concept of "logic programming" and ...
We present a method of extracting the programming techniques employed in Prolog programs. Techniques...
The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog pr...
The goal of this paper is to construct a semantic basis for the abstract interpretaion of Prolog pro...
We provide simple conditions which allow us to conclude that in case of several well-known Prolog pr...
Introduction. The organization of branches and repetitions in the context of logical programming is ...
The problem of frequent pattern discovery is defined as the process of searching for patterns such a...
In this paper, we propose a simple module system for Prolog. A minimal set of simple concepts realiz...
The present chapter describes a few standard algorithms used for processing texts
These lecture notes present some basic techniques for: (i) exploring search spaces, (ii) parsing con...
The paper focuses on three ideas for solving problems with writing interpreters for the logic progra...
A SNOBOL4 like pattern data type and pattern matching operation were introduced to the Unicon langua...
Although Prolog is (still) the most widely used logic language, it suffers from a number of drawback...