![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 68 matches
- 2000
- Ali H. Alsaffar, Jitender S. Deogun, Hayri Sever:
Optimal Queries in Information Filtering. ISMIS 2000: 435-443 - Edgar Altamirano, Gonzalo Escalada-Imaz:
An Efficient Proof Method for Non-clausal Reasoning. ISMIS 2000: 534-542 - Aijun An, Nick Cercone:
Rule Quality Measures Improve the Accuracy of Rule Induction: An Experimental Approach. ISMIS 2000: 119-129 - Barbara Armani, Elisa Bertino, Barbara Catania, D. Laradi, B. Marin, Gian Piero Zarri:
Repository Management in an Intelligent Indexing Approach for Multimedia Digital Libraries. ISMIS 2000: 68-76 - Antonio Badia:
Extending Entity-Relationship Models with Higher-Order Operators. ISMIS 2000: 321-330 - Brock Barber, Howard J. Hamilton:
Parametric Algorithms for Mining Share-Frequent Itemsets. ISMIS 2000: 562-572 - Rosy Barruffi, Michela Milano, Paolo Torroni:
Planning while Executing: A Constraint-Based Approach. ISMIS 2000: 228-236 - Jeffrey K. Bassett, Kenneth A. De Jong:
Evolving Behaviors for Cooperating Agents. ISMIS 2000: 157-165 - Cécile Boisson, Nahid Shahmehri:
Template Generation for Identifying Text Patterns. ISMIS 2000: 463-473 - Moussa Boussouf, Mohamed Quafafou:
Data Reduction via Conflicting Data Analysis. ISMIS 2000: 139-147 - Jianhua Chen:
Combining Description Logics with Stratified Logic Programs in Knowledge Representation. ISMIS 2000: 331-339 - W. Bruce Croft:
Information Retrieval Based on Statistical Language Models. ISMIS 2000: 1-11 - Alfredo Cruz:
PLAtestGA: A CNF-Satisfiability Problem for the Generation of Test Vectors for Missing Faults in VLSI Circuits. ISMIS 2000: 186-195 - Diana R. Cundell, Randy S. Silibovsky, Robyn Sanders, Les M. Sztandera:
Using Intelligent Systems in Predictions of the Bacterial Causative Agent of an Infection. ISMIS 2000: 349-357 - Robert Demolombe, Maria del Pilar Pozos Parra:
A Simple and Tractable Extension of Situation Calculus to Epistemic Logic. ISMIS 2000: 515-524 - Bipin C. Desai, Sami S. Haddad, Abdelbaset Ali:
Automatic Semantic Header Generator. ISMIS 2000: 444-452 - Essam A. El-Kwae:
Signature-Based Indexing for Retrieval by Spatial Content in Large 2D-String Image Databases. ISMIS 2000: 97-108 - Tapio Elomaa, Juho Rousu:
On the Complexity of Optimal Multisplitting. ISMIS 2000: 552-561 - Philip J. Emmerman, Uma Y. Movva:
Intelligent Agent Battlespace Augmentation. ISMIS 2000: 12-20 - Floriana Esposito, Nicola Fanizzi, Stefano Ferilli, Giovanni Semeraro:
Refining Logic Theories under OI-Implication. ISMIS 2000: 109-118 - Chris Fernandes, Lawrence J. Henschen:
Discovering and Resolving User Intent in Heterogeneous Databases. ISMIS 2000: 389-399 - Ada Wai-Chee Fu, Renfrew W.-w. Kwong, Jian Tang:
Mining N-most Interesting Itemsets. ISMIS 2000: 59-67 - Attilio Giordana, Lorenza Saitta, Michèle Sebag, Marco Botta:
Can Relational Learning Scale Up? ISMIS 2000: 31-39 - Jerzy W. Grzymala-Busse, Pankaj Shah:
A Comparison of Rule Matching Methods Used in AQ15 and LERS. ISMIS 2000: 148-156 - Mohand-Said Hacid, Farouk Toumani:
Logic-Based Approach to Semistructured Data Retrieval. ISMIS 2000: 77-85 - Aladdin Hafez:
A Dynamic Approach for Knowledge Discovery of Web Access Patterns. ISMIS 2000: 130-138 - Jörg Hoffmann:
A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm. ISMIS 2000: 216-227 - C. A. Johnson:
Top-Down Query Processing in First Order Deductive Databases under the DWFS. ISMIS 2000: 377-388 - Kamran Karimi, Howard J. Hamilton:
Finding Temporal Relations: Causal Bayesian Networks vs. C4.5. ISMIS 2000: 266-273 - Jennifer Kashmirian, Lin Padgham:
Relative Robustness: An Empirical Investigation of Behaviour Based and Plan Based Paradigms as Environmental Conditions Change. ISMIS 2000: 205-215
skipping 38 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-02-17 20:25 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