A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
String pattern-matching in Prolog
1988
Computer languages
Preserved Fulltext
A pattern-matching feature for the Prolog language is described. ...
Through the use of patterns, introduced as Prolog predicates, the feature favors the specification of string handling algorithms in a declarative style. ...
Snl) & A call to match has the form "match(S, P)", where S is either a Prolog variable or a Prolog string constant and P is a pattern-expression. ...
doi:10.1016/0096-0551(88)90022-7
fatcat:nctgn5pbbrf4rkcvz7wk2vwa3y
The poor man's proof assistant
2013
Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity - SPLASH '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
I describe tools developed in Prolog to partially characterize the shuffle-inclusion problem. These tools allowed for rapid development of proofs with little intellectual overhead. ...
While proving a theorem from a set of axioms is undecidable in first order logic, recent development has produced several tools which serve as automated theorem provers. ...
Definite clause grammars The task of matching a set of strings against a given "pattern" arose frequently. DCG's provided a useful tool for expressing such patterns. ...
doi:10.1145/2508075.2508088
dblp:conf/oopsla/Eremondi13
fatcat:lmtuc2emeva7plnncu37kycyz4
My first look at picat as a modeling language for constraint solving and planning
2014
The 26th Chinese Control and Decision Conference (2014 CCDC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
PATTERN MATCHING Pattern matching is Picat is more influenced by pattern matching in functional programming than by Prolog's unification. This may confuse some programmers with a Prolog background. ...
Here is a definition of quick sort which shows some of the pattern matching constructs in Picat. ...
It uses new_map() for creating the map, has_key(S) for checking if pattern S already exists in the map, and put(S,1) to add the pattern S to the map. ...
doi:10.1109/ccdc.2014.6852171
fatcat:5zywjmyimjbgpows4gfifedeti
Spreadsheet Structure Discovery with Logic Programming
2008
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We are implementing structure discovery tools in the logic-programming language Prolog for our spreadsheet analysis program Model Master, by writing grammars for spreadsheet structures. ...
Our term "structure discovery" denotes the recovery of structure, such as the grouping of cells, that was intended by a spreadsheet's author but is not explicit in the spreadsheet. ...
What have we achieved in this section? We have adapted ideas from pattern-matching languages and Prolog DCG grammars to describe structure in spreadsheets. ...
arXiv:0802.3940v1
fatcat:afio6gurffd4jb2jibtqkzpkka
Page 216 of Computational Linguistics Vol. 15, Issue 3
[page]
1989
Computational Linguistics
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The theory employs pattern matching (unification) as a recognition mechanism. The primary determinant of learning is the frequency with which letter strings are encountered in the text. ...
01-0024
From English to Prolog via Discourse Representation Theory
Covington, M.; Nute, D.; Schmitz, N.; and Goodman, D.
01-0025
READ.PRO: A Pattern Matching Approach to Perceptual Learning in Reading ...
Logol: Expressive Pattern Matching in Sequences. Application to Ribosomal Frameshift Modeling
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This article introduces Logol, a new application designed to achieve pattern matching in possibly large sequences with customized biological patterns. ...
Most of the current practice of pattern matching tools is oriented towards finding efficient ways to compare sequences. ...
Sequence Analysis Pattern matching is performed in two stages. ...
doi:10.1007/978-3-319-09192-1_4
fatcat:himy54zurfemxjwds3pb5px47u
Page 59 of Journal of Research and Practice in Information Technology Vol. 15, Issue 2
[page]
1983
Journal of Research and Practice in Information Technology
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The single most common opera- tion performed on Prolog data structures is pattern match- ing. ...
PATTERN MATCHING AND UNIFICATION
Unification is not just a simple pattern matching operation. ...
Automating Inference of OCL Business Rules from User Scenarios
2013
2013 20th Asia-Pacific Software Engineering Conference (APSEC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In this sense this paper provides a first set of invariant inference patterns that are applied on valid and invalid snapshots in order to generate OCL (Object Constraint Language) integrity constraints ...
The approach is realized with a prolog-based tool that could support the designer to effectively define OCL integrity constraints in a semi-automatic way. ...
The OCL template is illustrated as in Fig. 5. 4 ) Pattern Matching. ...
doi:10.1109/apsec.2013.31
dblp:conf/apsec/DangC13
fatcat:ekd7pv2mvfaz5cg6majytxdj7m
Retrieval from hierarchical texts by partial patterns
1993
Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Define
the cost of pattern
P in T be the
minimum
of the cost of label
a and the costs of any
string
appearing
in P. ...
The ordering
of patterns
is based on the frequencies
of string
occurrences
in the
database,
which can be easily found in a suitable
index. ...
doi:10.1145/160688.160722
dblp:conf/sigir/KilpelainenM93
fatcat:zjcryfv4bvgnjfk5a6stvaekee
Relational programming with CrocoPat
2006
Proceeding of the 28th international conference on Software engineering - ICSE '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
that involve transitive closures and the detection of patterns in graphs. ...
Many structural analyses of software systems are naturally formalized as relational queries, for example, the detection of design patterns, patterns of problematic design, code clones, dead code, and differences ...
Let us examine a small pattern-matching example. ...
doi:10.1145/1134285.1134420
dblp:conf/icse/Beyer06
fatcat:slsb4hl64vf7jde77u6kjgq6va
Page 137 of Computational Linguistics Vol. 22, Issue 1
[page]
1996
Computational Linguistics
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
It also advocates Prolog as an NLP tool. Chapter 2 offers a pattern-matching approach to NL interfaces to operating systems and databases. ...
English phrase structure 5 6
Parsing algorithms
Semantics, logic, and model theory Further topics in semantics Morphology and the lexicon Review of Prolog
String input and tokenization
Chapter 1 offers ...
Using Prolog for Transforming XML Documents
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1912.10817v1 fatcat:sf6ciobaynbxlhrjtznd3knezm
In order to clarify this position this work proposes a tuProlog-styled interpreter for parsing XML-documents into Prolog-internal lists and vice versa for serialising lists into XML-documents. ...
Proponents of the programming language Prolog share the opinion Prolog is more appropriate for transforming XML-documents as other well-established techniques and languages like XSLT. ...
Pattern-matching can be applied at any position in a Prolog program. The openness of Prolog is of advantage. ...
arXiv:1912.10817v2
fatcat:ipcltqdwo5gzzoewzzxatwjol4
Automata-driven indexing of Prolog clauses
1990
Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Indexing Prolog clauses is an important optimization step that reduces the number of clauses on which unification will be performed and can avoid the pushing of a choice point. ...
However this can cause an enormous increase in running time if indexing is done naively. This paper describes a new technique for indexing that utilizes all the functors in a clause-head. ...
Upon completion of the scan a rule is selected if its counter value equals the number of path strings in it. An idea similar to this was used in [4] for doing tree pattern matching. ...
doi:10.1145/96709.96738
dblp:conf/popl/RameshRW90
fatcat:djyylqhtkfbavofa7pwecaf5by
Yaccscript
2006
Proceedings of the 44th annual southeast regional conference on - ACM-SE 44
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
languages to a common framework, and demonstrates its effectiveness at providing interoperability between object-oriented, functional, and logic programming through implementations of Python, Haskell, and Prolog ...
Each of these syntactic patterns has a corresponding compilation rule, which specifies the code that is to be generated when the pattern is matched. ...
When used as a tokenizer, it returns the longest matching string, and in the event of two tokens of the same length, it chooses whichever regular expression the token matched first. ...
doi:10.1145/1185448.1185598
dblp:conf/ACMse/Healey06
fatcat:v6tujnsuhrh4xmsxckjbiqnuze
Page 31 of Electronic Publishing Vol. 6, Issue 4
[page]
1993
Electronic Publishing
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
| only match a substring of the corresponding string Scrimshaw variables in ¢/
H Any single term
P\P> Any TermList 7,72 such that P; matches T; and Pz matches T>
(P;|P2 ) Any TermList matched by P or P2 ...
Basic Scrimshaw regular expressions and what they match
Regular Expression Matches
Ground term f, containing nei- | An identical term #/, except that each string in ¢ need ther Scrimshaw operators nor ...
« Previous
Showing results 1 — 15 out of 3,710 results