Set constraints with intersection

DOI10.1006/inco.2001.2952zbMath1096.68023OpenAlexW2180114379MaRDI QIDQ2506490

Andreas Podelski, Witold Charatonik

Publication date: 10 October 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.2952

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Tree tuple languages from the logic programming point of view ⋮ Tree automata with one memory set constraints and cryptographic protocols ⋮ Unification modulo ACUI plus distributivity axioms ⋮ A Scalable Inclusion Constraint Solver Using Unification

Cites Work

• Rational spaces and set constraints
• Set constraints and logic programming
• Set constraints in some equational theories
• A feature constraint system for logic programming with entailment
• Syntacticness, cycle-syntacticness and shallow theories
• Haskell overloading is DEXPTIME-complete
• Decidability of systems of set constraints with negative constraints
• Generalized definite set constraints
• Records for logic programming
• Paths vs. trees in set-based program analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Set constraints with intersection