default search action
Laurent Henocque
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [c14]Patrick Albert, Laurent Henocque, Mathias Kleiner:
Ant Colony Optimization for Configuration. ICTAI (1) 2008: 247-254 - [c13]Patrick Albert, Laurent Henocque, Mathias Kleiner:
An End-to-End Configuration-Based Framework for Automatic SWS Composition. ICTAI (1) 2008: 351-358 - 2006
- [j2]Gilles Audemard, Belaid Benhamou, Laurent Henocque:
Predicting and Detecting Symmetries in FOL Finite Model Search. J. Autom. Reason. 36(3): 177-212 (2006) - 2005
- [c12]Patrick Albert, Laurent Henocque, Mathias Kleiner:
A Constrained Object Model for Configuration Based Workflow Composition. Business Process Management Workshops 2005: 102-115 - [c11]Laurent Henocque, Mathias Kleiner, Nicolas Prcovic:
Advances in Polytime Isomorph Elimination for Configuration. CP 2005: 301-313 - [c10]Patrick Albert, Laurent Henocque, Mathias Kleiner:
Configuration-Based Workflow Composition. ICWS 2005: 285-292 - [i3]Patrick Albert, Laurent Henocque, Mathias Kleiner:
A Constrained Object Model for Configuration Based Workflow Composition. CoRR abs/cs/0506031 (2005) - 2004
- [c9]Mathieu Estratat, Laurent Henocque:
An Intuitive Tool for Constraint Based Grammars. CSLP 2004: 121-139 - [c8]Mathieu Estratat, Laurent Henocque:
Parsing Languages with a Configurator. ECAI 2004: 591-595 - [c7]Laurent Henocque, Nicolas Prcovic:
Practically Handling Some Configuration Isomorphisms. ICTAI 2004: 90-97 - [c6]Mathieu Estratat, Laurent Henocque:
Application des programmes de contraintes orientés objet à l'analyse du langage naturel. TALN (Articles longs) 2004: 209-218 - 2003
- [c5]Stéphane Grandcolas, Laurent Henocque, Nicolas Prcovic:
A Canonicity Test for Configuration. CP 2003: 853-857 - [i2]Stéphane Grandcolas, Laurent Henocque, Nicolas Prcovic:
Pruning Isomorphic Structural Sub-problems in Configuration. CoRR cs.AI/0306135 (2003) - [i1]Laurent Henocque:
Modeling Object Oriented Constraint Programs in Z. CoRR cs.AI/0312020 (2003) - 2002
- [e1]Jacques Calmet, Belaid Benhamou, Olga Caprotti, Laurent Henocque, Volker Sorge:
Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Joint International Conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002, Proceedings. Lecture Notes in Computer Science 2385, Springer 2002, ISBN 3-540-43865-3 [contents] - 2001
- [c4]Gilles Audemard, Laurent Henocque:
The eXtended Least Number Heuristic. IJCAR 2001: 427-442 - 2000
- [c3]Gilles Audemard, Belaid Benhamou, Laurent Henocque:
Two Techniques to Improve Finite Model Search. CADE 2000: 302-308
1990 – 1999
- 1999
- [j1]Belaid Benhamou, Laurent Henocque:
A Hybrid Method for Finite Model Search in Equational Theories. Fundam. Informaticae 39(1-2): 21-38 (1999) - 1998
- [c2]Belaid Benhamou, Laurent Henocque:
Finite Model Search for Equational Theories (FMSET). AISC 1998: 84-93 - 1993
- [c1]Laurent Henocque:
Model search with equality: a language and incremental proof procedure for discourse analysis. JFPL 1993: 109-125
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint