Practically handling some configuration isomorphisms

Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking values for object attributes. A configuration can be viewed as a graph of interconnected components. An inherent difficulty in solving configura...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:16th IEEE International Conference on Tools with Artificial Intelligence S. 90 - 97
Hauptverfasser: Henocque, L., Prcovic, N.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: Los Alamitos CA IEEE 2004
Schlagworte:
ISBN:9780769522364, 076952236X
ISSN:1082-3409
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking values for object attributes. A configuration can be viewed as a graph of interconnected components. An inherent difficulty in solving configuration problems is the existence of many structural isomorphisms. A practical way of dealing with isomorphisms is by isolating one configuration in each equivalence class called a canonical representative. Since no poly time algorithm is known for the general graph isomorphism problem, it is interesting to explore subproblems that can efficiently be exploited by backtrack search procedures. We describe a formalism independent approach to detect a large number of structure related configuration isomorphisms. The algorithm has the essential property that isomorphism detection is both incremental and can be performed in pseudo linear time, two essential conditions for backtrack search. Backtrack occurs as soon as a nonweakly canonical DAG structure is generated for a configuration, which allows to extend the range of practically tractable problems, as shown experimentally. Weakly canonical configurations explicitly expose their automorphism group, which are readily available thanks to the lexicographic ordering chosen. The efficiency of the approach is assessed both theoretically and by experimental results obtained for a range of realistic configuration problems.
AbstractList Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking values for object attributes. A configuration can be viewed as a graph of interconnected components. An inherent difficulty in solving configuration problems is the existence of many structural isomorphisms. A practical way of dealing with isomorphisms is by isolating one configuration in each equivalence class called a canonical representative. Since no poly time algorithm is known for the general graph isomorphism problem, it is interesting to explore subproblems that can efficiently be exploited by backtrack search procedures. We describe a formalism independent approach to detect a large number of structure related configuration isomorphisms. The algorithm has the essential property that isomorphism detection is both incremental and can be performed in pseudo linear time, two essential conditions for backtrack search. Backtrack occurs as soon as a nonweakly canonical DAG structure is generated for a configuration, which allows to extend the range of practically tractable problems, as shown experimentally. Weakly canonical configurations explicitly expose their automorphism group, which are readily available thanks to the lexicographic ordering chosen. The efficiency of the approach is assessed both theoretically and by experimental results obtained for a range of realistic configuration problems.
Author Henocque, L.
Prcovic, N.
Author_xml – sequence: 1
  givenname: L.
  surname: Henocque
  fullname: Henocque, L.
  organization: Lab. des Sci. de l'Inf. et des Systemes, CNRS, Marseille, France
– sequence: 2
  givenname: N.
  surname: Prcovic
  fullname: Prcovic, N.
  organization: Lab. des Sci. de l'Inf. et des Systemes, CNRS, Marseille, France
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19103822$$DView record in Pascal Francis
BookMark eNpFTj1PwzAUtESRKCUrC0sWxpT3bCe2xyrio1IlGMpcPSd2a5Q6VRyG_nuCisQtJ92d7u6WzWIfHWP3CEtEME_rertaLzmAXCLgFcuM0qAqU3IuKjljcwTNCyHB3LAspS-YUIICU82Z_BioGUNDXXfODxTbLsR9nvqjy5s--rD_HmgMfczDpPXD6RDSMd2xa09dctkfL9jny_O2fis276_rerUpAodyLFBYQ1oIJYVHLkrJbenJE7aVV7YlkNKSl1xjo6sWpNLCKoKWe26drbhYsMdL74nS9NAPFJuQdqchHGk479AgCM1_cw-XXHDO_dvTME7bP4mbVHQ
ContentType Conference Proceeding
Copyright 2007 INIST-CNRS
Copyright_xml – notice: 2007 INIST-CNRS
DBID 6IE
6IH
CBEJK
RIE
RIO
IQODW
DOI 10.1109/ICTAI.2004.101
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
Pascal-Francis
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EndPage 97
ExternalDocumentID 19103822
1374174
Genre orig-research
GroupedDBID 23M
29O
6IE
6IF
6IH
6IK
6IL
6IN
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
M43
OCL
RIE
RIL
RIO
IQODW
ID FETCH-LOGICAL-i205t-13b9a833743f123542b5fafa1d6f7bda044baf4281c86d04783b7a0d2f2beb623
IEDL.DBID RIE
ISBN 9780769522364
076952236X
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000225597000011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1082-3409
IngestDate Mon Jul 21 09:12:45 EDT 2025
Tue Aug 26 18:21:52 EDT 2025
IsPeerReviewed false
IsScholarly false
Keywords Equivalence classes
Lexicography
Isomorphism
Ordering
Linear condition
Linear time
Graph theory
Automorphism group
Catalogs
Artificial intelligence
Language English
License CC BY 4.0
LinkModel DirectLink
MeetingName 16th IEEE international conference on tools with artificial intelligence ICTAI 2004 (Boca Raton Fl, 15-17 November 2004)
MergedId FETCHMERGED-LOGICAL-i205t-13b9a833743f123542b5fafa1d6f7bda044baf4281c86d04783b7a0d2f2beb623
PageCount 8
ParticipantIDs ieee_primary_1374174
pascalfrancis_primary_19103822
PublicationCentury 2000
PublicationDate 20040000
2004
PublicationDateYYYYMMDD 2004-01-01
PublicationDate_xml – year: 2004
  text: 20040000
