Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CSL
2004
Springer

favoriteEmaildiscussreport

94views Automated Reasoning» more CSL 2004»

Set Constraints on Regular Terms

13 years 10 months ago

Set Constraints on Regular Terms

Download www.ii.uni.wroc.pl

Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of ﬁnite terms. However, some logic languages allow inﬁnite regular terms, so it seems natural to consider set constraints over this domain. In the paper we show that the satisﬁability problem of set constraints over regular terms is undecidable. We also show that, if each function symbol has the arity at most 1, then this problem is EXPSPACE-complete.

Pawel Rychlikowski, Tomasz Truderung

Real-time Traffic

CSL 2004 | Inﬁnite Regular Terms | Regular Terms | Set Constraints |

claim paper

Related Content

» Towards Parameterized Regular Type Inference Using Set Constraints

» Query Aspect Based Term Weighting Regularization in Information Retrieval

» SPIRIT Sequential Pattern Mining with Regular Expression Constraints

» An adaptive segmentationbased regularization term for image restoration

» A Geometric Approach for Regularization of the Data Term in StereoVision

» Predecessor Sets of Dynamic Pushdown Networks with TreeRegular Constraints

» Computing the edit distance of a regular language

» Inducing Constructor Systems from ExampleTerms by Detecting Syntactical Regularities

» Effective Level Set Image Segmentation With a Kernel Induced Data Term

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	CSL
Authors	Pawel Rychlikowski, Tomasz Truderung

Comments (0)