About: Set constraint

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematics and theoretical computer science, a set constraint is an equation or an inequation between sets of terms.Similar to systems of (in)equations between numbers, methods are studied for solving systems of set constraints. Different approaches admit different operators (like "∪", "∩", "\", and function application) on sets and different (in)equation relations (like "=", "⊆", and "⊈") between set expressions. Systems of set constraints are useful to describe (in particular infinite) sets of ground terms.They arise in program analysis, abstract interpretation, and type inference.

Property	Value
dbo:abstract	In mathematics and theoretical computer science, a set constraint is an equation or an inequation between sets of terms.Similar to systems of (in)equations between numbers, methods are studied for solving systems of set constraints. Different approaches admit different operators (like "∪", "∩", "\", and function application) on sets and different (in)equation relations (like "=", "⊆", and "⊈") between set expressions. Systems of set constraints are useful to describe (in particular infinite) sets of ground terms.They arise in program analysis, abstract interpretation, and type inference. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/SetConstraintsAbstractInterpretation_svg.svg?width=300
dbo:wikiPageExternalLink	http://citeseer.uark.edu:8080/citeseerx/viewdoc/summary;jsessionid=01CAFC5839497EE6030F707B5B5C9CAA%3Fdoi=10.1.1.47.537 http://theory.stanford.edu/~aiken/publications/papers/csl93.ps http://theory.stanford.edu/~aiken/publications/papers/ic95.ps http://theory.stanford.edu/~uribe/papers/unification.ps.Z http://www.cs.cornell.edu/~kozen/papers/lasc.pdf
dbo:wikiPageID	43536828 (xsd:integer)
dbo:wikiPageLength	8677 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1032093514 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Inequation dbr:Mathematics dbr:Equation_solving dbr:Theoretical_computer_science dbr:Ground_term dbr:Regular_tree_grammar dbr:Term_(logic) dbr:Abstract_interpretation dbc:Formal_languages dbr:Type_inference dbr:File:SetConstraintsAbstractInterpretation_svg.svg
dbp:wikiPageUsesTemplate	dbt:Cite_techreport dbt:Cite_book dbt:Cite_journal dbt:Reflist dbt:Mathlogic-stub dbt:Comp-sci-theory-stub
dcterms:subject	dbc:Formal_languages
gold:hypernym	dbr:Equation
rdfs:comment	In mathematics and theoretical computer science, a set constraint is an equation or an inequation between sets of terms.Similar to systems of (in)equations between numbers, methods are studied for solving systems of set constraints. Different approaches admit different operators (like "∪", "∩", "\", and function application) on sets and different (in)equation relations (like "=", "⊆", and "⊈") between set expressions. Systems of set constraints are useful to describe (in particular infinite) sets of ground terms.They arise in program analysis, abstract interpretation, and type inference. (en)
rdfs:label	Set constraint (en)
owl:sameAs	freebase:Set constraint yago-res:Set constraint wikidata:Set constraint https://global.dbpedia.org/id/mq9S
prov:wasDerivedFrom	wikipedia-en:Set_constraint?oldid=1032093514&ns=0
foaf:depiction	wiki-commons:Special:FilePath/SetConstraintsAbstractInterpretation_svg.svg
foaf:isPrimaryTopicOf	wikipedia-en:Set_constraint
is dbo:wikiPageWikiLink of	dbr:Language_equation dbr:Regular_tree_grammar dbr:Theory_of_pure_equality
is foaf:primaryTopic of	wikipedia-en:Set_constraint