PublicationDecade 2000
PublicationPlace Los Alamitos CA
PublicationPlace_xml – name: Los Alamitos CA
PublicationTitle 16th IEEE International Conference on Tools with Artificial Intelligence
PublicationTitleAbbrev TAI
PublicationYear 2004
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000507096
ssj0020523
Score 1.3348924
Snippet Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking...
SourceID pascalfrancis
ieee
SourceType Index Database
Publisher
StartPage 90
SubjectTerms Applied sciences
Artificial intelligence
Computer science; control theory; systems
Exact sciences and technology
Large scale integration
Linear programming
Linearity
System testing
Test pattern generators
Tree data structures
Tree graphs
Vehicle dynamics
Title Practically handling some configuration isomorphisms
URI https://ieeexplore.ieee.org/document/1374174
WOSCitedRecordID wos000225597000011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEN4A8eAJFYz4ID14tLLdXbrdoyESuRAOmHAj-zRNhBoKJv57Z7sFNPHirc90O91m5pud-T6E7iFEtkMrZGyp1ABQWBorgnmspXAZdhm4YFaJTfDpNFssxKyBHg69MNbaqvjMPvrNai3fFHrnU2WDhIL_46yJmpynoVfrkE_BENhgTx1Xgy2f7gzF9SSmAGICZBcQbtB0z7yz32c1m2OCxWAymj9NKtzogW2tueIrJmUJRnNB7eKHCxq3_zf4M9Q99vJFs4OXOkcNu75A7b2YQ1T_2x3EAnMRPP39K6q4F-DyqCxWNgLI7PK3XZgrUQ7HCvg6ebkqu-h1_DwfvcS1pEKcg0W88LwSMqMwFOp8lywjauikk4lJHVdGYsaUdABJEp2lxjP3UMUlNsQRZRWESpeotS7W9gpFmBmZsqESiYYoQChJdcaFccJoRZxJeqjjjbD8CKwZy_r9e6j_y5TH88JztRNy_fd9N-g0FM347Mctam03O3uHTvTnNi83_WoufAOoP65D
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEJ4gmugJFYz4wB48Wtlut489GqKBiIQDJtzIbnfXNBFqKJj4751tC2jixVuf6Xa6zcw3O_N9ALcYIutAc-FqXyQIUFjoSkoiNxHcxMTE6IJZITYRjUbxdMrHNbjb9sJorYviM31vN4u1fJUla5sq63o--r-I7cF-wBglZbfWNqNCMLQhljyugls24VmW11PXRxhTgnaOAYcfbrh3Nvus4nP0CO8OepOHQYEcLbStVFdszaTI0Wym1Lv44YSeGv8b_jG0dt18znjrp06gphen0NjIOTjV390EVnIX4dPfv5yCfQEvd_Jsrh0EzSZ9W5ezxUnxWIbfJ83neQtenx4nvb5biSq4KVrESs9LLmIfh-Ib2yfLqAyMMMJToYmkEoQxKQyCEi-JQ2W5e3wZCaKooVJLDJbOoL7IFvocHMKUCFkguZdgHMCl8JM44spwlUhqlNeGpjXC7KPkzZhV79-Gzi9T7s5zy9ZO6cXf993AYX_yMpwNB6PnSzgqS2hsLuQK6qvlWl_DQfK5SvNlp5gX3-xYsYo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+-+International+Conference+on+Tools+with+Artificial+Intelligence%2C+TAI&rft.atitle=Practically+handling+some+configuration+isomorphisms&rft.au=HENOCQUE%2C+Laurent&rft.au=PRCOVIC%2C+Nicolas&rft.date=2004-01-01&rft.pub=IEEE&rft.isbn=9780769522364&rft.issn=1082-3409&rft.spage=90&rft.epage=97&rft_id=info:doi/10.1109%2FICTAI.2004.101&rft.externalDBID=n%2Fa&rft.externalDocID=19103822
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1082-3409&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1082-3409&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1082-3409&client=summon