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 13 matches
- 2004
- Hachemi Bennaceur:
A Comparison between SAT and CSP Techniques. Constraints An Int. J. 9(2): 123-138 (2004) - S. Durga Bhavani, Arun K. Pujari:
EvIA - Evidential Interval Algebra and Heuristic Backtrack-Free Algorithm. Constraints An Int. J. 9(3): 193-218 (2004) - David A. Cohen:
Tractable Decision for a Constraint Language Implies Tractable Search. Constraints An Int. J. 9(3): 219-229 (2004) - Jean-François Condotta:
A General Qualitative Framework for Temporal and Spatial Reasoning. Constraints An Int. J. 9(2): 99-121 (2004) - Agostino Dovier, Carla Piazza, Enrico Pontelli:
Disunification in ACI1 Theories. Constraints An Int. J. 9(1): 35-91 (2004) - François Fages, Sylvain Soliman, Rémi Coolen:
CLPGUI: A Generic Graphical User Interface for Constraint Logic Programming. Constraints An Int. J. 9(4): 241-262 (2004) - Hélène Fargier, Marie-Catherine Vilarem:
Compiling CSPs into Tree-Driven Automata for Interactive Solving. Constraints An Int. J. 9(4): 263-287 (2004) - Richard Gault, Peter Jeavons:
Implementing a Test for Tractability. Constraints An Int. J. 9(2): 139-160 (2004) - Guillem Godoy, Robert Nieuwenhuis:
Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups. Constraints An Int. J. 9(3): 167-192 (2004) - Barry O'Sullivan:
Introduction to the Special Issue on User-Interaction in Constraint Satisfaction. Constraints An Int. J. 9(4): 239-240 (2004) - Pearl Pu, Boi Faltings:
Decision Tradeoff Using Example-Critiquing and Constraint Programming. Constraints An Int. J. 9(4): 289-310 (2004) - Francesca Rossi, Alessandro Sperduti:
Acquiring Both Constraint and Solution Preferences in Interactive Constraint Systems. Constraints An Int. J. 9(4): 311-332 (2004) - Mark Wallace, Joachim Schimpf, Kish Shen, Warwick Harvey:
On Benchmarking Constraint Logic Programming Platforms. Response to Fernandez and Hill's "A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains". Constraints An Int. J. 9(1): 5-34 (2004)
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 2024-12-19 23:47 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