Bruno Legeard

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mohamed Hibti

> Home > Persons > Bruno Legeard

Publications

1997
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ita/HibtiLL97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/HibtiLL97
Mohamed Hibti, Bruno Legeard, Henri Lombardi:
Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini. RAIRO Theor. Informatics Appl. 31(3): 205-236 (1997)
1993
[c9]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/iclp/AmbertHLL93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclp/AmbertHLL93
Fabrice Ambert, Mohamed Hibti, Henri Lombardi, Bruno Legeard:
Constraints over Homogeneous Hereditarily Finite Sets. ICLP Workshop on Logic Programming with Sets 1993
[c8]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/iclp/HibtiLL93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclp/HibtiLL93
Mohamed Hibti, Henri Lombardi, Bruno Legeard:
Set-Unification from Another Point of View. ICLP Workshop on Logic Programming with Sets 1993
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/lpar/HibtiLL93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lpar/HibtiLL93
Mohamed Hibti, Henri Lombardi, Bruno Legeard:
Deciding in HFS-Theory via Linear Integer Programming. LPAR 1993: 170-181

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.