On algorithms and complexity for sets with cardinality constraints : PSPACE and PTIME logics for program analysis
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Auch als: MIT CSAIL Technical Report ; MIT-LCS-TR-997
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
[Wadern]
- (who)
-
[Internat. Begegnungs- und Forschungszentrum für Informatik]
- (when)
-
[2006]
- Creator
-
Kuncak, Viktor
Rinard, Martin
Marnette, Bruno
- URN
-
urn:nbn:de:0030-drops-5125
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:43 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kuncak, Viktor
- Rinard, Martin
- Marnette, Bruno
- [Internat. Begegnungs- und Forschungszentrum für Informatik]
Time of origin
- [2006]
Other Objects (12)
Complexity results and practical algorithms for logics in knowledge representation
Complexity results and practical algorithms for logics in knowledge representation
Randomness in complexity theory and logics
Fixed point logics and generalized quantifiers in descriptive complexity
On the Complexity and Expressiveness of Description Logics with Counting
Towards Constructive Description Logics for Abstraction and Refinement
Logics for Mazurkiewicz traces
Logics for linguistic structures
Integrating Reasoning Services for Description Logics with Cardinality Constraints with Numerical Optimization Techniques
To and fro between tableaus and automata for description logics
Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures
On the complexity of fragments of nonmonotonic logics
Complexity results and practical algorithms for logics in knowledge representation
Complexity results and practical algorithms for logics in knowledge representation
Randomness in complexity theory and logics
Fixed point logics and generalized quantifiers in descriptive complexity
On the Complexity and Expressiveness of Description Logics with Counting
Towards Constructive Description Logics for Abstraction and Refinement
Logics for Mazurkiewicz traces
Logics for linguistic structures
Integrating Reasoning Services for Description Logics with Cardinality Constraints with Numerical Optimization Techniques
To and fro between tableaus and automata for description logics
Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures
On the complexity of fragments of nonmonotonic logics
Complexity results and practical algorithms for logics in knowledge representation
Complexity results and practical algorithms for logics in knowledge representation
Randomness in complexity theory and logics
Fixed point logics and generalized quantifiers in descriptive complexity
On the Complexity and Expressiveness of Description Logics with Counting
Towards Constructive Description Logics for Abstraction and Refinement
Logics for Mazurkiewicz traces
Logics for linguistic structures
Integrating Reasoning Services for Description Logics with Cardinality Constraints with Numerical Optimization Techniques
To and fro between tableaus and automata for description logics
Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures