On the combination of symbolic constraints, solution domains, and constraint solvers
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
57 S.
- Language
-
Englisch
- Notes
-
Literaturverz. S. 53 - 57
- Bibliographic citation
-
CIS-Bericht / Centrum für Informations- und Sprachverarbeitung ; 82
- Event
-
Veröffentlichung
- (where)
-
München
- (who)
-
CIS
- (when)
-
[1994]
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 12:04 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
- Baader, Franz
- Schulz, Klaus U.
- CIS
Time of origin
- [1994]
Other Objects (12)
Description Logics with Symbolic Number Restrictions
Description Logics with Aggregates and Concrete Domains
A scheme for integrating concrete domains into concept languages
Description Logics with Aggregates and Concrete Domains, Part II
Using model theory to find w-admissible concrete domains
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version
Combination of Compatible Reduction Orderings that are Total on Ground Terms
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL
Concept Descriptions with Set Constraints and Cardinality Constraints
On the Complexity of Boolean Unification
Terminological cycles in a description logic with existential restrictions
Description Logics with Symbolic Number Restrictions
Description Logics with Aggregates and Concrete Domains
A scheme for integrating concrete domains into concept languages
Description Logics with Aggregates and Concrete Domains, Part II
Using model theory to find w-admissible concrete domains
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version
Combination of Compatible Reduction Orderings that are Total on Ground Terms
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL
Concept Descriptions with Set Constraints and Cardinality Constraints
On the Complexity of Boolean Unification
Terminological cycles in a description logic with existential restrictions
Description Logics with Symbolic Number Restrictions
Description Logics with Aggregates and Concrete Domains
A scheme for integrating concrete domains into concept languages
Description Logics with Aggregates and Concrete Domains, Part II
Using model theory to find w-admissible concrete domains
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics : Extended Version
Combination of Compatible Reduction Orderings that are Total on Ground Terms
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL
Concept Descriptions with Set Constraints and Cardinality Constraints
On the Complexity of Boolean Unification