Sciweavers

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

11

TAPSOFT
1997
Springer

favoriteEmaildiscussreport

149views Software Engineering» more TAPSOFT 1997»

Inclusion Constraints over Non-empty Sets of Trees

13 years 8 months ago

Inclusion Constraints over Non-empty Sets of Trees

Download www.ps.uni-saarland.de

Abstract. We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 t2 between rst-order terms (without set operators) which are interpreted over non-empty sets of trees. The existing systems of set constraints can express INES constraints only if they include negation. Their satis ability problem is NEXPTIME-complete. We present an incremental algorithm that solves the satis ability problem of INES constraints in cubic time. We intend to apply INES constraints for type analysis for a concurrent constraint programming language.

Martin Müller, Joachim Niehren, Andreas Podel

Real-time Traffic

INES Constraints | Satis Ability Problem | Set Constraints | Software Engineering | TAPSOFT 1997 |

claim paper

Related Content

» Deciding inclusion of set constants over infinite nonstrict data structures

» Indexes and Path Constraints in Semistructured Data

» Entailment of Atomic Set Constraints is PSPACEComplete

» Lossless Data Compression via Substring Enumeration

» Classification Models with Global Constraints for Ordinal Data

» Constraint Automata and the Complexity of Recursive Subtype Entailment

» Representing Trees with Constraints

» Tree pattern mining with tree automata constraints

» SetBased Failure Analysis for Logic Programs and Concurrent Constraint Programs

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	TAPSOFT
Authors	Martin Müller, Joachim Niehren, Andreas Podelski

Comments (0)