641 search results - page 16 / 129 » Embedding Finite Sets in a Logic Programming Language |
ISOLA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
ENTCS
2000
13 years 8 months ago
2000
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
LFCS
2007
Springer
14 years 2 months ago
2007
Springer
Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to sets of clauses in the language admitting negations in the bodies a special kind of mode...
CICLING
2003
Springer
14 years 1 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
ACSD
2008
IEEE
13 years 10 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...