default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 23 matches
- 1999
- Christophe Aillaud, Pierre Deransart:
Vers un arbre de spécification d'arbres de choix en PLC. JFPLC 1999: 249-264 - Alexander Bockmayr, Thomas Kasper:
Branch-and-Infer: an Unifying Framework for Integer Linear Programming and Finite Domain Constraint Programming. JFPLC 1999: 141-142 - Serge Colin, Frédéric Mesnard, Antoine Rauzy:
Un module Prolog de mu-calcul booléen: une réalisation par BDD. JFPLC 1999: 23-38 - Michael I. Dekhtyar, Alexander Ja. Dikovsky, Nicolas Spyratos:
Incremental Expansion of Database Updates Through Integrity Constraints. JFPLC 1999: 189-204 - Giorgio Delzanno, Andreas Podelski:
Verification of Infinite-State Systems in Constraint Logic Programming. JFPLC 1999: 13-22 - Simon de Givry, Pierre Savéant, Jean Jourdan:
Optimisation combinatoire en temps limité: Depth First Branch and Bound adaptaif. JFPLC 1999: 161-178 - Frédéric Goualard, Frédéric Benhamou:
Un outil de débogage du store pour la programmation par contraintes. JFPLC 1999: 281-296 - Laurent Granvilliers:
Stratégies de résolution de CSP numériques. JFPLC 1999: 221-240 - Stéphane Grumbach:
Constraint Databases. JFPLC 1999: 179-188 - Pascal Van Hentenryck:
Localizer: A Modeling Language for Local Search. JFPLC 1999: 143-144 - Erwan Jahier, Mireille Ducassé:
Un traceur d'exécution de programme ne sert pas qu'au débogage. JFPLC 1999: 297-311 - Hélène Kirchner:
ELAN. JFPLC 1999: 241-248 - Arnaud Lallouet, Gaétan Hains:
Programmation par contraintes parallèle: l'approche CLP(Chi). JFPLC 1999: 107-122 - Patricia Mainguet:
Résolution incrémentale d'inéquations linéairés à variables dans Z. JFPLC 1999: 205-220 - Frédéric Malésieux, Olivier Ridoux, Patrice Boizumault:
Analyse statique typée: application à l'analyse de clôtures de lambda-Prolog. JFPLC 1999: 55-72 - Christophe Mauras, René Thoraval:
A propos de la vérification de programmes synchrones et de l'analyse de programmes logiques aves contraintes. JFPLC 1999: 39-54 - Éric Monfroy, Jean-Hugues Réty:
Itérations asynchrones: un cadre uniforme pour la propagation de contraintes parallèle et répartie. JFPLC 1999: 123-140 - Luc De Raedt:
Database Mining and Inductive Logic Programming. JFPLC 1999: 73-74 - Gilles Richard:
Comparison between Programs and Concepts in ILP. JFPLC 1999: 75-88 - Louis-Martin Rousseau, Gilles Pesant:
Une hybridation de programmation par contraintes et recherche locale pour le problème de tournées de véhicules. JFPLC 1999: 145-160 - Frédéric Saubion, Igor Stéphan:
Implanter des langages d'arbres en Prolog. JFPLC 1999: 89-106 - Helmut Simonis, Abderrahmane Aggoun:
Search Tree Debugging. JFPLC 1999: 265-280 - François Fages:
JFPLC'99, Huitièmes Journées Francophones de Programmation Logique et programmation par Contraintes, 2-4 juin 199, Lyon, France. Hermes 1999 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-01-02 21:07 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint