Anzeige
Erschienen in:
2003 | OriginalPaper | Buchkapitel
An Algorithm for the Unification of Conceptual Graphs with Constraints
verfasst von : Dan Corbett
Erschienen in: Reasoning and Unification over Conceptual Graphs
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Constraint Satisfaction Problems (CSP) are a well-understood and well-researched area, and many tools exist to handle CSP [Cohen 1990; Frost and Dechter 1994; Gini and Rogialli 1994; Van Hentenryck et al. 1997]. These languages and tools are excellent at handling real numbers, and simultaneous equations. However, most still fall short in representation power, as they lack sufficiently complex knowledge structures to represent the knowledge of many interesting domains, as will be discussed in Chapter Four.