English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Co-definite Set Constraints

Charatonik, W., & Podelski, A. (1998). Co-definite Set Constraints. In T. Nipkow (Ed.), Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98) (pp. 211-225). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Charatonik, Witold1, Author           
Podelski, Andreas1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: In this paper, we introduce the class of co-definite set constraints. This is a natural subclass of set constraints which, when satisfiable, have a {\em greatest}\/ solution. It is practically motivated by the set-based analysis of logic programs with the greatest-model semantics. We present an algorithm solving co-definite set constraints and show that their satisfiability problem is DEXPTIME-complete.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121998
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519672
Other: Local-ID: C1256104005ECAFC-B8F936260BDB3475412566F800614A80-CharatonikPodelski-RTA98
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Tsukuba, Japan
Start-/End Date: 1998

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98)
Source Genre: Proceedings
 Creator(s):
Nipkow, Tobias, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 211 - 225 Identifier: ISBN: 3-540-64301-X

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 1379 Sequence Number: - Start / End Page: - Identifier: -